./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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 48db2505a59cdca75fbfbfb4403b26f347fcdcda ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:45:25,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:45:25,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:45:25,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:45:25,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:45:25,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:45:25,966 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:45:25,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:45:25,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:45:25,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:45:25,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:45:25,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:45:25,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:45:25,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:45:25,971 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:45:25,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:45:25,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:45:25,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:45:25,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:45:25,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:45:25,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:45:25,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:45:25,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:45:25,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:45:25,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:45:25,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:45:25,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:45:25,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:45:25,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:45:25,982 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:45:25,982 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:45:25,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:45:25,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:45:25,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:45:25,984 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:45:25,984 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:45:25,984 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 02:45:25,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:45:25,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:45:25,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:45:25,995 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:45:25,996 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:45:25,996 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:45:25,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:45:25,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:45:25,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:45:25,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:45:25,999 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:45:25,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:45:25,999 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:45:25,999 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:45:25,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:45:26,000 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:45:26,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:45:26,000 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:45:26,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:45:26,000 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:45:26,000 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:45:26,001 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:45:26,001 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_30429f6d-656a-4c7c-916b-f77ccc773956/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 -> 48db2505a59cdca75fbfbfb4403b26f347fcdcda [2018-11-23 02:45:26,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:45:26,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:45:26,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:45:26,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:45:26,039 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:45:26,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-23 02:45:26,084 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/data/a3b6fc5e5/10b4761bcaa6440e9a15ac7d4cd46869/FLAG51073391a [2018-11-23 02:45:26,479 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:45:26,480 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/sv-benchmarks/c/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-23 02:45:26,483 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/data/a3b6fc5e5/10b4761bcaa6440e9a15ac7d4cd46869/FLAG51073391a [2018-11-23 02:45:26,493 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/bin-2019/uautomizer/data/a3b6fc5e5/10b4761bcaa6440e9a15ac7d4cd46869 [2018-11-23 02:45:26,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:45:26,495 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:45:26,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:45:26,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:45:26,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:45:26,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45abf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26, skipping insertion in model container [2018-11-23 02:45:26,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:45:26,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:45:26,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:45:26,636 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:45:26,648 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:45:26,657 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:45:26,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26 WrapperNode [2018-11-23 02:45:26,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:45:26,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:45:26,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:45:26,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:45:26,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:45:26,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:45:26,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:45:26,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:45:26,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... [2018-11-23 02:45:26,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:45:26,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:45:26,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:45:26,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:45:26,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:45:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:45:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:45:26,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:45:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:45:26,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:45:26,975 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:45:26,976 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-23 02:45:26,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:26 BoogieIcfgContainer [2018-11-23 02:45:26,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:45:26,976 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:45:26,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:45:26,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:45:26,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:45:26,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:45:26" (1/3) ... [2018-11-23 02:45:26,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50bbdd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:45:26, skipping insertion in model container [2018-11-23 02:45:26,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:45:26,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:45:26" (2/3) ... [2018-11-23 02:45:26,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50bbdd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:45:26, skipping insertion in model container [2018-11-23 02:45:26,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:45:26,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:26" (3/3) ... [2018-11-23 02:45:26,984 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-11-23 02:45:27,033 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:45:27,034 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:45:27,034 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:45:27,034 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:45:27,034 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:45:27,034 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:45:27,034 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:45:27,034 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:45:27,034 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:45:27,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 02:45:27,062 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 02:45:27,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:27,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:27,066 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:45:27,066 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:27,066 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:45:27,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-23 02:45:27,068 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-23 02:45:27,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:27,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:27,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 02:45:27,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:27,074 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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-11-23 02:45:27,074 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 5);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-11-23 02:45:27,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 02:45:27,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 02:45:27,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 02:45:27,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,310 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:45:27,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:45:27,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:45:27,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:45:27,311 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:45:27,311 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:45:27,311 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:45:27,311 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:45:27,311 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 02:45:27,311 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:45:27,311 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:45:27,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:27,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:45:27,532 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:45:27,534 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-11-23 02:45:27,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,539 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-11-23 02:45:27,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,541 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-11-23 02:45:27,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,544 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-11-23 02:45:27,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,546 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-11-23 02:45:27,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:27,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:27,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,551 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-11-23 02:45:27,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,553 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-11-23 02:45:27,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,556 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-11-23 02:45:27,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:27,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:27,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:27,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,559 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-11-23 02:45:27,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:27,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:27,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,565 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-11-23 02:45:27,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,565 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:45:27,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:45:27,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:27,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:27,573 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-11-23 02:45:27,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:27,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:27,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:27,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:27,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:27,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:27,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:45:27,621 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 02:45:27,621 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 02:45:27,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:45:27,623 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:45:27,624 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:45:27,624 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-23 02:45:27,627 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 02:45:27,634 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 02:45:27,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:27,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:27,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:27,718 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-11-23 02:45:27,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-23 02:45:27,785 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2018-11-23 02:45:27,785 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-11-23 02:45:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:45:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 02:45:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 02:45:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 02:45:27,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:27,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 02:45:27,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:27,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2018-11-23 02:45:27,792 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:27,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2018-11-23 02:45:27,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 02:45:27,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:27,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-23 02:45:27,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:27,798 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 02:45:27,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-23 02:45:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 02:45:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 02:45:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-23 02:45:27,815 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 02:45:27,815 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-23 02:45:27,815 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:45:27,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-23 02:45:27,816 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:27,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:27,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:27,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 02:45:27,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:27,817 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 145#L23-3 assume !(main_~i~1 < 5); 144#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 137#L9-3 [2018-11-23 02:45:27,817 INFO L796 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 138#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 137#L9-3 [2018-11-23 02:45:27,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,817 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 02:45:27,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:27,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:45:27,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:45:27,854 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:27,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-23 02:45:27,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:45:27,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:45:27,887 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 02:45:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:27,895 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 02:45:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:45:27,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 02:45:27,898 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:27,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-11-23 02:45:27,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:45:27,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:27,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-23 02:45:27,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:27,899 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-23 02:45:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-23 02:45:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 02:45:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 02:45:27,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-23 02:45:27,900 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 02:45:27,900 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-23 02:45:27,900 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:45:27,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-23 02:45:27,901 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:27,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:27,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:27,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 02:45:27,901 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:27,902 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 5); 189#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L9-3 [2018-11-23 02:45:27,902 INFO L796 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 182#L9-3 [2018-11-23 02:45:27,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 02:45:27,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:27,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:27,932 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:27,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:27,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 02:45:27,963 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:27,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-23 02:45:27,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:27,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:27,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:45:27,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:45:27,995 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 02:45:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:28,011 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-23 02:45:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:45:28,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-23 02:45:28,013 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-11-23 02:45:28,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:45:28,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:28,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-23 02:45:28,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:28,014 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-23 02:45:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-23 02:45:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 02:45:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 02:45:28,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-23 02:45:28,016 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 02:45:28,016 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-23 02:45:28,016 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:45:28,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-23 02:45:28,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:28,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:28,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 02:45:28,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:28,017 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 254#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 256#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 264#L23-3 assume !(main_~i~1 < 5); 253#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 246#L9-3 [2018-11-23 02:45:28,017 INFO L796 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L9-3 [2018-11-23 02:45:28,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,017 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 02:45:28,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:28,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:45:28,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:45:28,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:45:28,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:28,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 02:45:28,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:28,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-11-23 02:45:28,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:45:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:45:28,123 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 02:45:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:28,138 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 02:45:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:45:28,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-23 02:45:28,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 02:45:28,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:45:28,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:28,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-23 02:45:28,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:28,142 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 02:45:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-23 02:45:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 02:45:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 02:45:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-23 02:45:28,144 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 02:45:28,144 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-23 02:45:28,144 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:45:28,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-23 02:45:28,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:28,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:28,145 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 02:45:28,145 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:28,146 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 329#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 331#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 5); 328#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 321#L9-3 [2018-11-23 02:45:28,146 INFO L796 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 322#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 321#L9-3 [2018-11-23 02:45:28,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 02:45:28,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:28,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:45:28,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 02:45:28,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:45:28,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:28,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 02:45:28,247 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:28,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-11-23 02:45:28,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:45:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:45:28,273 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 02:45:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:28,291 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 02:45:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:45:28,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-23 02:45:28,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 02:45:28,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:45:28,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:28,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-23 02:45:28,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:28,293 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 02:45:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-23 02:45:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 02:45:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 02:45:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 02:45:28,297 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 02:45:28,297 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 02:45:28,297 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:45:28,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-23 02:45:28,298 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:28,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:28,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 02:45:28,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:28,299 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 415#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 417#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 420#L23-3 assume !!(main_~i~1 < 5);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 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 5); 414#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 407#L9-3 [2018-11-23 02:45:28,299 INFO L796 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 408#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 407#L9-3 [2018-11-23 02:45:28,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 02:45:28,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:28,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:28,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:45:28,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:45:28,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:45:28,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:28,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:28,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 02:45:28,386 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-11-23 02:45:28,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:45:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:45:28,417 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-23 02:45:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:28,436 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 02:45:28,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:45:28,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2018-11-23 02:45:28,438 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 02:45:28,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:45:28,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:45:28,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2018-11-23 02:45:28,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:28,439 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 02:45:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2018-11-23 02:45:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 02:45:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:45:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 02:45:28,443 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 02:45:28,443 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 02:45:28,443 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:45:28,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-23 02:45:28,444 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-23 02:45:28,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:28,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:28,444 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 02:45:28,445 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:28,445 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 514#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 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 527#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 526#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 525#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 524#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 523#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 522#L23-3 assume !(main_~i~1 < 5); 510#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; 503#L9-3 [2018-11-23 02:45:28,445 INFO L796 eck$LassoCheckResult]: Loop: 503#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 504#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 503#L9-3 [2018-11-23 02:45:28,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 02:45:28,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-11-23 02:45:28,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2018-11-23 02:45:28,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:28,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:28,762 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-11-23 02:45:28,812 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:45:28,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:45:28,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:45:28,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:45:28,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:45:28,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:45:28,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:45:28,813 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:45:28,813 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-23 02:45:28,813 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:45:28,813 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:45:28,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:28,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:29,053 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:45:29,053 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:45:29,053 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-11-23 02:45:29,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:29,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:29,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:29,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,056 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-11-23 02:45:29,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:29,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:29,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:29,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,057 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-11-23 02:45:29,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:29,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,068 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-11-23 02:45:29,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:29,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:29,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:29,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,070 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-11-23 02:45:29,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:29,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:29,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:29,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,071 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-11-23 02:45:29,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:29,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:29,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:29,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,072 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-11-23 02:45:29,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:29,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,077 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-11-23 02:45:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:29,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,085 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-11-23 02:45:29,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:29,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,089 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-11-23 02:45:29,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,089 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:45:29,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,091 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:45:29,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:29,096 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-11-23 02:45:29,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:29,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:29,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:29,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:29,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:29,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:29,111 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:45:29,121 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:45:29,121 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 02:45:29,121 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:45:29,122 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:45:29,122 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:45:29,122 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 9 Supporting invariants [] [2018-11-23 02:45:29,134 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 02:45:29,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:29,178 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-11-23 02:45:29,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-23 02:45:29,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 31 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 38 transitions. Complement of second has 7 states. [2018-11-23 02:45:29,194 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-11-23 02:45:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:45:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-23 02:45:29,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-23 02:45:29,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-23 02:45:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:29,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 02:45:29,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:29,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-23 02:45:29,197 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2018-11-23 02:45:29,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 02:45:29,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 02:45:29,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2018-11-23 02:45:29,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,197 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 02:45:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2018-11-23 02:45:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 02:45:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 02:45:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 02:45:29,199 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 02:45:29,199 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 02:45:29,199 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:45:29,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2018-11-23 02:45:29,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,200 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,200 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,200 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 658#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 654#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 655#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 656#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 657#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 659#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 670#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 669#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 668#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 667#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 666#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 665#L23-3 assume !(main_~i~1 < 5); 653#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; 645#L9-3 assume !(sum_~i~0 < 5); 643#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 644#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; 663#L9-8 [2018-11-23 02:45:29,200 INFO L796 eck$LassoCheckResult]: Loop: 663#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 664#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 663#L9-8 [2018-11-23 02:45:29,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581027, now seen corresponding path program 1 times [2018-11-23 02:45:29,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 02:45:29,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:45:29,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:45:29,224 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:29,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-11-23 02:45:29,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:45:29,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:45:29,258 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 02:45:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:29,274 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 02:45:29,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:45:29,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-23 02:45:29,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:45:29,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 02:45:29,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 02:45:29,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 37 transitions. [2018-11-23 02:45:29,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,277 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:45:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 37 transitions. [2018-11-23 02:45:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-23 02:45:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 02:45:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 02:45:29,278 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 02:45:29,278 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 02:45:29,278 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:45:29,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-23 02:45:29,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,280 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 725#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 721#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 722#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 723#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 724#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 738#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 737#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 736#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 735#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 734#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 733#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 732#L23-3 assume !(main_~i~1 < 5); 720#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; 712#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 713#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 714#L9-3 assume !(sum_~i~0 < 5); 710#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 711#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; 729#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 730#L9-7 [2018-11-23 02:45:29,280 INFO L796 eck$LassoCheckResult]: Loop: 730#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 731#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 730#L9-7 [2018-11-23 02:45:29,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1577614809, now seen corresponding path program 1 times [2018-11-23 02:45:29,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 02:45:29,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:29,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:29,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 02:45:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 02:45:29,373 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:29,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-11-23 02:45:29,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:45:29,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:45:29,400 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-23 02:45:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:29,425 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 02:45:29,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:45:29,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 43 transitions. [2018-11-23 02:45:29,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 02:45:29,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:45:29,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 02:45:29,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 43 transitions. [2018-11-23 02:45:29,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,428 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 02:45:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 43 transitions. [2018-11-23 02:45:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-23 02:45:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:45:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:45:29,429 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:45:29,429 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:45:29,430 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 02:45:29,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-11-23 02:45:29,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,431 INFO L794 eck$LassoCheckResult]: Stem: 861#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 860#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 858#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 875#L23-3 assume !!(main_~i~1 < 5);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; 873#L23-3 assume !!(main_~i~1 < 5);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; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 869#L23-3 assume !(main_~i~1 < 5); 855#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; 845#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 846#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 847#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 848#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 852#L9-3 assume !(sum_~i~0 < 5); 843#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 844#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; 866#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 867#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 864#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 865#L9-7 [2018-11-23 02:45:29,431 INFO L796 eck$LassoCheckResult]: Loop: 865#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 868#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 865#L9-7 [2018-11-23 02:45:29,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -483964569, now seen corresponding path program 1 times [2018-11-23 02:45:29,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 02:45:29,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:29,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:29,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 02:45:29,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:29,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 02:45:29,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:29,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-11-23 02:45:29,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:29,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:45:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:45:29,549 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-23 02:45:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:29,582 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 02:45:29,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:45:29,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 49 transitions. [2018-11-23 02:45:29,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 02:45:29,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 02:45:29,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 02:45:29,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 49 transitions. [2018-11-23 02:45:29,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,584 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 02:45:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 49 transitions. [2018-11-23 02:45:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-11-23 02:45:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:45:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 02:45:29,588 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 02:45:29,588 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 02:45:29,588 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 02:45:29,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-23 02:45:29,588 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,589 INFO L794 eck$LassoCheckResult]: Stem: 1019#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(20);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 < 5);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 < 5);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; 1034#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1033#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 < 5);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 < 5);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 < 5); 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; 1001#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1002#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1003#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1004#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1008#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1026#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1025#L9-3 assume !(sum_~i~0 < 5); 999#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1000#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; 1022#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1023#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1024#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1035#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1020#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L9-7 [2018-11-23 02:45:29,589 INFO L796 eck$LassoCheckResult]: Loop: 1021#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1032#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1021#L9-7 [2018-11-23 02:45:29,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1757450151, now seen corresponding path program 2 times [2018-11-23 02:45:29,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 02:45:29,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:29,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:29,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:45:29,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:45:29,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:45:29,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 02:45:29,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:29,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 02:45:29,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:29,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-11-23 02:45:29,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:45:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:45:29,715 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 02:45:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:29,751 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 02:45:29,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:45:29,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-11-23 02:45:29,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 02:45:29,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-23 02:45:29,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 02:45:29,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 55 transitions. [2018-11-23 02:45:29,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,754 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 02:45:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 55 transitions. [2018-11-23 02:45:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-11-23 02:45:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:45:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 02:45:29,757 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 02:45:29,757 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 02:45:29,757 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 02:45:29,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2018-11-23 02:45:29,757 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,758 INFO L794 eck$LassoCheckResult]: Stem: 1197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1194#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1190#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1192#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1211#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1210#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1207#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1206#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1205#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1204#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1203#L23-3 assume !(main_~i~1 < 5); 1189#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; 1180#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1181#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1182#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1214#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1213#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1212#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1202#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1201#L9-3 assume !(sum_~i~0 < 5); 1178#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1179#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; 1198#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1199#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1200#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1218#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1217#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1216#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1215#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L9-7 [2018-11-23 02:45:29,758 INFO L796 eck$LassoCheckResult]: Loop: 1209#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1208#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1209#L9-7 [2018-11-23 02:45:29,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1218450663, now seen corresponding path program 3 times [2018-11-23 02:45:29,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 02:45:29,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:45:29,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_30429f6d-656a-4c7c-916b-f77ccc773956/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-11-23 02:45:29,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:45:29,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 02:45:29,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:45:29,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-23 02:45:29,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:45:29,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 02:45:29,877 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:45:29,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-11-23 02:45:29,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:29,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:45:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:45:29,903 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-23 02:45:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:29,955 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-23 02:45:29,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:45:29,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 58 transitions. [2018-11-23 02:45:29,956 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 58 transitions. [2018-11-23 02:45:29,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 02:45:29,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 02:45:29,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 58 transitions. [2018-11-23 02:45:29,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:29,957 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-23 02:45:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 58 transitions. [2018-11-23 02:45:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 02:45:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 02:45:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 02:45:29,960 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 02:45:29,960 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 02:45:29,960 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 02:45:29,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 49 transitions. [2018-11-23 02:45:29,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-23 02:45:29,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:29,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:29,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:29,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:29,962 INFO L794 eck$LassoCheckResult]: Stem: 1395#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1394#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1390#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1391#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1392#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1393#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1416#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1414#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1412#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1410#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1408#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1406#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1405#L23-3 assume !(main_~i~1 < 5); 1389#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; 1379#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1380#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1381#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1382#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1386#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1421#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1420#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1419#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1418#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1402#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1401#L9-3 assume !(sum_~i~0 < 5); 1377#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1378#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; 1398#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1399#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1400#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1417#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1415#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1413#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1411#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1409#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1407#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-7 [2018-11-23 02:45:29,962 INFO L796 eck$LassoCheckResult]: Loop: 1404#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1403#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1404#L9-7 [2018-11-23 02:45:29,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:29,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2144167641, now seen corresponding path program 4 times [2018-11-23 02:45:29,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:29,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:29,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:30,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-11-23 02:45:30,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:30,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1039200421, now seen corresponding path program 5 times [2018-11-23 02:45:30,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:30,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:30,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:30,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 02:45:30,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:45:30,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:45:30,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:45:30,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:45:30,156 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-23 02:45:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:45:30,281 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 02:45:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:45:30,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 55 transitions. [2018-11-23 02:45:30,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:45:30,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 42 states and 43 transitions. [2018-11-23 02:45:30,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 02:45:30,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-23 02:45:30,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 43 transitions. [2018-11-23 02:45:30,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:30,284 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 02:45:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 43 transitions. [2018-11-23 02:45:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 02:45:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 02:45:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 02:45:30,285 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 02:45:30,285 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 02:45:30,285 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 02:45:30,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 43 transitions. [2018-11-23 02:45:30,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-23 02:45:30,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:45:30,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:45:30,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:45:30,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 02:45:30,291 INFO L794 eck$LassoCheckResult]: Stem: 1518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1515#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(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1511#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1512#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1513#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1514#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1536#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1535#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1533#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1531#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1529#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1525#L23-3 assume !(main_~i~1 < 5); 1510#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; 1505#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1506#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1507#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1534#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1532#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1530#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1528#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1527#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1524#L9-3 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1523#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1522#L9-3 assume !(sum_~i~0 < 5); 1503#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1504#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; 1519#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1520#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1521#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1544#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1543#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1542#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1541#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1540#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1539#L9-8 assume !!(sum_~i~0 < 5);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1538#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1537#L9-8 assume !(sum_~i~0 < 5); 1516#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1517#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; 1508#L32-3 [2018-11-23 02:45:30,291 INFO L796 eck$LassoCheckResult]: Loop: 1508#L32-3 assume !!(main_~i~2 < 4);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; 1509#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 1508#L32-3 [2018-11-23 02:45:30,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash -2055775835, now seen corresponding path program 1 times [2018-11-23 02:45:30,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:30,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:45:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:30,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-11-23 02:45:30,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:30,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:30,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 84380519, now seen corresponding path program 1 times [2018-11-23 02:45:30,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:45:30,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:45:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:45:30,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:45:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:45:32,329 WARN L180 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 319 DAG size of output: 242 [2018-11-23 02:45:33,590 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2018-11-23 02:45:33,592 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:45:33,592 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:45:33,592 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:45:33,592 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:45:33,592 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:45:33,592 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:45:33,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:45:33,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:45:33,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum05_true-unreach-call_true-termination.i_Iteration14_Lasso [2018-11-23 02:45:33,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:45:33,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:45:33,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:33,837 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:45:34,053 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2018-11-23 02:45:34,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:45:34,274 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2018-11-23 02:45:34,549 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-23 02:45:34,595 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:45:34,595 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:45:34,595 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-11-23 02:45:34,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,597 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-11-23 02:45:34,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,599 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-11-23 02:45:34,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:34,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,601 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-11-23 02:45:34,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,603 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-11-23 02:45:34,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,604 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-11-23 02:45:34,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,605 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-11-23 02:45:34,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:34,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,608 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-11-23 02:45:34,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,609 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-11-23 02:45:34,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:34,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,612 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-11-23 02:45:34,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,614 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-11-23 02:45:34,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:34,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,616 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-11-23 02:45:34,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,617 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:45:34,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,620 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:45:34,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,631 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-11-23 02:45:34,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,631 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 02:45:34,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,632 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 02:45:34,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,636 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-11-23 02:45:34,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:45:34,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:45:34,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:45:34,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:45:34,637 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-11-23 02:45:34,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:45:34,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:45:34,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:45:34,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:45:34,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:45:34,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:45:34,648 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:45:34,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 02:45:34,658 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:45:34,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:45:34,659 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 02:45:34,659 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:45:34,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 7 Supporting invariants [] [2018-11-23 02:45:34,734 INFO L297 tatePredicateManager]: 28 out of 28 supporting invariants were superfluous and have been removed [2018-11-23 02:45:34,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:45:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:34,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:45:34,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:45:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:45:34,776 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-11-23 02:45:34,776 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-23 02:45:34,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 43 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 44 states and 46 transitions. Complement of second has 4 states. [2018-11-23 02:45:34,782 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-11-23 02:45:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:45:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-23 02:45:34,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 2 letters. [2018-11-23 02:45:34,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:34,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 42 letters. Loop has 2 letters. [2018-11-23 02:45:34,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:34,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-23 02:45:34,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:45:34,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2018-11-23 02:45:34,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:45:34,784 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-11-23 02:45:34,784 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 02:45:34,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 02:45:34,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 02:45:34,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:45:34,784 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:45:34,784 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:45:34,784 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:45:34,785 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 02:45:34,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:45:34,785 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 02:45:34,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 02:45:34,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:45:34 BoogieIcfgContainer [2018-11-23 02:45:34,791 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:45:34,792 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:45:34,792 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:45:34,792 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:45:34,792 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:45:26" (3/4) ... [2018-11-23 02:45:34,794 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:45:34,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:45:34,795 INFO L168 Benchmark]: Toolchain (without parser) took 8299.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -235.4 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:45:34,796 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:45:34,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.28 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:45:34,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:45:34,797 INFO L168 Benchmark]: Boogie Preprocessor took 58.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:45:34,797 INFO L168 Benchmark]: RCFGBuilder took 233.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:45:34,797 INFO L168 Benchmark]: BuchiAutomizer took 7814.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:45:34,798 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:45:34,800 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.28 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 25.99 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 233.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7814.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.8 MB). Peak memory consumption was 116.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 9 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 6.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 227 SDtfs, 194 SDslu, 446 SDs, 0 SdLazy, 314 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital371 mio100 ax100 hnf99 lsp112 ukn47 mio100 lsp66 div104 bol100 ite100 ukn100 eq160 hnf85 smp86 dnf262 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...