./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/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.23-635dfa2 [2018-12-02 17:57:52,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:57:52,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:57:52,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:57:52,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:57:52,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:57:52,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:57:52,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:57:52,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:57:52,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:57:52,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:57:52,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:57:52,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:57:52,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:57:52,991 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:57:52,991 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:57:52,992 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:57:52,993 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:57:52,994 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:57:52,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:57:52,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:57:52,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:57:52,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:57:52,997 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:57:52,997 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:57:52,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:57:52,998 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:57:52,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:57:52,999 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:57:53,000 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:57:53,000 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:57:53,000 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:57:53,000 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:57:53,000 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:57:53,001 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:57:53,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:57:53,002 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 17:57:53,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:57:53,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:57:53,010 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 17:57:53,010 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 17:57:53,011 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 17:57:53,011 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:57:53,011 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:57:53,012 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 17:57:53,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 17:57:53,013 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:57:53,013 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 17:57:53,014 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 17:57:53,014 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 17:57:53,014 INFO L133 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_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/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 [2018-12-02 17:57:53,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:57:53,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:57:53,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:57:53,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:57:53,041 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:57:53,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-12-02 17:57:53,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/data/35a281ac6/47931f05937046a6a04dd12e42146772/FLAGea2321179 [2018-12-02 17:57:53,465 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:57:53,466 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-12-02 17:57:53,469 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/data/35a281ac6/47931f05937046a6a04dd12e42146772/FLAGea2321179 [2018-12-02 17:57:53,816 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/data/35a281ac6/47931f05937046a6a04dd12e42146772 [2018-12-02 17:57:53,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:57:53,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:57:53,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:57:53,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:57:53,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:57:53,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a347b11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53, skipping insertion in model container [2018-12-02 17:57:53,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:57:53,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:57:53,937 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:57:53,942 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:57:53,954 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:57:53,963 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:57:53,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53 WrapperNode [2018-12-02 17:57:53,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:57:53,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:57:53,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:57:53,964 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:57:53,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:57:53,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:57:53,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:57:53,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:57:53,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:53,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:54,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:54,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:54,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... [2018-12-02 17:57:54,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:57:54,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:57:54,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:57:54,033 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:57:54,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/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 [2018-12-02 17:57:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:57:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:57:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:57:54,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:57:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 17:57:54,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:57:54,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:57:54,208 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-02 17:57:54,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:54 BoogieIcfgContainer [2018-12-02 17:57:54,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:57:54,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 17:57:54,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 17:57:54,212 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 17:57:54,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:57:54,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:57:53" (1/3) ... [2018-12-02 17:57:54,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1567de16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:57:54, skipping insertion in model container [2018-12-02 17:57:54,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:57:54,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:57:53" (2/3) ... [2018-12-02 17:57:54,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1567de16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:57:54, skipping insertion in model container [2018-12-02 17:57:54,215 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 17:57:54,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:54" (3/3) ... [2018-12-02 17:57:54,216 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-12-02 17:57:54,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 17:57:54,262 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 17:57:54,262 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 17:57:54,263 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 17:57:54,263 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:57:54,263 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:57:54,263 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 17:57:54,263 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:57:54,263 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 17:57:54,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 17:57:54,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 17:57:54,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:54,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:54,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 17:57:54,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:54,293 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 17:57:54,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 17:57:54,294 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 17:57:54,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:54,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:54,295 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 17:57:54,295 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:54,301 INFO L794 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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-12-02 17:57:54,301 INFO L796 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 [2018-12-02 17:57:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 17:57:54,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 17:57:54,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 17:57:54,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,486 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:57:54,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:57:54,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:57:54,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:57:54,487 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:57:54,487 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:57:54,487 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:57:54,487 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:57:54,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 17:57:54,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:57:54,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:57:54,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:54,672 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:57:54,675 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:57:54,677 INFO L122 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 [2018-12-02 17:57:54,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,684 INFO L122 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 [2018-12-02 17:57:54,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,686 INFO L122 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 [2018-12-02 17:57:54,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,689 INFO L122 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 [2018-12-02 17:57:54,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,691 INFO L122 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 [2018-12-02 17:57:54,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:54,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,697 INFO L122 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 [2018-12-02 17:57:54,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,700 INFO L122 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 [2018-12-02 17:57:54,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,702 INFO L122 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 [2018-12-02 17:57:54,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,704 INFO L122 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 [2018-12-02 17:57:54,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,706 INFO L122 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 [2018-12-02 17:57:54,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:54,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,710 INFO L122 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 [2018-12-02 17:57:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,712 INFO L122 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 [2018-12-02 17:57:54,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,713 INFO L122 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 [2018-12-02 17:57:54,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,715 INFO L122 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 [2018-12-02 17:57:54,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,717 INFO L122 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 [2018-12-02 17:57:54,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,718 INFO L122 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 [2018-12-02 17:57:54,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,720 INFO L122 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 [2018-12-02 17:57:54,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,721 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,722 INFO L122 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 [2018-12-02 17:57:54,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,722 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:57:54,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:57:54,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,727 INFO L122 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 [2018-12-02 17:57:54,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,729 INFO L122 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 [2018-12-02 17:57:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:54,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,732 INFO L122 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 [2018-12-02 17:57:54,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:54,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:54,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:54,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,734 INFO L122 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 [2018-12-02 17:57:54,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:54,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:54,741 INFO L122 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 [2018-12-02 17:57:54,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:54,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:54,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:54,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:54,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:54,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:54,759 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:57:54,773 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 17:57:54,773 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 17:57:54,775 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:57:54,776 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:57:54,776 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:57:54,776 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 19 Supporting invariants [] [2018-12-02 17:57:54,778 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 17:57:54,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:54,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:54,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:54,830 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 17:57:54,830 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-02 17:57:54,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2018-12-02 17:57:54,861 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 [2018-12-02 17:57:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:57:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-12-02 17:57:54,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 17:57:54,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:54,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 17:57:54,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:54,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 17:57:54,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:54,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2018-12-02 17:57:54,866 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:54,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2018-12-02 17:57:54,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 17:57:54,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:54,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-12-02 17:57:54,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:54,870 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:57:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-12-02 17:57:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 17:57:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 17:57:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-02 17:57:54,887 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:57:54,887 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 17:57:54,887 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 17:57:54,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-02 17:57:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:54,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:54,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:54,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 17:57:54,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:54,888 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 147#L23-3 assume !(main_~i~1 < 10); 146#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; 139#L9-3 [2018-12-02 17:57:54,888 INFO L796 eck$LassoCheckResult]: Loop: 139#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; 140#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 139#L9-3 [2018-12-02 17:57:54,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-02 17:57:54,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:54,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:57:54,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:57:54,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:54,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-12-02 17:57:54,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:57:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:57:54,939 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 17:57:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:54,947 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-02 17:57:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:57:54,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-02 17:57:54,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:54,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-12-02 17:57:54,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:54,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:54,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-02 17:57:54,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:54,949 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-02 17:57:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-02 17:57:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-02 17:57:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 17:57:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-02 17:57:54,950 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 17:57:54,950 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 17:57:54,951 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 17:57:54,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-12-02 17:57:54,951 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:54,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:54,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:54,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 17:57:54,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:54,952 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 192#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; 193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 194#L23-3 assume !(main_~i~1 < 10); 191#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; 184#L9-3 [2018-12-02 17:57:54,952 INFO L796 eck$LassoCheckResult]: Loop: 184#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; 185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 184#L9-3 [2018-12-02 17:57:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-02 17:57:54,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:54,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:54,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:54,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:54,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 17:57:55,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-12-02 17:57:55,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:55,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:57:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:57:55,033 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 17:57:55,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,044 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-12-02 17:57:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:57:55,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-12-02 17:57:55,045 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-12-02 17:57:55,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-12-02 17:57:55,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,046 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-02 17:57:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-12-02 17:57:55,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 17:57:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 17:57:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 17:57:55,048 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 17:57:55,048 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 17:57:55,048 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 17:57:55,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-02 17:57:55,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 17:57:55,049 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,050 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 258#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; 259#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 266#L23-3 assume !(main_~i~1 < 10); 255#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; 248#L9-3 [2018-12-02 17:57:55,050 INFO L796 eck$LassoCheckResult]: Loop: 248#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; 249#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 248#L9-3 [2018-12-02 17:57:55,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,050 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-02 17:57:55,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:57:55,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:57:55,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 17:57:55,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-12-02 17:57:55,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:57:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:57:55,137 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 17:57:55,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,150 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-12-02 17:57:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:57:55,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-12-02 17:57:55,151 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-12-02 17:57:55,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-02 17:57:55,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,152 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-02 17:57:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-02 17:57:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 17:57:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 17:57:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 17:57:55,153 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 17:57:55,153 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 17:57:55,154 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 17:57:55,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-02 17:57:55,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,155 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-02 17:57:55,155 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,155 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 333#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; 334#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 343#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; 342#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); 330#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; 323#L9-3 [2018-12-02 17:57:55,155 INFO L796 eck$LassoCheckResult]: Loop: 323#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; 324#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 323#L9-3 [2018-12-02 17:57:55,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-02 17:57:55,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:57:55,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 17:57:55,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 17:57:55,221 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-12-02 17:57:55,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:57:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:57:55,242 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 17:57:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,254 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-02 17:57:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:57:55,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-12-02 17:57:55,254 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-12-02 17:57:55,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-02 17:57:55,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,255 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-02 17:57:55,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-02 17:57:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-02 17:57:55,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 17:57:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-02 17:57:55,256 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 17:57:55,256 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 17:57:55,256 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 17:57:55,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-12-02 17:57:55,257 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,257 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-02 17:57:55,257 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,258 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 419#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; 420#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 422#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; 431#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 430#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); 416#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; 409#L9-3 [2018-12-02 17:57:55,258 INFO L796 eck$LassoCheckResult]: Loop: 409#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; 410#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 409#L9-3 [2018-12-02 17:57:55,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-02 17:57:55,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 17:57:55,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 17:57:55,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 17:57:55,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-12-02 17:57:55,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:57:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:57:55,375 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 17:57:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,401 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-02 17:57:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:57:55,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-12-02 17:57:55,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2018-12-02 17:57:55,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2018-12-02 17:57:55,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,404 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-02 17:57:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2018-12-02 17:57:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-02 17:57:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 17:57:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 17:57:55,405 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 17:57:55,405 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 17:57:55,405 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 17:57:55,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 17:57:55,406 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-02 17:57:55,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,407 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 516#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; 517#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 519#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; 530#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 529#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); 513#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; 506#L9-3 [2018-12-02 17:57:55,407 INFO L796 eck$LassoCheckResult]: Loop: 506#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; 507#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 506#L9-3 [2018-12-02 17:57:55,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-02 17:57:55,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 17:57:55,455 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 17:57:55,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 17:57:55,481 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-12-02 17:57:55,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:57:55,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:57:55,506 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-02 17:57:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,522 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-12-02 17:57:55,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:57:55,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2018-12-02 17:57:55,523 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 17:57:55,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-12-02 17:57:55,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,523 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 17:57:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-12-02 17:57:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 17:57:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 17:57:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 17:57:55,525 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 17:57:55,525 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 17:57:55,525 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 17:57:55,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-12-02 17:57:55,525 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,526 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-12-02 17:57:55,526 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,526 INFO L794 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 626#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 624#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; 625#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 627#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; 640#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 639#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); 621#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; 614#L9-3 [2018-12-02 17:57:55,526 INFO L796 eck$LassoCheckResult]: Loop: 614#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; 615#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 614#L9-3 [2018-12-02 17:57:55,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-12-02 17:57:55,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 17:57:55,587 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 17:57:55,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 17:57:55,609 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2018-12-02 17:57:55,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:57:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:57:55,637 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-02 17:57:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,655 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 17:57:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:57:55,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2018-12-02 17:57:55,656 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 17:57:55,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2018-12-02 17:57:55,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,657 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 17:57:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2018-12-02 17:57:55,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 17:57:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 17:57:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 17:57:55,659 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 17:57:55,659 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 17:57:55,659 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 17:57:55,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-12-02 17:57:55,660 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-12-02 17:57:55,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,661 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 745#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 743#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; 744#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 746#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; 761#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 760#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); 740#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; 733#L9-3 [2018-12-02 17:57:55,661 INFO L796 eck$LassoCheckResult]: Loop: 733#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; 734#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 733#L9-3 [2018-12-02 17:57:55,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-12-02 17:57:55,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 17:57:55,757 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2018-12-02 17:57:55,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:55,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 17:57:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 17:57:55,780 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-12-02 17:57:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,824 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-02 17:57:55,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:57:55,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-12-02 17:57:55,825 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 17:57:55,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-12-02 17:57:55,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,826 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 17:57:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-12-02 17:57:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 17:57:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 17:57:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 17:57:55,828 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 17:57:55,828 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 17:57:55,828 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 17:57:55,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-12-02 17:57:55,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-12-02 17:57:55,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,829 INFO L794 eck$LassoCheckResult]: Stem: 879#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 873#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; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 876#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; 893#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 892#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); 870#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; 863#L9-3 [2018-12-02 17:57:55,829 INFO L796 eck$LassoCheckResult]: Loop: 863#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; 864#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 863#L9-3 [2018-12-02 17:57:55,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-12-02 17:57:55,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:55,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:57:55,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:57:55,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:55,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:55,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:55,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 17:57:55,932 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:55,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2018-12-02 17:57:55,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:55,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:57:55,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:57:55,951 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-02 17:57:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:55,969 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-02 17:57:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:57:55,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2018-12-02 17:57:55,970 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2018-12-02 17:57:55,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:55,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:55,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2018-12-02 17:57:55,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:55,971 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-02 17:57:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2018-12-02 17:57:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-02 17:57:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 17:57:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 17:57:55,973 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 17:57:55,973 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 17:57:55,973 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 17:57:55,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-12-02 17:57:55,973 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:55,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:55,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:55,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-12-02 17:57:55,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:55,974 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1016#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1014#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; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1017#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; 1036#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1035#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); 1011#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; 1004#L9-3 [2018-12-02 17:57:55,974 INFO L796 eck$LassoCheckResult]: Loop: 1004#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; 1005#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1004#L9-3 [2018-12-02 17:57:55,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-12-02 17:57:55,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:56,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:56,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:56,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:57:56,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 17:57:56,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:56,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:56,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:56,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 17:57:56,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:56,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2018-12-02 17:57:56,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:56,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 17:57:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:57:56,156 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 17:57:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:56,180 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-02 17:57:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:57:56,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-02 17:57:56,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:56,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 17:57:56,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 17:57:56,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 17:57:56,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-02 17:57:56,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:56,181 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 17:57:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-02 17:57:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 17:57:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 17:57:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 17:57:56,183 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 17:57:56,183 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 17:57:56,183 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 17:57:56,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-12-02 17:57:56,184 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 17:57:56,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:56,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:56,184 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-12-02 17:57:56,184 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:56,184 INFO L794 eck$LassoCheckResult]: Stem: 1169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1167#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1165#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; 1166#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1168#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; 1189#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1188#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); 1162#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; 1155#L9-3 [2018-12-02 17:57:56,185 INFO L796 eck$LassoCheckResult]: Loop: 1155#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; 1156#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1155#L9-3 [2018-12-02 17:57:56,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:56,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-12-02 17:57:56,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:56,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2018-12-02 17:57:56,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:56,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:56,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2018-12-02 17:57:56,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:58,968 WARN L180 SmtUtils]: Spent 2.73 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-12-02 17:57:59,053 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:57:59,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:57:59,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:57:59,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:57:59,053 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:57:59,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:57:59,053 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:57:59,053 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:57:59,053 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-02 17:57:59,053 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:57:59,053 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:57:59,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:57:59,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:57:59,245 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:57:59,245 INFO L122 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 [2018-12-02 17:57:59,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,246 INFO L122 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 [2018-12-02 17:57:59,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,247 INFO L122 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 [2018-12-02 17:57:59,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,249 INFO L122 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 [2018-12-02 17:57:59,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:59,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:59,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,250 INFO L122 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 [2018-12-02 17:57:59,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,251 INFO L122 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 [2018-12-02 17:57:59,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,252 INFO L122 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 [2018-12-02 17:57:59,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,254 INFO L122 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 [2018-12-02 17:57:59,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,255 INFO L122 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 [2018-12-02 17:57:59,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,256 INFO L122 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 [2018-12-02 17:57:59,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:57:59,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:57:59,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:57:59,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,257 INFO L122 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 [2018-12-02 17:57:59,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:59,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:59,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:57:59,259 INFO L122 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 [2018-12-02 17:57:59,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:57:59,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:57:59,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:57:59,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:57:59,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:57:59,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:57:59,264 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:57:59,271 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 17:57:59,271 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 17:57:59,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:57:59,271 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:57:59,272 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:57:59,272 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2018-12-02 17:57:59,275 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 17:57:59,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:57:59,308 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 [2018-12-02 17:57:59,308 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 17:57:59,317 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. [2018-12-02 17:57:59,318 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 [2018-12-02 17:57:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:57:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-02 17:57:59,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2018-12-02 17:57:59,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:59,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2018-12-02 17:57:59,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:59,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2018-12-02 17:57:59,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:57:59,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-12-02 17:57:59,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2018-12-02 17:57:59,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 17:57:59,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 17:57:59,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-02 17:57:59,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,321 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 17:57:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-02 17:57:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 17:57:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 17:57:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-02 17:57:59,323 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 17:57:59,323 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 17:57:59,323 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 17:57:59,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-02 17:57:59,323 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,324 INFO L794 eck$LassoCheckResult]: Stem: 1362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1360#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1358#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; 1359#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1361#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; 1382#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1381#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); 1355#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; 1347#L9-3 assume !(sum_~i~0 < 10); 1345#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1346#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; 1365#L9-8 [2018-12-02 17:57:59,324 INFO L796 eck$LassoCheckResult]: Loop: 1365#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; 1366#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1365#L9-8 [2018-12-02 17:57:59,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2018-12-02 17:57:59,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 17:57:59,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:57:59,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:57:59,348 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:59,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,348 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-12-02 17:57:59,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:57:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:57:59,376 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 17:57:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:59,403 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-02 17:57:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:57:59,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2018-12-02 17:57:59,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 17:57:59,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 17:57:59,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 17:57:59,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2018-12-02 17:57:59,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,405 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 17:57:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2018-12-02 17:57:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-02 17:57:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 17:57:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 17:57:59,407 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 17:57:59,407 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 17:57:59,407 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 17:57:59,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-12-02 17:57:59,407 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,408 INFO L794 eck$LassoCheckResult]: Stem: 1450#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1447#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1445#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; 1446#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1470#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; 1469#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); 1442#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; 1434#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; 1435#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1436#L9-3 assume !(sum_~i~0 < 10); 1432#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1433#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; 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; 1452#L9-7 [2018-12-02 17:57:59,408 INFO L796 eck$LassoCheckResult]: Loop: 1452#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1453#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; 1452#L9-7 [2018-12-02 17:57:59,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2018-12-02 17:57:59,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 17:57:59,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:59,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:59,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 17:57:59,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:59,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 17:57:59,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:59,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-12-02 17:57:59,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:57:59,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:57:59,508 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 17:57:59,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:59,533 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 17:57:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:57:59,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2018-12-02 17:57:59,534 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2018-12-02 17:57:59,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 17:57:59,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 17:57:59,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2018-12-02 17:57:59,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,535 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-02 17:57:59,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2018-12-02 17:57:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 17:57:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 17:57:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 17:57:59,536 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 17:57:59,536 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 17:57:59,536 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 17:57:59,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2018-12-02 17:57:59,536 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,537 INFO L794 eck$LassoCheckResult]: Stem: 1633#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1632#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1630#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; 1631#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1657#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; 1656#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); 1627#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; 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; 1619#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; 1620#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1624#L9-3 assume !(sum_~i~0 < 10); 1615#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1616#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; 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; 1637#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1638#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; 1640#L9-7 [2018-12-02 17:57:59,537 INFO L796 eck$LassoCheckResult]: Loop: 1640#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1639#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; 1640#L9-7 [2018-12-02 17:57:59,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,538 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2018-12-02 17:57:59,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-02 17:57:59,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:59,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:59,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-02 17:57:59,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:59,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 17:57:59,617 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:59,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-12-02 17:57:59,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:57:59,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:57:59,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:57:59,638 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 17:57:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:59,665 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-02 17:57:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:57:59,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2018-12-02 17:57:59,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 17:57:59,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 17:57:59,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 17:57:59,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-12-02 17:57:59,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,667 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 17:57:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-12-02 17:57:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-02 17:57:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 17:57:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-12-02 17:57:59,669 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-02 17:57:59,669 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-02 17:57:59,669 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 17:57:59,669 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2018-12-02 17:57:59,670 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,671 INFO L794 eck$LassoCheckResult]: Stem: 1840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1837#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 1835#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; 1836#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1864#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; 1863#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; 1850#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; 1849#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); 1832#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; 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; 1825#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; 1826#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1867#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; 1845#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1844#L9-3 assume !(sum_~i~0 < 10); 1821#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1822#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; 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; 1842#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1843#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; 1866#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1865#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; 1852#L9-7 [2018-12-02 17:57:59,671 INFO L796 eck$LassoCheckResult]: Loop: 1852#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1851#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; 1852#L9-7 [2018-12-02 17:57:59,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2018-12-02 17:57:59,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 17:57:59,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:59,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:59,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:57:59,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:57:59,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:59,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 17:57:59,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:59,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 17:57:59,759 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:59,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-12-02 17:57:59,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:57:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:57:59,788 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 17:57:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:59,826 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-02 17:57:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:57:59,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2018-12-02 17:57:59,827 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2018-12-02 17:57:59,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 17:57:59,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 17:57:59,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2018-12-02 17:57:59,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,828 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-02 17:57:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2018-12-02 17:57:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-12-02 17:57:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 17:57:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-02 17:57:59,838 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-02 17:57:59,838 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-02 17:57:59,838 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 17:57:59,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-12-02 17:57:59,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,840 INFO L794 eck$LassoCheckResult]: Stem: 2067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2066#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2062#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; 2063#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2064#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; 2065#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2093#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; 2092#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2091#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; 2090#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2089#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; 2088#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2087#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; 2086#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2085#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; 2084#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2083#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; 2082#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2081#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; 2080#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2079#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; 2078#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2077#L23-3 assume !(main_~i~1 < 10); 2061#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; 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; 2054#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; 2055#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2096#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; 2095#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2094#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; 2074#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2073#L9-3 assume !(sum_~i~0 < 10); 2050#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2051#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; 2070#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; 2071#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2072#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; 2100#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2099#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; 2076#L9-7 [2018-12-02 17:57:59,840 INFO L796 eck$LassoCheckResult]: Loop: 2076#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2075#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; 2076#L9-7 [2018-12-02 17:57:59,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,841 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2018-12-02 17:57:59,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:57:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 17:57:59,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:57:59,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:57:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 17:57:59,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 17:57:59,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:57:59,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:57:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 17:57:59,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:57:59,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 17:57:59,931 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:57:59,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-12-02 17:57:59,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:57:59,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:57:59,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:57:59,949 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 17:57:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:57:59,985 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-02 17:57:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:57:59,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2018-12-02 17:57:59,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2018-12-02 17:57:59,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 17:57:59,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 17:57:59,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2018-12-02 17:57:59,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:57:59,986 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 17:57:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2018-12-02 17:57:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-12-02 17:57:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 17:57:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 17:57:59,988 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 17:57:59,988 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 17:57:59,988 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 17:57:59,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2018-12-02 17:57:59,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:57:59,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:57:59,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:57:59,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:57:59,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:57:59,989 INFO L794 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2319#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 2317#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; 2318#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2346#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; 2345#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); 2314#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; 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; 2306#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; 2307#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2311#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; 2350#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2349#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; 2327#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2326#L9-3 assume !(sum_~i~0 < 10); 2302#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2303#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; 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; 2324#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2325#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; 2356#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2355#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; 2329#L9-7 [2018-12-02 17:57:59,989 INFO L796 eck$LassoCheckResult]: Loop: 2329#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2328#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; 2329#L9-7 [2018-12-02 17:57:59,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:57:59,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2018-12-02 17:57:59,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:57:59,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:57:59,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:57:59,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:57:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-02 17:58:00,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:58:00,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:58:00,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 17:58:00,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 17:58:00,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:58:00,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-02 17:58:00,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:58:00,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 17:58:00,109 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:58:00,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-12-02 17:58:00,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:58:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:58:00,130 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-02 17:58:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:00,191 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-02 17:58:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:58:00,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2018-12-02 17:58:00,191 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2018-12-02 17:58:00,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-02 17:58:00,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-02 17:58:00,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2018-12-02 17:58:00,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:00,192 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-12-02 17:58:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2018-12-02 17:58:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-12-02 17:58:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 17:58:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-12-02 17:58:00,193 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 17:58:00,193 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 17:58:00,193 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 17:58:00,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-12-02 17:58:00,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:00,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:00,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:00,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:00,194 INFO L794 eck$LassoCheckResult]: Stem: 2595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2594#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2590#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; 2591#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2592#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; 2593#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2621#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; 2620#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2619#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; 2618#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2617#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; 2616#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2615#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; 2614#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2613#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; 2612#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2611#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; 2610#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2609#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; 2608#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2607#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; 2606#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2605#L23-3 assume !(main_~i~1 < 10); 2589#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; 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; 2581#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; 2582#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2586#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; 2627#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2626#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; 2625#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2624#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; 2623#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2622#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; 2602#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2601#L9-3 assume !(sum_~i~0 < 10); 2577#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2578#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; 2598#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; 2599#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; 2635#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2634#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; 2604#L9-7 [2018-12-02 17:58:00,194 INFO L796 eck$LassoCheckResult]: Loop: 2604#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2603#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; 2604#L9-7 [2018-12-02 17:58:00,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,194 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2018-12-02 17:58:00,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-02 17:58:00,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:58:00,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:58:00,236 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 17:58:00,283 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 17:58:00,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:58:00,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-02 17:58:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:58:00,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 17:58:00,320 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:58:00,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2018-12-02 17:58:00,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:58:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:58:00,342 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-02 17:58:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:00,397 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-02 17:58:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:58:00,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2018-12-02 17:58:00,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2018-12-02 17:58:00,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-02 17:58:00,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-12-02 17:58:00,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2018-12-02 17:58:00,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:00,399 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-02 17:58:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2018-12-02 17:58:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-12-02 17:58:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 17:58:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-02 17:58:00,401 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-02 17:58:00,401 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-02 17:58:00,401 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 17:58:00,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2018-12-02 17:58:00,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:00,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:00,402 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:00,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:00,402 INFO L794 eck$LassoCheckResult]: Stem: 2895#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2892#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 2890#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; 2891#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2919#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; 2918#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; 2905#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; 2904#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); 2887#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; 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; 2879#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; 2880#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2884#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; 2927#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2926#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; 2900#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2899#L9-3 assume !(sum_~i~0 < 10); 2875#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2876#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; 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; 2897#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2898#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; 2937#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2936#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; 2907#L9-7 [2018-12-02 17:58:00,403 INFO L796 eck$LassoCheckResult]: Loop: 2907#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2906#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; 2907#L9-7 [2018-12-02 17:58:00,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2018-12-02 17:58:00,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:58:00,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-02 17:58:00,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:58:00,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:58:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 17:58:00,539 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-02 17:58:00,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:58:00,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-02 17:58:00,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:58:00,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2018-12-02 17:58:00,594 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:58:00,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2018-12-02 17:58:00,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 17:58:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:58:00,616 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 17:58:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:00,722 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-02 17:58:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:58:00,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2018-12-02 17:58:00,723 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2018-12-02 17:58:00,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-02 17:58:00,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-02 17:58:00,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2018-12-02 17:58:00,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:00,724 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-02 17:58:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2018-12-02 17:58:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-12-02 17:58:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 17:58:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-02 17:58:00,725 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 17:58:00,726 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 17:58:00,726 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 17:58:00,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2018-12-02 17:58:00,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:00,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:00,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:00,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:00,727 INFO L794 eck$LassoCheckResult]: Stem: 3231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3230#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 3228#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; 3229#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3258#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; 3257#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); 3225#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; 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; 3218#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; 3219#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3280#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; 3279#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3277#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; 3275#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3273#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; 3271#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3269#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; 3267#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3265#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; 3263#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3261#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; 3239#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3238#L9-3 assume !(sum_~i~0 < 10); 3214#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3215#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; 3236#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; 3237#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 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; 3278#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; 3276#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3274#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; 3272#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3270#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; 3268#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3266#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; 3264#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3262#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; 3260#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3259#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; 3241#L9-7 [2018-12-02 17:58:00,727 INFO L796 eck$LassoCheckResult]: Loop: 3241#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3240#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; 3241#L9-7 [2018-12-02 17:58:00,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2018-12-02 17:58:00,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-02 17:58:00,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:58:00,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:58:00,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:58:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-02 17:58:00,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:58:00,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 17:58:00,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:58:00,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2018-12-02 17:58:00,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:58:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:00,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 17:58:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:58:00,868 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-02 17:58:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:00,915 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-02 17:58:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:58:00,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-12-02 17:58:00,916 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2018-12-02 17:58:00,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-02 17:58:00,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-02 17:58:00,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2018-12-02 17:58:00,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:00,917 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-02 17:58:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2018-12-02 17:58:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2018-12-02 17:58:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 17:58:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-02 17:58:00,918 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 17:58:00,918 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 17:58:00,918 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 17:58:00,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2018-12-02 17:58:00,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:00,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:00,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:00,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:00,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:00,919 INFO L794 eck$LassoCheckResult]: Stem: 3575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3574#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 3572#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; 3573#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3602#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; 3601#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); 3569#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; 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; 3562#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; 3563#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3628#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; 3627#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; 3583#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3582#L9-3 assume !(sum_~i~0 < 10); 3558#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3559#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; 3580#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; 3581#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 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; 3615#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; 3614#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; 3585#L9-7 [2018-12-02 17:58:00,919 INFO L796 eck$LassoCheckResult]: Loop: 3585#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3584#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; 3585#L9-7 [2018-12-02 17:58:00,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2018-12-02 17:58:00,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:00,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 17:58:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 17:58:00,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b86e3f3-9ce1-47c4-9bbe-394ec998bfa7/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 17:58:00,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 17:58:01,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 17:58:01,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 17:58:01,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 17:58:01,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 17:58:01,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 17:58:01,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 17:58:01,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2018-12-02 17:58:01,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:01,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 17:58:01,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:58:01,083 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 17:58:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:01,139 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-12-02 17:58:01,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:58:01,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2018-12-02 17:58:01,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:01,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2018-12-02 17:58:01,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-02 17:58:01,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-02 17:58:01,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2018-12-02 17:58:01,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:01,141 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-02 17:58:01,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2018-12-02 17:58:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2018-12-02 17:58:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 17:58:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-12-02 17:58:01,142 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-02 17:58:01,142 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-02 17:58:01,142 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 17:58:01,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2018-12-02 17:58:01,142 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 17:58:01,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:01,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:01,142 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:01,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:01,143 INFO L794 eck$LassoCheckResult]: Stem: 3941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3938#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 3936#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; 3937#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3978#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; 3976#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3974#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; 3972#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3970#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; 3968#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3966#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; 3964#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3962#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; 3960#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3958#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; 3956#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3954#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; 3952#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3950#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; 3949#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); 3933#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; 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; 3926#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; 3927#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3979#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; 3977#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3975#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; 3973#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3971#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; 3969#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3967#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; 3965#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3963#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; 3961#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3959#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; 3957#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3955#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; 3953#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3951#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; 3947#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3946#L9-3 assume !(sum_~i~0 < 10); 3922#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3923#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; 3944#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; 3945#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 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; 3996#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; 3995#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 [2018-12-02 17:58:01,143 INFO L796 eck$LassoCheckResult]: Loop: 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; 3981#L9-7 [2018-12-02 17:58:01,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2018-12-02 17:58:01,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2018-12-02 17:58:01,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:01,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2018-12-02 17:58:01,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:01,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-02 17:58:01,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:58:01,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 17:58:01,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 17:58:01,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:58:01,502 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-12-02 17:58:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:58:01,639 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-12-02 17:58:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:58:01,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2018-12-02 17:58:01,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 17:58:01,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2018-12-02 17:58:01,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 17:58:01,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-02 17:58:01,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2018-12-02 17:58:01,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:01,641 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 17:58:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2018-12-02 17:58:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 17:58:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 17:58:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-02 17:58:01,642 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 17:58:01,642 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 17:58:01,642 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-02 17:58:01,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2018-12-02 17:58:01,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 17:58:01,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 17:58:01,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 17:58:01,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:58:01,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 17:58:01,643 INFO L794 eck$LassoCheckResult]: Stem: 4148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4145#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.alloc(40);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 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; 4143#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; 4144#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4187#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; 4186#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4184#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; 4182#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4180#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; 4178#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4176#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; 4174#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4172#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; 4170#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4168#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; 4166#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4164#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; 4162#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4160#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; 4157#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4156#L23-3 assume !(main_~i~1 < 10); 4140#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; 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; 4136#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4137#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; 4185#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4183#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; 4181#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4179#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; 4177#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4175#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; 4173#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4171#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; 4169#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4167#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; 4165#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4163#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; 4161#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4159#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; 4158#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4155#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; 4154#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); 4133#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4134#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; 4151#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; 4152#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 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; 4204#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; 4203#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); 4146#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4147#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; 4138#L32-3 [2018-12-02 17:58:01,643 INFO L796 eck$LassoCheckResult]: Loop: 4138#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; 4139#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 4138#L32-3 [2018-12-02 17:58:01,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2018-12-02 17:58:01,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:58:01,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-12-02 17:58:01,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:58:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:01,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2018-12-02 17:58:01,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 17:58:01,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 17:58:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:58:01,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:58:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:58:22,355 WARN L180 SmtUtils]: Spent 20.37 s on a formula simplification. DAG size of input: 524 DAG size of output: 390 [2018-12-02 17:58:40,768 WARN L180 SmtUtils]: Spent 18.37 s on a formula simplification. DAG size of input: 180 DAG size of output: 176 [2018-12-02 17:58:40,771 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 17:58:40,771 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 17:58:40,771 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 17:58:40,771 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 17:58:40,771 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 17:58:40,771 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 17:58:40,771 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 17:58:40,771 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 17:58:40,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-12-02 17:58:40,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 17:58:40,772 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 17:58:40,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:40,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,184 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-02 17:58:42,478 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 102 [2018-12-02 17:58:42,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 17:58:42,683 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-12-02 17:58:43,044 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-12-02 17:58:43,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 17:58:43,123 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 17:58:43,124 INFO L122 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 [2018-12-02 17:58:43,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,127 INFO L122 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 [2018-12-02 17:58:43,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,130 INFO L122 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 [2018-12-02 17:58:43,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,133 INFO L122 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 [2018-12-02 17:58:43,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:58:43,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,138 INFO L122 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 [2018-12-02 17:58:43,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,141 INFO L122 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 [2018-12-02 17:58:43,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,143 INFO L122 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 [2018-12-02 17:58:43,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:58:43,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,147 INFO L122 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 [2018-12-02 17:58:43,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,149 INFO L122 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 [2018-12-02 17:58:43,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,151 INFO L122 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 [2018-12-02 17:58:43,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:58:43,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,155 INFO L122 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 [2018-12-02 17:58:43,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:58:43,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,158 INFO L122 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 [2018-12-02 17:58:43,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,159 INFO L122 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 [2018-12-02 17:58:43,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,160 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:58:43,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:58:43,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,176 INFO L122 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 [2018-12-02 17:58:43,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,177 INFO L122 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 [2018-12-02 17:58:43,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,179 INFO L122 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 [2018-12-02 17:58:43,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,179 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 17:58:43,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,180 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 17:58:43,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,183 INFO L122 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 [2018-12-02 17:58:43,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 17:58:43,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 17:58:43,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 17:58:43,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 17:58:43,185 INFO L122 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 [2018-12-02 17:58:43,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 17:58:43,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 17:58:43,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 17:58:43,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 17:58:43,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 17:58:43,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 17:58:43,197 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 17:58:43,207 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 17:58:43,207 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 17:58:43,208 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 17:58:43,208 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 17:58:43,208 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 17:58:43,208 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-12-02 17:58:43,547 INFO L297 tatePredicateManager]: 103 out of 103 supporting invariants were superfluous and have been removed [2018-12-02 17:58:43,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:58:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:43,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:58:43,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 17:58:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:58:43,588 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 [2018-12-02 17:58:43,588 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 17:58:43,593 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. [2018-12-02 17:58:43,593 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 [2018-12-02 17:58:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 17:58:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-12-02 17:58:43,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2018-12-02 17:58:43,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:58:43,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2018-12-02 17:58:43,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:58:43,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2018-12-02 17:58:43,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 17:58:43,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2018-12-02 17:58:43,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:58:43,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 17:58:43,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 17:58:43,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 17:58:43,595 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-02 17:58:43,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 17:58:43,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 17:58:43,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 17:58:43,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 05:58:43 BoogieIcfgContainer [2018-12-02 17:58:43,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 17:58:43,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:58:43,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:58:43,600 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:58:43,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:57:54" (3/4) ... [2018-12-02 17:58:43,603 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 17:58:43,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:58:43,603 INFO L168 Benchmark]: Toolchain (without parser) took 49781.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 961.4 MB in the beginning and 860.9 MB in the end (delta: 100.5 MB). Peak memory consumption was 449.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,604 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:58:43,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.04 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,604 INFO L168 Benchmark]: Boogie Preprocessor took 45.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,605 INFO L168 Benchmark]: RCFGBuilder took 175.64 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,605 INFO L168 Benchmark]: BuchiAutomizer took 49391.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 243.3 MB). Peak memory consumption was 461.4 MB. Max. memory is 11.5 GB. [2018-12-02 17:58:43,605 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 860.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:58:43,607 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.04 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.81 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.64 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: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 49391.24 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 218.1 MB). Free memory was 1.1 GB in the beginning and 860.9 MB in the end (delta: 243.3 MB). Peak memory consumption was 461.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.4 GB. Free memory is still 860.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 -2 * i + 19 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 49.3s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 48.1s. Construction of modules took 0.5s. Büchi inclusion checks took 0.4s. 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: 415 SDtfs, 461 SDslu, 1503 SDs, 0 SdLazy, 864 SolverSat, 233 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital904 mio100 ax100 hnf99 lsp134 ukn40 mio100 lsp63 div100 bol100 ite100 ukn100 eq166 hnf84 smp91 dnf162 smp83 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 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...