./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:30,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:30,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:30,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:30,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:30,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:30,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:30,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:30,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:30,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:30,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:30,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:30,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:30,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:30,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:30,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:30,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:30,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:30,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:30,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:30,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:30,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:30,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:30,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:30,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:30,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:30,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:30,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:30,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:30,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:30,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:30,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:30,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:30,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:30,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:30,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:30,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:30,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:30,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:30,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:30,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:30,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:56:30,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:30,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:30,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:30,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:30,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:30,792 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:30,793 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:30,793 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:30,793 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:30,793 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:30,793 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:30,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:30,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:30,794 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:30,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:30,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:30,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:30,796 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:30,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:30,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:30,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:30,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:30,796 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:30,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:30,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:30,797 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:30,798 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:30,798 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb [2019-10-22 08:56:30,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:30,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:30,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:30,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:30,844 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:30,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum10-1.i [2019-10-22 08:56:30,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/data/5379a907f/8526243312c54c7181ed0298e78ff7a9/FLAG1098ba684 [2019-10-22 08:56:31,283 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:31,284 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/sv-benchmarks/c/reducercommutativity/sum10-1.i [2019-10-22 08:56:31,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/data/5379a907f/8526243312c54c7181ed0298e78ff7a9/FLAG1098ba684 [2019-10-22 08:56:31,698 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/data/5379a907f/8526243312c54c7181ed0298e78ff7a9 [2019-10-22 08:56:31,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:31,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:31,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:31,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:31,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:31,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:31" (1/1) ... [2019-10-22 08:56:31,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1288fdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:31, skipping insertion in model container [2019-10-22 08:56:31,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:31" (1/1) ... [2019-10-22 08:56:31,714 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:31,729 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:31,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:31,935 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:32,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:32,044 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:32,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32 WrapperNode [2019-10-22 08:56:32,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:32,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:32,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:32,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:32,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:32,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:32,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:32,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:32,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... [2019-10-22 08:56:32,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:32,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:32,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:32,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:32,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:32,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:32,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:32,405 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:32,406 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 08:56:32,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:32 BoogieIcfgContainer [2019-10-22 08:56:32,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:32,408 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:32,408 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:32,412 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:32,413 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:32,414 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:31" (1/3) ... [2019-10-22 08:56:32,415 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2113c26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:32, skipping insertion in model container [2019-10-22 08:56:32,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:32,415 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:32" (2/3) ... [2019-10-22 08:56:32,416 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2113c26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:32, skipping insertion in model container [2019-10-22 08:56:32,416 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:32,416 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:32" (3/3) ... [2019-10-22 08:56:32,418 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2019-10-22 08:56:32,507 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:32,516 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:32,517 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:32,517 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:32,517 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:32,517 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:32,518 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:32,518 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:32,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 08:56:32,582 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-10-22 08:56:32,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:32,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:32,597 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:32,606 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:32,606 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:32,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2019-10-22 08:56:32,608 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2019-10-22 08:56:32,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:32,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:32,609 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:32,609 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:32,626 INFO L791 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2019-10-22 08:56:32,627 INFO L793 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2019-10-22 08:56:32,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:32,643 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:56:32,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:32,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059701412] [2019-10-22 08:56:32,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,769 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:32,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:56:32,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:32,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901045034] [2019-10-22 08:56:32,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,785 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:32,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:56:32,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:32,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274296377] [2019-10-22 08:56:32,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:32,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:32,824 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:32,950 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:32,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:32,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:32,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:32,955 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:32,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:32,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:32,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:32,955 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2019-10-22 08:56:32,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:32,956 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:32,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:32,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:33,266 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:33,271 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:33,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,275 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,275 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,275 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,276 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,276 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,277 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,283 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,283 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,285 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,286 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,287 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,288 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,292 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,292 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,295 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,295 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,299 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,300 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,300 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,300 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,300 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,300 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,301 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,303 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,304 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,304 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,304 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,309 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,309 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,309 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,310 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,311 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,312 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,312 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,312 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,312 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,314 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,314 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,319 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,320 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,320 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,320 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,327 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,327 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,329 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,329 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,330 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,332 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:33,332 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,332 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,334 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:33,334 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,352 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,353 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,354 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:33,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,356 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:33,356 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:33,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,361 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,361 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:33,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:33,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:33,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:33,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:33,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:33,375 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:33,375 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:33,413 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:33,457 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:33,458 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:33,464 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:33,465 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:33,466 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:33,466 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-10-22 08:56:33,471 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-10-22 08:56:33,479 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:56:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:33,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:33,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,567 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:56:33,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2019-10-22 08:56:33,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2019-10-22 08:56:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2019-10-22 08:56:33,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:56:33,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:33,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:56:33,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:33,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:56:33,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:33,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2019-10-22 08:56:33,658 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2019-10-22 08:56:33,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:56:33,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:33,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2019-10-22 08:56:33,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:33,664 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:56:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2019-10-22 08:56:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 08:56:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:56:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-22 08:56:33,689 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:56:33,690 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-22 08:56:33,690 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:33,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-10-22 08:56:33,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:33,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:33,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:33,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:33,691 INFO L791 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 145#L23-3 assume !(main_~i~1 < 10); 144#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 137#L9-3 [2019-10-22 08:56:33,691 INFO L793 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 138#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 137#L9-3 [2019-10-22 08:56:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-10-22 08:56:33,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:33,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208289088] [2019-10-22 08:56:33,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208289088] [2019-10-22 08:56:33,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:33,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:33,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49330648] [2019-10-22 08:56:33,752 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2019-10-22 08:56:33,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:33,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191103409] [2019-10-22 08:56:33,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:33,767 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:33,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:33,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:33,799 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:56:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:33,813 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-10-22 08:56:33,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:33,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-10-22 08:56:33,816 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2019-10-22 08:56:33,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:33,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:33,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-10-22 08:56:33,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:33,817 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-22 08:56:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-10-22 08:56:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-10-22 08:56:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 08:56:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-22 08:56:33,820 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 08:56:33,821 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 08:56:33,821 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:33,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2019-10-22 08:56:33,821 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:33,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:33,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:33,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:33,822 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 190#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 10); 189#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L9-3 [2019-10-22 08:56:33,822 INFO L793 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 182#L9-3 [2019-10-22 08:56:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-10-22 08:56:33,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:33,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977433748] [2019-10-22 08:56:33,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977433748] [2019-10-22 08:56:33,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437560167] [2019-10-22 08:56:33,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:33,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,896 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:33,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 08:56:33,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679003829] [2019-10-22 08:56:33,897 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2019-10-22 08:56:33,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:33,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562119596] [2019-10-22 08:56:33,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:33,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:33,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:33,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:33,934 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 08:56:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:33,950 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-10-22 08:56:33,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:33,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-10-22 08:56:33,951 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2019-10-22 08:56:33,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:33,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:33,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2019-10-22 08:56:33,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:33,953 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-22 08:56:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2019-10-22 08:56:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-22 08:56:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:56:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-22 08:56:33,955 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 08:56:33,955 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 08:56:33,955 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:33,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-10-22 08:56:33,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:33,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:33,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:33,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-10-22 08:56:33,957 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:33,957 INFO L791 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 254#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 256#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 264#L23-3 assume !(main_~i~1 < 10); 253#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 246#L9-3 [2019-10-22 08:56:33,957 INFO L793 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L9-3 [2019-10-22 08:56:33,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-10-22 08:56:33,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:33,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57676398] [2019-10-22 08:56:33,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:33,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:33,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57676398] [2019-10-22 08:56:33,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658663058] [2019-10-22 08:56:33,986 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:34,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:34,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:34,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,049 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:34,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-22 08:56:34,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249439080] [2019-10-22 08:56:34,050 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2019-10-22 08:56:34,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686763945] [2019-10-22 08:56:34,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,061 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:34,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:34,102 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-10-22 08:56:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,132 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2019-10-22 08:56:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:34,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2019-10-22 08:56:34,135 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2019-10-22 08:56:34,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:34,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:34,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-10-22 08:56:34,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,136 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-22 08:56:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-10-22 08:56:34,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-22 08:56:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 08:56:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-10-22 08:56:34,138 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 08:56:34,138 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-10-22 08:56:34,138 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:34,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-10-22 08:56:34,146 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:34,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:34,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-10-22 08:56:34,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:34,147 INFO L791 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 329#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 331#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 10); 328#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 321#L9-3 [2019-10-22 08:56:34,147 INFO L793 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 322#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 321#L9-3 [2019-10-22 08:56:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-10-22 08:56:34,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422388] [2019-10-22 08:56:34,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422388] [2019-10-22 08:56:34,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602039207] [2019-10-22 08:56:34,198 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:34,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-22 08:56:34,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:34,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,262 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:34,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 08:56:34,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693085025] [2019-10-22 08:56:34,263 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:34,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2019-10-22 08:56:34,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743380392] [2019-10-22 08:56:34,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,273 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:34,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:34,303 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-10-22 08:56:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,333 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-10-22 08:56:34,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:34,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2019-10-22 08:56:34,336 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2019-10-22 08:56:34,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:34,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:34,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2019-10-22 08:56:34,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,337 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-22 08:56:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2019-10-22 08:56:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-10-22 08:56:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:56:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-22 08:56:34,342 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-22 08:56:34,342 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-22 08:56:34,342 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:34,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-10-22 08:56:34,342 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:34,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:34,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-10-22 08:56:34,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:34,343 INFO L791 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 415#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 417#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 420#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 10); 414#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 407#L9-3 [2019-10-22 08:56:34,344 INFO L793 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 408#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 407#L9-3 [2019-10-22 08:56:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-10-22 08:56:34,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388841440] [2019-10-22 08:56:34,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388841440] [2019-10-22 08:56:34,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989621593] [2019-10-22 08:56:34,407 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:34,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:34,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:34,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,459 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:34,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-22 08:56:34,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061577965] [2019-10-22 08:56:34,460 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2019-10-22 08:56:34,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891822018] [2019-10-22 08:56:34,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,479 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:34,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:34,511 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-10-22 08:56:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,540 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-10-22 08:56:34,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:34,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2019-10-22 08:56:34,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2019-10-22 08:56:34,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:34,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:34,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2019-10-22 08:56:34,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,544 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-22 08:56:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2019-10-22 08:56:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-22 08:56:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:56:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-22 08:56:34,550 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-22 08:56:34,551 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-22 08:56:34,551 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:34,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-10-22 08:56:34,551 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:34,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:34,552 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-10-22 08:56:34,552 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:34,552 INFO L791 eck$LassoCheckResult]: Stem: 518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 516#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 512#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 513#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 514#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 515#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 517#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 528#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 527#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 525#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 524#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 523#L23-3 assume !(main_~i~1 < 10); 511#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 504#L9-3 [2019-10-22 08:56:34,552 INFO L793 eck$LassoCheckResult]: Loop: 504#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 505#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 504#L9-3 [2019-10-22 08:56:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-10-22 08:56:34,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753322810] [2019-10-22 08:56:34,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753322810] [2019-10-22 08:56:34,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209589565] [2019-10-22 08:56:34,619 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:34,667 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-22 08:56:34,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:34,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,681 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:34,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-22 08:56:34,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321636025] [2019-10-22 08:56:34,682 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2019-10-22 08:56:34,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238055236] [2019-10-22 08:56:34,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,692 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:34,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:34,726 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-10-22 08:56:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,753 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-22 08:56:34,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:34,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2019-10-22 08:56:34,754 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2019-10-22 08:56:34,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:34,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:34,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2019-10-22 08:56:34,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,755 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-22 08:56:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2019-10-22 08:56:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-22 08:56:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:56:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-22 08:56:34,757 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 08:56:34,757 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-22 08:56:34,757 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:34,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2019-10-22 08:56:34,758 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:34,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:34,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2019-10-22 08:56:34,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:34,759 INFO L791 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 620#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 621#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 622#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 623#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 625#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 638#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 637#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 636#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 635#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 634#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 633#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 632#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 631#L23-3 assume !(main_~i~1 < 10); 619#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 612#L9-3 [2019-10-22 08:56:34,759 INFO L793 eck$LassoCheckResult]: Loop: 612#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 613#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 612#L9-3 [2019-10-22 08:56:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2019-10-22 08:56:34,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100256786] [2019-10-22 08:56:34,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100256786] [2019-10-22 08:56:34,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401951573] [2019-10-22 08:56:34,824 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:34,905 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-22 08:56:34,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:34,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:34,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:34,917 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:34,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-22 08:56:34,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286330187] [2019-10-22 08:56:34,917 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2019-10-22 08:56:34,918 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651812570] [2019-10-22 08:56:34,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:34,924 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:34,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:34,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:34,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:34,957 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-10-22 08:56:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:34,988 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-10-22 08:56:34,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:34,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2019-10-22 08:56:34,989 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2019-10-22 08:56:34,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:34,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:34,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2019-10-22 08:56:34,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:34,990 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-22 08:56:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2019-10-22 08:56:34,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-22 08:56:34,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:56:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-22 08:56:34,992 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 08:56:34,992 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-22 08:56:34,992 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:56:34,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2019-10-22 08:56:34,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:34,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:34,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:34,993 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2019-10-22 08:56:34,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:34,993 INFO L791 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 743#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 739#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 740#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 741#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 742#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 744#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 759#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 758#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 757#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 756#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 755#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 754#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 753#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 752#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 751#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 750#L23-3 assume !(main_~i~1 < 10); 738#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 731#L9-3 [2019-10-22 08:56:34,993 INFO L793 eck$LassoCheckResult]: Loop: 731#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 731#L9-3 [2019-10-22 08:56:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2019-10-22 08:56:34,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:34,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509630708] [2019-10-22 08:56:34,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,994 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:34,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509630708] [2019-10-22 08:56:35,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637977174] [2019-10-22 08:56:35,077 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:35,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:35,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,131 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:35,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-22 08:56:35,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898436717] [2019-10-22 08:56:35,132 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2019-10-22 08:56:35,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319754715] [2019-10-22 08:56:35,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,141 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:35,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:35,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:56:35,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:56:35,173 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2019-10-22 08:56:35,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:35,207 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-22 08:56:35,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:56:35,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2019-10-22 08:56:35,209 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2019-10-22 08:56:35,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:35,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:35,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2019-10-22 08:56:35,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:35,210 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-22 08:56:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2019-10-22 08:56:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-22 08:56:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:56:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-22 08:56:35,212 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-22 08:56:35,212 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-22 08:56:35,212 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:56:35,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2019-10-22 08:56:35,212 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:35,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:35,213 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2019-10-22 08:56:35,213 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:35,213 INFO L791 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 873#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 869#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 871#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 874#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 891#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 890#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 889#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 888#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 887#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 886#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 885#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 884#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 883#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 882#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 881#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 880#L23-3 assume !(main_~i~1 < 10); 868#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 861#L9-3 [2019-10-22 08:56:35,213 INFO L793 eck$LassoCheckResult]: Loop: 861#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 862#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 861#L9-3 [2019-10-22 08:56:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2019-10-22 08:56:35,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756701199] [2019-10-22 08:56:35,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756701199] [2019-10-22 08:56:35,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980635849] [2019-10-22 08:56:35,295 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:35,341 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:35,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:35,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:56:35,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,353 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:35,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-22 08:56:35,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040410379] [2019-10-22 08:56:35,354 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:35,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2019-10-22 08:56:35,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520726914] [2019-10-22 08:56:35,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:35,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:35,382 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-10-22 08:56:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:35,411 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-22 08:56:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:56:35,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2019-10-22 08:56:35,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2019-10-22 08:56:35,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:35,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:35,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2019-10-22 08:56:35,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:35,413 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-22 08:56:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2019-10-22 08:56:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-22 08:56:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 08:56:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-22 08:56:35,415 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-22 08:56:35,415 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-22 08:56:35,415 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:56:35,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2019-10-22 08:56:35,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:35,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:35,416 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2019-10-22 08:56:35,416 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:35,417 INFO L791 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1014#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1010#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1011#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1012#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1015#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1034#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1033#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1027#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1026#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1025#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1024#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1023#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1022#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1021#L23-3 assume !(main_~i~1 < 10); 1009#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1002#L9-3 [2019-10-22 08:56:35,417 INFO L793 eck$LassoCheckResult]: Loop: 1002#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1003#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1002#L9-3 [2019-10-22 08:56:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2019-10-22 08:56:35,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582655801] [2019-10-22 08:56:35,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582655801] [2019-10-22 08:56:35,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136507088] [2019-10-22 08:56:35,500 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:35,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-22 08:56:35,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:35,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:56:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:35,588 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:35,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:35,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-22 08:56:35,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383298724] [2019-10-22 08:56:35,589 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2019-10-22 08:56:35,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253223668] [2019-10-22 08:56:35,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:35,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:35,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:35,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:35,615 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 08:56:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:35,649 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-22 08:56:35,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:35,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-10-22 08:56:35,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 08:56:35,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 08:56:35,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 08:56:35,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-10-22 08:56:35,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:35,651 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 08:56:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-10-22 08:56:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 08:56:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 08:56:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-22 08:56:35,653 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 08:56:35,653 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-22 08:56:35,653 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:56:35,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2019-10-22 08:56:35,653 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-10-22 08:56:35,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:35,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:35,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2019-10-22 08:56:35,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:35,654 INFO L791 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1165#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1161#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1162#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1163#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1164#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1166#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1187#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1186#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1185#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1184#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1183#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1182#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1181#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1180#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1179#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1178#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1177#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1176#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1175#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1174#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1173#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1172#L23-3 assume !(main_~i~1 < 10); 1160#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1153#L9-3 [2019-10-22 08:56:35,654 INFO L793 eck$LassoCheckResult]: Loop: 1153#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1154#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1153#L9-3 [2019-10-22 08:56:35,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2019-10-22 08:56:35,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178465169] [2019-10-22 08:56:35,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,677 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2019-10-22 08:56:35,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989160652] [2019-10-22 08:56:35,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,682 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:35,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:35,682 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2019-10-22 08:56:35,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:35,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354475242] [2019-10-22 08:56:35,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:35,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:35,732 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:38,512 WARN L191 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 220 DAG size of output: 156 [2019-10-22 08:56:38,657 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-22 08:56:38,658 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:38,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:38,659 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:38,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:38,659 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:38,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:38,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:38,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:38,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration12_Lasso [2019-10-22 08:56:38,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:38,659 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:38,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:38,986 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:38,986 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:38,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:38,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:38,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:38,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:38,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:38,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:38,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:38,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:38,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:38,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:38,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:38,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:38,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:38,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:38,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:38,991 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:38,991 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:38,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:38,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:38,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:38,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:38,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:38,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:38,993 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:38,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:38,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:38,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:38,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:38,997 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:38,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:38,997 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:38,998 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:38,999 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:39,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:39,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:56:39,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:39,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:39,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:39,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:39,007 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:39,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:39,026 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:39,039 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:39,040 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:56:39,040 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:39,041 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:39,041 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:39,041 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2019-10-22 08:56:39,068 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:39,121 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 [2019-10-22 08:56:39,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:56:39,140 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 41 states and 48 transitions. Complement of second has 7 states. [2019-10-22 08:56:39,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-10-22 08:56:39,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2019-10-22 08:56:39,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:39,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2019-10-22 08:56:39,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:39,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2019-10-22 08:56:39,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:39,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2019-10-22 08:56:39,146 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2019-10-22 08:56:39,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 08:56:39,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:56:39,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-10-22 08:56:39,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:39,147 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-22 08:56:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-10-22 08:56:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 08:56:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 08:56:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-10-22 08:56:39,149 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-22 08:56:39,149 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-10-22 08:56:39,150 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:56:39,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2019-10-22 08:56:39,150 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:39,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:39,151 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,151 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:39,151 INFO L791 eck$LassoCheckResult]: Stem: 1360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1358#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1354#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1355#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1356#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1357#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1359#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1380#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1379#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1378#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1377#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1376#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1375#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1374#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1373#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1372#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1371#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1370#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1369#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1368#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1367#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1366#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1365#L23-3 assume !(main_~i~1 < 10); 1353#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1345#L9-3 assume !(sum_~i~0 < 10); 1343#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1344#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1363#L9-8 [2019-10-22 08:56:39,152 INFO L793 eck$LassoCheckResult]: Loop: 1363#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1364#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1363#L9-8 [2019-10-22 08:56:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2019-10-22 08:56:39,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027109997] [2019-10-22 08:56:39,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 08:56:39,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027109997] [2019-10-22 08:56:39,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:39,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:39,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345419763] [2019-10-22 08:56:39,182 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2019-10-22 08:56:39,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172355063] [2019-10-22 08:56:39,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,189 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:39,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:39,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:39,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:39,214 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:56:39,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,234 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-22 08:56:39,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:39,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2019-10-22 08:56:39,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2019-10-22 08:56:39,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:56:39,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:56:39,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2019-10-22 08:56:39,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:39,236 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-22 08:56:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2019-10-22 08:56:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-22 08:56:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:56:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-22 08:56:39,238 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-22 08:56:39,238 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-22 08:56:39,238 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:56:39,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-10-22 08:56:39,239 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:39,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:39,239 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,239 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:39,240 INFO L791 eck$LassoCheckResult]: Stem: 1448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1445#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1441#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1442#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1443#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1444#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1468#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1467#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1466#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1465#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1464#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1463#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1462#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1461#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1460#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1459#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1458#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1457#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1456#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1455#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1454#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1453#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1452#L23-3 assume !(main_~i~1 < 10); 1440#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1432#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1433#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1434#L9-3 assume !(sum_~i~0 < 10); 1430#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1431#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1449#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1450#L9-7 [2019-10-22 08:56:39,240 INFO L793 eck$LassoCheckResult]: Loop: 1450#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1451#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1450#L9-7 [2019-10-22 08:56:39,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2019-10-22 08:56:39,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026256666] [2019-10-22 08:56:39,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 08:56:39,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026256666] [2019-10-22 08:56:39,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484469499] [2019-10-22 08:56:39,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-22 08:56:39,357 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:39,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-22 08:56:39,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415439038] [2019-10-22 08:56:39,357 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2019-10-22 08:56:39,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547482601] [2019-10-22 08:56:39,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:39,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:39,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:39,387 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 08:56:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,422 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-22 08:56:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:39,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2019-10-22 08:56:39,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2019-10-22 08:56:39,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 08:56:39,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 08:56:39,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2019-10-22 08:56:39,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:39,424 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-22 08:56:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2019-10-22 08:56:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-22 08:56:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:56:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-22 08:56:39,426 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-22 08:56:39,426 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-22 08:56:39,426 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 08:56:39,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2019-10-22 08:56:39,426 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:39,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:39,427 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:39,427 INFO L791 eck$LassoCheckResult]: Stem: 1631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1630#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1626#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1627#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1628#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1629#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1655#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1654#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1653#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1652#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1651#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1650#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1649#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1648#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1647#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1646#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1645#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1644#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1643#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1642#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1641#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1640#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1639#L23-3 assume !(main_~i~1 < 10); 1625#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1615#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1616#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1617#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1618#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1622#L9-3 assume !(sum_~i~0 < 10); 1613#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1614#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1634#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1635#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1636#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1638#L9-7 [2019-10-22 08:56:39,427 INFO L793 eck$LassoCheckResult]: Loop: 1638#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1637#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1638#L9-7 [2019-10-22 08:56:39,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,428 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2019-10-22 08:56:39,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427073746] [2019-10-22 08:56:39,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 08:56:39,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427073746] [2019-10-22 08:56:39,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169737565] [2019-10-22 08:56:39,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-22 08:56:39,538 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:39,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-22 08:56:39,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815570711] [2019-10-22 08:56:39,539 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2019-10-22 08:56:39,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608617750] [2019-10-22 08:56:39,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:39,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:39,571 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-10-22 08:56:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,611 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2019-10-22 08:56:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:39,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2019-10-22 08:56:39,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2019-10-22 08:56:39,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-10-22 08:56:39,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-10-22 08:56:39,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2019-10-22 08:56:39,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:39,614 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-22 08:56:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2019-10-22 08:56:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2019-10-22 08:56:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:56:39,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-22 08:56:39,616 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-22 08:56:39,616 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-22 08:56:39,616 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-10-22 08:56:39,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2019-10-22 08:56:39,616 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:39,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:39,617 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,617 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:39,617 INFO L791 eck$LassoCheckResult]: Stem: 1838#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1835#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1831#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1832#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1833#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1834#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1862#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1861#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1860#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1858#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1856#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1855#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1854#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1853#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1852#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1851#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1848#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1847#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1846#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1845#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1844#L23-3 assume !(main_~i~1 < 10); 1830#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1821#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1822#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1823#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1824#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1865#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1843#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1842#L9-3 assume !(sum_~i~0 < 10); 1819#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1820#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1839#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1840#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1841#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1864#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1863#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1850#L9-7 [2019-10-22 08:56:39,618 INFO L793 eck$LassoCheckResult]: Loop: 1850#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1849#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1850#L9-7 [2019-10-22 08:56:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2019-10-22 08:56:39,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897472726] [2019-10-22 08:56:39,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-22 08:56:39,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897472726] [2019-10-22 08:56:39,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575872624] [2019-10-22 08:56:39,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:39,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:39,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:39,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-22 08:56:39,750 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:39,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-22 08:56:39,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059020415] [2019-10-22 08:56:39,750 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2019-10-22 08:56:39,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213371481] [2019-10-22 08:56:39,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,755 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:39,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:56:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:39,798 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2019-10-22 08:56:39,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:39,845 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-22 08:56:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:39,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2019-10-22 08:56:39,846 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2019-10-22 08:56:39,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-10-22 08:56:39,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-10-22 08:56:39,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2019-10-22 08:56:39,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:39,848 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-22 08:56:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2019-10-22 08:56:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2019-10-22 08:56:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 08:56:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-22 08:56:39,850 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-22 08:56:39,850 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-22 08:56:39,850 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-10-22 08:56:39,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2019-10-22 08:56:39,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:39,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:39,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:39,851 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:39,851 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:39,852 INFO L791 eck$LassoCheckResult]: Stem: 2066#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2065#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2061#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2062#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2063#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2064#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2092#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2091#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2090#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2089#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2088#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2087#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2086#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2085#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2084#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2083#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2082#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2081#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2080#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2079#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2078#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2077#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2076#L23-3 assume !(main_~i~1 < 10); 2060#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2050#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2051#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2052#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2053#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2057#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2094#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2093#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2073#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2072#L9-3 assume !(sum_~i~0 < 10); 2048#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2049#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2069#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2070#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2071#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2098#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2097#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2096#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2095#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2075#L9-7 [2019-10-22 08:56:39,852 INFO L793 eck$LassoCheckResult]: Loop: 2075#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2074#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2075#L9-7 [2019-10-22 08:56:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2019-10-22 08:56:39,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382453563] [2019-10-22 08:56:39,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-22 08:56:39,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382453563] [2019-10-22 08:56:39,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246714646] [2019-10-22 08:56:39,896 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:39,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-22 08:56:39,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:39,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:56:39,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-22 08:56:39,989 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:39,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-22 08:56:39,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951909898] [2019-10-22 08:56:39,989 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:39,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2019-10-22 08:56:39,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:39,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551588143] [2019-10-22 08:56:39,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:39,997 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:40,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:40,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:40,022 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2019-10-22 08:56:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:40,089 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2019-10-22 08:56:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:40,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2019-10-22 08:56:40,090 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2019-10-22 08:56:40,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 08:56:40,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-10-22 08:56:40,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2019-10-22 08:56:40,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:40,091 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-22 08:56:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2019-10-22 08:56:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-10-22 08:56:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 08:56:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-22 08:56:40,094 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-22 08:56:40,094 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-22 08:56:40,094 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-10-22 08:56:40,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2019-10-22 08:56:40,094 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:40,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:40,098 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:40,098 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:40,098 INFO L791 eck$LassoCheckResult]: Stem: 2318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2317#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2313#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2314#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2315#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2316#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2344#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2343#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2342#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2341#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2340#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2339#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2338#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2337#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2336#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2335#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2334#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2333#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2332#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2331#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2330#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2329#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2328#L23-3 assume !(main_~i~1 < 10); 2312#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2302#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2303#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2304#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2305#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2309#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2348#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2347#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2346#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2345#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2325#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2324#L9-3 assume !(sum_~i~0 < 10); 2300#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2301#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2321#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2322#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2323#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2354#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2353#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2352#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2351#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2350#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2349#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2327#L9-7 [2019-10-22 08:56:40,098 INFO L793 eck$LassoCheckResult]: Loop: 2327#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2326#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2327#L9-7 [2019-10-22 08:56:40,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2019-10-22 08:56:40,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294024847] [2019-10-22 08:56:40,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-22 08:56:40,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294024847] [2019-10-22 08:56:40,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27652888] [2019-10-22 08:56:40,160 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:40,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:40,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:40,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:56:40,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-22 08:56:40,231 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:40,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-22 08:56:40,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259758440] [2019-10-22 08:56:40,231 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2019-10-22 08:56:40,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867613827] [2019-10-22 08:56:40,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,236 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:40,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:40,258 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2019-10-22 08:56:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:40,325 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-22 08:56:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:56:40,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2019-10-22 08:56:40,326 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2019-10-22 08:56:40,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-10-22 08:56:40,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-10-22 08:56:40,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2019-10-22 08:56:40,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:40,327 INFO L688 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-22 08:56:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2019-10-22 08:56:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-10-22 08:56:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 08:56:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-22 08:56:40,329 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-22 08:56:40,329 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-22 08:56:40,329 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-10-22 08:56:40,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2019-10-22 08:56:40,330 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:40,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:40,330 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:40,330 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:40,331 INFO L791 eck$LassoCheckResult]: Stem: 2592#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2591#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2587#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2588#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2589#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2590#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2618#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2617#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2616#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2615#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2614#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2613#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2612#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2611#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2610#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2609#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2608#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2607#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2606#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2605#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2604#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2603#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2602#L23-3 assume !(main_~i~1 < 10); 2586#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2577#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2578#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2579#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2580#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2625#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2624#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2623#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2622#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2621#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2620#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2619#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2599#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2598#L9-3 assume !(sum_~i~0 < 10); 2575#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2576#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2595#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2596#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2597#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2633#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2632#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2631#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2630#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2629#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2628#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2627#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2626#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2601#L9-7 [2019-10-22 08:56:40,331 INFO L793 eck$LassoCheckResult]: Loop: 2601#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2600#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2601#L9-7 [2019-10-22 08:56:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2019-10-22 08:56:40,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967592035] [2019-10-22 08:56:40,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 08:56:40,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967592035] [2019-10-22 08:56:40,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015674812] [2019-10-22 08:56:40,393 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:40,490 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-22 08:56:40,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:40,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:40,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-22 08:56:40,511 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:40,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-22 08:56:40,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995100094] [2019-10-22 08:56:40,512 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2019-10-22 08:56:40,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516449606] [2019-10-22 08:56:40,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,518 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:40,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:40,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:56:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:56:40,542 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2019-10-22 08:56:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:40,620 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2019-10-22 08:56:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:56:40,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2019-10-22 08:56:40,621 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2019-10-22 08:56:40,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-10-22 08:56:40,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-10-22 08:56:40,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2019-10-22 08:56:40,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:40,622 INFO L688 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2019-10-22 08:56:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2019-10-22 08:56:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2019-10-22 08:56:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-22 08:56:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-22 08:56:40,624 INFO L711 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-22 08:56:40,624 INFO L591 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-22 08:56:40,624 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-10-22 08:56:40,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2019-10-22 08:56:40,624 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:40,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:40,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:40,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:40,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:40,625 INFO L791 eck$LassoCheckResult]: Stem: 2893#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2890#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2886#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2887#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2888#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2889#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2917#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2916#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2915#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2914#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2913#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2912#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2911#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2910#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2909#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2908#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2907#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2906#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2903#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2902#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2901#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2900#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2899#L23-3 assume !(main_~i~1 < 10); 2885#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2875#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2876#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2877#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2878#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2882#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2925#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2924#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2923#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2922#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2921#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2920#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2919#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2918#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2898#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2897#L9-3 assume !(sum_~i~0 < 10); 2873#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2874#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2894#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2895#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2896#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2935#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2934#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2933#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2932#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2931#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2930#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2929#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2928#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2927#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2926#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2905#L9-7 [2019-10-22 08:56:40,625 INFO L793 eck$LassoCheckResult]: Loop: 2905#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2904#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2905#L9-7 [2019-10-22 08:56:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2019-10-22 08:56:40,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738627370] [2019-10-22 08:56:40,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-22 08:56:40,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738627370] [2019-10-22 08:56:40,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326181938] [2019-10-22 08:56:40,701 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:40,897 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-22 08:56:40,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:40,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:56:40,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-22 08:56:40,938 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:40,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2019-10-22 08:56:40,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493485703] [2019-10-22 08:56:40,939 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2019-10-22 08:56:40,940 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:40,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111631698] [2019-10-22 08:56:40,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:40,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:40,945 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:40,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:40,968 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 08:56:41,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:41,134 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2019-10-22 08:56:41,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:41,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2019-10-22 08:56:41,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2019-10-22 08:56:41,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2019-10-22 08:56:41,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2019-10-22 08:56:41,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2019-10-22 08:56:41,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:41,137 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-22 08:56:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2019-10-22 08:56:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2019-10-22 08:56:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:56:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-22 08:56:41,141 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-22 08:56:41,141 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-22 08:56:41,141 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-10-22 08:56:41,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2019-10-22 08:56:41,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:41,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:41,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:41,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:41,142 INFO L791 eck$LassoCheckResult]: Stem: 3229#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3228#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3224#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3225#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3226#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3227#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3256#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3254#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3253#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3252#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3251#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3250#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3249#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3248#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3247#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3246#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3245#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3244#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3243#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3242#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3241#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3240#L23-3 assume !(main_~i~1 < 10); 3223#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3214#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3215#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3216#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3217#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3278#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3277#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3275#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3273#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3271#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3269#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3267#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3265#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3263#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3261#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3259#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3237#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3236#L9-3 assume !(sum_~i~0 < 10); 3212#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3213#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3234#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3235#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3232#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3233#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3276#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3274#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3272#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3270#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3268#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3266#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3264#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3262#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3260#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3258#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3257#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3239#L9-7 [2019-10-22 08:56:41,142 INFO L793 eck$LassoCheckResult]: Loop: 3239#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3238#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3239#L9-7 [2019-10-22 08:56:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2019-10-22 08:56:41,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526802541] [2019-10-22 08:56:41,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,143 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-22 08:56:41,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526802541] [2019-10-22 08:56:41,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323025146] [2019-10-22 08:56:41,240 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:41,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:56:41,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-22 08:56:41,329 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:41,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-22 08:56:41,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3503950] [2019-10-22 08:56:41,330 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2019-10-22 08:56:41,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102172981] [2019-10-22 08:56:41,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,336 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:41,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:56:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:56:41,361 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2019-10-22 08:56:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:41,463 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-10-22 08:56:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:56:41,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2019-10-22 08:56:41,465 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2019-10-22 08:56:41,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-10-22 08:56:41,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-10-22 08:56:41,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2019-10-22 08:56:41,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:41,466 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2019-10-22 08:56:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2019-10-22 08:56:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2019-10-22 08:56:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 08:56:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-22 08:56:41,468 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-22 08:56:41,468 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-22 08:56:41,468 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-10-22 08:56:41,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2019-10-22 08:56:41,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:41,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:41,470 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:41,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:41,470 INFO L791 eck$LassoCheckResult]: Stem: 3573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3572#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3568#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3569#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3570#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3571#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3600#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3599#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3598#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3597#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3596#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3595#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3594#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3593#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3592#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3591#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3590#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3589#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3588#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3587#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3586#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3585#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3584#L23-3 assume !(main_~i~1 < 10); 3567#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3558#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3559#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3560#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3561#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3626#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3625#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3624#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3623#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3622#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3621#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3620#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3619#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3618#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3617#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3616#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3615#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3614#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3581#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3580#L9-3 assume !(sum_~i~0 < 10); 3556#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3557#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3578#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3579#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3576#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3577#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3613#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3612#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3611#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3610#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3609#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3608#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3607#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3606#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3605#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3604#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3603#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3602#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3601#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3583#L9-7 [2019-10-22 08:56:41,471 INFO L793 eck$LassoCheckResult]: Loop: 3583#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3582#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3583#L9-7 [2019-10-22 08:56:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2019-10-22 08:56:41,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316067500] [2019-10-22 08:56:41,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-22 08:56:41,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316067500] [2019-10-22 08:56:41,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785730976] [2019-10-22 08:56:41,571 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_59fae84f-ae42-4baf-9bfa-a2731e39a25d/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:41,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:41,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:56:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:56:41,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-10-22 08:56:41,667 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:56:41,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-22 08:56:41,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168446197] [2019-10-22 08:56:41,668 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:41,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2019-10-22 08:56:41,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813802947] [2019-10-22 08:56:41,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:41,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:56:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:56:41,700 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-10-22 08:56:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:41,809 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-10-22 08:56:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:56:41,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2019-10-22 08:56:41,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2019-10-22 08:56:41,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-10-22 08:56:41,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-10-22 08:56:41,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2019-10-22 08:56:41,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:41,811 INFO L688 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2019-10-22 08:56:41,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2019-10-22 08:56:41,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2019-10-22 08:56:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:56:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-22 08:56:41,813 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-22 08:56:41,813 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-22 08:56:41,813 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-10-22 08:56:41,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2019-10-22 08:56:41,814 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-10-22 08:56:41,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:41,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:41,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:41,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:41,815 INFO L791 eck$LassoCheckResult]: Stem: 3939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3936#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3932#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3933#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3934#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3935#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3976#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3974#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3972#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3970#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3968#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3966#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3964#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3962#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3960#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3958#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3956#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3954#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3952#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3950#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3948#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3947#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3946#L23-3 assume !(main_~i~1 < 10); 3931#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3922#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3923#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3924#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3925#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3977#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3975#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3973#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3971#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3969#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3967#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3965#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3963#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3961#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3959#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3957#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3955#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3953#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3951#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3949#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3945#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3944#L9-3 assume !(sum_~i~0 < 10); 3920#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3921#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3942#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3943#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3940#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3941#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3994#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3993#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3992#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3991#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3990#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3989#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3988#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3987#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3986#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3985#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3984#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3983#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3982#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3981#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3980#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3979#L9-7 [2019-10-22 08:56:41,815 INFO L793 eck$LassoCheckResult]: Loop: 3979#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3978#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3979#L9-7 [2019-10-22 08:56:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2019-10-22 08:56:41,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105769003] [2019-10-22 08:56:41,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,947 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2019-10-22 08:56:41,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902430224] [2019-10-22 08:56:41,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:41,952 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:41,952 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2019-10-22 08:56:41,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:41,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583085278] [2019-10-22 08:56:41,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:41,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-22 08:56:42,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583085278] [2019-10-22 08:56:42,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:42,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-22 08:56:42,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817625403] [2019-10-22 08:56:42,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:56:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:56:42,166 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 15 states. [2019-10-22 08:56:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:42,408 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2019-10-22 08:56:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:56:42,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2019-10-22 08:56:42,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:42,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2019-10-22 08:56:42,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-10-22 08:56:42,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-10-22 08:56:42,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2019-10-22 08:56:42,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:42,410 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-22 08:56:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2019-10-22 08:56:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-10-22 08:56:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 08:56:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-10-22 08:56:42,412 INFO L711 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-22 08:56:42,412 INFO L591 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-10-22 08:56:42,412 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-10-22 08:56:42,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2019-10-22 08:56:42,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:42,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:42,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:42,413 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:42,413 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:42,413 INFO L791 eck$LassoCheckResult]: Stem: 4146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4143#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4139#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4140#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4141#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4142#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4185#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4184#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4182#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4180#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4178#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4176#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4174#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4172#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4170#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4168#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4166#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4164#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4162#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4160#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4158#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4155#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4154#L23-3 assume !(main_~i~1 < 10); 4138#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4133#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4134#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4135#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4181#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4179#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4177#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4175#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4173#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4171#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4169#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4167#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4165#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4163#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4161#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4159#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4157#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4156#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4153#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4152#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4151#L9-3 assume !(sum_~i~0 < 10); 4131#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4132#L12 main_#t~ret4 := sum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4149#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4150#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4147#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4148#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4202#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4201#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4200#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4199#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4198#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4197#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4196#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4195#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4194#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4193#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4192#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4191#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4190#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4189#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4188#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4187#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4186#L9-8 assume !(sum_~i~0 < 10); 4144#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4145#L12-1 main_#t~ret7 := sum_#res;main_~ret2~0 := 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;main_~i~2 := 0; 4136#L32-3 [2019-10-22 08:56:42,414 INFO L793 eck$LassoCheckResult]: Loop: 4136#L32-3 assume !!(main_~i~2 < 9);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 4137#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 4136#L32-3 [2019-10-22 08:56:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2019-10-22 08:56:42,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453245832] [2019-10-22 08:56:42,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,619 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2019-10-22 08:56:42,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182913890] [2019-10-22 08:56:42,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,623 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2019-10-22 08:56:42,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:42,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131219737] [2019-10-22 08:56:42,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:42,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:01,195 WARN L191 SmtUtils]: Spent 18.39 s on a formula simplification. DAG size of input: 586 DAG size of output: 398 [2019-10-22 08:57:05,409 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 184 DAG size of output: 180 [2019-10-22 08:57:05,412 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:05,412 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:05,412 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:05,412 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:05,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:05,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:05,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:05,413 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:05,413 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration24_Lasso [2019-10-22 08:57:05,413 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:05,413 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:05,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:05,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,298 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-10-22 08:57:07,793 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 107 [2019-10-22 08:57:07,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:07,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:08,087 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-10-22 08:57:08,465 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-22 08:57:08,531 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:08,531 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:08,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,533 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,533 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,534 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,536 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,539 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,539 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,543 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,543 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,543 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,543 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,545 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,545 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,547 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,548 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,548 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,548 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,552 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,552 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,553 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,553 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,554 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:08,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,558 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:08,559 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,574 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:08,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,576 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:08,576 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,581 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,581 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,581 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,583 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,583 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:08,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:08,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:08,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:08,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:08,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:08,584 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:08,584 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:08,584 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:08,586 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:08,586 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:08,605 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:08,616 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:08,616 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:08,617 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:08,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:08,617 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:08,617 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2019-10-22 08:57:09,116 INFO L297 tatePredicateManager]: 103 out of 103 supporting invariants were superfluous and have been removed [2019-10-22 08:57:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:09,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:09,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:09,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:09,231 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 [2019-10-22 08:57:09,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-10-22 08:57:09,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 74 states and 76 transitions. Complement of second has 4 states. [2019-10-22 08:57:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-10-22 08:57:09,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2019-10-22 08:57:09,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:09,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2019-10-22 08:57:09,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:09,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2019-10-22 08:57:09,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:09,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2019-10-22 08:57:09,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:09,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:09,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:09,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:09,240 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-10-22 08:57:09,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:09,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:09,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:09,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:09 BoogieIcfgContainer [2019-10-22 08:57:09,245 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:09,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:09,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:09,246 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:09,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:32" (3/4) ... [2019-10-22 08:57:09,249 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:09,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:09,250 INFO L168 Benchmark]: Toolchain (without parser) took 37549.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 941.0 MB in the beginning and 1.4 GB in the end (delta: -425.8 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,251 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:09,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,251 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:09,252 INFO L168 Benchmark]: RCFGBuilder took 299.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,252 INFO L168 Benchmark]: BuchiAutomizer took 36837.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -270.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,252 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 473.4 kB). Peak memory consumption was 473.4 kB. Max. memory is 11.5 GB. [2019-10-22 08:57:09,254 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 299.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 36837.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 296.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -270.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 473.4 kB). Peak memory consumption was 473.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 19 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.7s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 34.7s. Construction of modules took 0.8s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 136 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 75 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 404 SDtfs, 473 SDslu, 1356 SDs, 0 SdLazy, 868 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital908 mio100 ax100 hnf99 lsp134 ukn41 mio100 lsp60 div100 bol100 ite100 ukn100 eq166 hnf85 smp91 dnf162 smp83 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...