./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/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 eda42c9201fdedd9f50669e53ef2af5b1d7cb675 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 04:23:56,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:23:56,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:23:56,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:23:56,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:23:56,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:23:56,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:23:56,351 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:23:56,352 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:23:56,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:23:56,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:23:56,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:23:56,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:23:56,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:23:56,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:23:56,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:23:56,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:23:56,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:23:56,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:23:56,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:23:56,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:23:56,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:23:56,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:23:56,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:23:56,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:23:56,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:23:56,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:23:56,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:23:56,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:23:56,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:23:56,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:23:56,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:23:56,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:23:56,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:23:56,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:23:56,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:23:56,366 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 04:23:56,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:23:56,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:23:56,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:23:56,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:23:56,374 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:23:56,375 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 04:23:56,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:23:56,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:23:56,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 04:23:56,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 04:23:56,377 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:23:56,377 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:23:56,378 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 04:23:56,378 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 04:23:56,378 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_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/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 -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2018-12-02 04:23:56,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:23:56,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:23:56,404 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:23:56,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:23:56,405 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:23:56,405 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-12-02 04:23:56,439 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/data/5d1bc3274/07dff530c6094ed69c41627b2967bcff/FLAG5ff5f1f0e [2018-12-02 04:23:56,871 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:23:56,872 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/sv-benchmarks/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-12-02 04:23:56,876 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/data/5d1bc3274/07dff530c6094ed69c41627b2967bcff/FLAG5ff5f1f0e [2018-12-02 04:23:56,885 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/data/5d1bc3274/07dff530c6094ed69c41627b2967bcff [2018-12-02 04:23:56,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:23:56,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:23:56,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:23:56,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:23:56,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:23:56,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:23:56" (1/1) ... [2018-12-02 04:23:56,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf0b28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:56, skipping insertion in model container [2018-12-02 04:23:56,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:23:56" (1/1) ... [2018-12-02 04:23:56,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:23:56,906 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:23:56,996 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:23:56,998 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:23:57,009 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:23:57,020 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:23:57,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57 WrapperNode [2018-12-02 04:23:57,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:23:57,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:23:57,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:23:57,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:23:57,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:23:57,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:23:57,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:23:57,041 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:23:57,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... [2018-12-02 04:23:57,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:23:57,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:23:57,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:23:57,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:23:57,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:23:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:23:57,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:23:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:23:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:23:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:23:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 04:23:57,228 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:23:57,228 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 04:23:57,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:23:57 BoogieIcfgContainer [2018-12-02 04:23:57,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:23:57,229 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 04:23:57,229 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 04:23:57,231 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 04:23:57,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:23:57,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 04:23:56" (1/3) ... [2018-12-02 04:23:57,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fd0e497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:23:57, skipping insertion in model container [2018-12-02 04:23:57,232 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:23:57,232 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:23:57" (2/3) ... [2018-12-02 04:23:57,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fd0e497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 04:23:57, skipping insertion in model container [2018-12-02 04:23:57,233 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 04:23:57,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:23:57" (3/3) ... [2018-12-02 04:23:57,234 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-12-02 04:23:57,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:23:57,265 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 04:23:57,265 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 04:23:57,265 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 04:23:57,265 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:23:57,265 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:23:57,265 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 04:23:57,265 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:23:57,265 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 04:23:57,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 04:23:57,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-12-02 04:23:57,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:57,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:57,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 04:23:57,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:23:57,289 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 04:23:57,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-02 04:23:57,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-12-02 04:23:57,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:57,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:57,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 04:23:57,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 04:23:57,295 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2018-12-02 04:23:57,295 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2018-12-02 04:23:57,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 04:23:57,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 04:23:57,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 04:23:57,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,461 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:23:57,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:23:57,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:23:57,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:23:57,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:23:57,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:23:57,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:23:57,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:23:57,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 04:23:57,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:23:57,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:23:57,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:23:57,611 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:23:57,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:23:57,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,628 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:23:57,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,630 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:23:57,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:23:57,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:23:57,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:23:57,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:23:57,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:23:57,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:23:57,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:23:57,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:23:57,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:23:57,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:23:57,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:23:57,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:23:57,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:23:57,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:23:57,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:23:57,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:23:57,674 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:23:57,684 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 04:23:57,684 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 04:23:57,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:23:57,687 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 04:23:57,687 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:23:57,687 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [] [2018-12-02 04:23:57,692 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 04:23:57,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:57,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:57,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:57,736 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 04:23:57,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-12-02 04:23:57,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2018-12-02 04:23:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 04:23:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:23:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-02 04:23:57,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 04:23:57,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:23:57,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 04:23:57,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:23:57,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 04:23:57,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:23:57,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2018-12-02 04:23:57,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2018-12-02 04:23:57,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-12-02 04:23:57,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-12-02 04:23:57,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-12-02 04:23:57,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:57,773 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 04:23:57,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-12-02 04:23:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 04:23:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:23:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-02 04:23:57,790 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 04:23:57,790 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-02 04:23:57,790 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 04:23:57,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-12-02 04:23:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:57,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:57,790 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 04:23:57,790 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:57,791 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2018-12-02 04:23:57,791 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2018-12-02 04:23:57,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-02 04:23:57,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:57,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:23:57,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:23:57,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:57,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2018-12-02 04:23:57,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:23:57,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:23:57,865 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-02 04:23:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:57,876 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-02 04:23:57,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:23:57,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-02 04:23:57,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 04:23:57,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:57,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:57,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-12-02 04:23:57,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:57,878 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 04:23:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-12-02 04:23:57,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-02 04:23:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 04:23:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-02 04:23:57,879 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 04:23:57,879 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 04:23:57,879 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 04:23:57,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-02 04:23:57,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:57,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:57,879 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 04:23:57,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:57,880 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2018-12-02 04:23:57,880 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2018-12-02 04:23:57,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-02 04:23:57,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:57,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:57,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:57,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:57,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:57,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:57,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 04:23:57,929 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:57,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2018-12-02 04:23:57,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:57,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:23:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:23:57,976 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-02 04:23:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:57,992 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-02 04:23:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:23:57,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-12-02 04:23:57,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-12-02 04:23:57,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:57,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:57,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-12-02 04:23:57,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:57,994 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 04:23:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-12-02 04:23:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-02 04:23:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 04:23:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 04:23:57,995 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 04:23:57,996 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 04:23:57,996 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 04:23:57,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-02 04:23:57,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:57,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:57,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:57,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 04:23:57,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:57,997 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2018-12-02 04:23:57,997 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2018-12-02 04:23:57,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-02 04:23:57,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:57,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,017 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 04:23:58,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 04:23:58,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:58,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 04:23:58,076 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,077 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2018-12-02 04:23:58,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:23:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:23:58,128 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-12-02 04:23:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,147 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-02 04:23:58,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 04:23:58,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-12-02 04:23:58,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 04:23:58,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-12-02 04:23:58,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,149 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 04:23:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-12-02 04:23:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-02 04:23:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 04:23:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-02 04:23:58,151 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 04:23:58,151 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 04:23:58,151 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 04:23:58,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-12-02 04:23:58,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-02 04:23:58,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,152 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2018-12-02 04:23:58,152 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2018-12-02 04:23:58,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-02 04:23:58,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:23:58,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 04:23:58,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:58,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 04:23:58,216 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,217 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2018-12-02 04:23:58,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:23:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:23:58,256 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-12-02 04:23:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,273 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-02 04:23:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:23:58,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-12-02 04:23:58,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 04:23:58,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-12-02 04:23:58,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,275 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:23:58,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-12-02 04:23:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-02 04:23:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 04:23:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 04:23:58,276 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 04:23:58,276 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 04:23:58,276 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 04:23:58,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-12-02 04:23:58,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-02 04:23:58,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,277 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2018-12-02 04:23:58,277 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2018-12-02 04:23:58,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,277 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-02 04:23:58,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:23:58,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:23:58,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:58,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,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-12-02 04:23:58,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 04:23:58,351 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2018-12-02 04:23:58,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 04:23:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 04:23:58,409 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-12-02 04:23:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,430 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-02 04:23:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 04:23:58,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-12-02 04:23:58,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 04:23:58,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-12-02 04:23:58,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,432 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 04:23:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-12-02 04:23:58,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-02 04:23:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 04:23:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 04:23:58,434 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:23:58,434 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 04:23:58,434 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 04:23:58,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-12-02 04:23:58,434 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,435 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-02 04:23:58,435 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,435 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2018-12-02 04:23:58,435 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2018-12-02 04:23:58,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-02 04:23:58,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,477 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 04:23:58,489 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 04:23:58,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:58,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 04:23:58,512 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2018-12-02 04:23:58,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 04:23:58,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 04:23:58,550 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-12-02 04:23:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,571 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-02 04:23:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:23:58,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-12-02 04:23:58,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 04:23:58,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-12-02 04:23:58,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,572 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 04:23:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-12-02 04:23:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-02 04:23:58,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 04:23:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 04:23:58,574 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 04:23:58,574 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 04:23:58,574 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 04:23:58,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-12-02 04:23:58,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,575 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-12-02 04:23:58,575 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,575 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~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2018-12-02 04:23:58,575 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2018-12-02 04:23:58,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-12-02 04:23:58,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 04:23:58,648 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 04:23:58,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:58,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 04:23:58,682 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2018-12-02 04:23:58,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 04:23:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:23:58,732 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-12-02 04:23:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,759 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-02 04:23:58,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 04:23:58,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-12-02 04:23:58,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 04:23:58,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-12-02 04:23:58,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,761 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 04:23:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-12-02 04:23:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-02 04:23:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 04:23:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 04:23:58,762 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 04:23:58,762 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 04:23:58,762 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 04:23:58,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-12-02 04:23:58,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,762 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-12-02 04:23:58,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,763 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2018-12-02 04:23:58,763 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2018-12-02 04:23:58,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-12-02 04:23:58,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:58,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:58,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 04:23:58,864 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:58,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2018-12-02 04:23:58,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:23:58,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:58,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 04:23:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:23:58,906 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-12-02 04:23:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:58,928 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-02 04:23:58,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 04:23:58,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-12-02 04:23:58,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 04:23:58,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:58,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:58,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-12-02 04:23:58,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:58,929 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 04:23:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-12-02 04:23:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 04:23:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 04:23:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 04:23:58,930 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 04:23:58,930 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 04:23:58,930 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 04:23:58,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-12-02 04:23:58,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:58,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:58,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:58,931 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-12-02 04:23:58,931 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:58,941 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2018-12-02 04:23:58,941 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2018-12-02 04:23:58,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:58,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-12-02 04:23:58,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:58,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:58,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:58,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:58,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 04:23:59,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 04:23:59,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:59,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:59,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:59,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 04:23:59,031 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:59,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2018-12-02 04:23:59,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 04:23:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 04:23:59,066 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-12-02 04:23:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:59,091 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-02 04:23:59,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 04:23:59,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-12-02 04:23:59,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-12-02 04:23:59,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-12-02 04:23:59,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-12-02 04:23:59,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-12-02 04:23:59,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:59,092 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 04:23:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-12-02 04:23:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 04:23:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 04:23:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 04:23:59,093 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 04:23:59,093 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 04:23:59,093 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 04:23:59,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-12-02 04:23:59,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:59,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:59,094 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-12-02 04:23:59,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:59,094 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2018-12-02 04:23:59,094 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2018-12-02 04:23:59,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,094 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-12-02 04:23:59,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:59,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:59,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:59,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 04:23:59,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 04:23:59,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:59,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:59,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:59,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 04:23:59,237 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:59,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2018-12-02 04:23:59,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 04:23:59,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 04:23:59,269 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-12-02 04:23:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:59,297 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-02 04:23:59,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 04:23:59,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-12-02 04:23:59,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2018-12-02 04:23:59,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 04:23:59,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 04:23:59,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2018-12-02 04:23:59,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:59,299 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-02 04:23:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2018-12-02 04:23:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-12-02 04:23:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 04:23:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-02 04:23:59,301 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 04:23:59,301 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 04:23:59,301 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 04:23:59,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-12-02 04:23:59,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:59,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:59,302 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-12-02 04:23:59,302 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:59,302 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2018-12-02 04:23:59,302 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2018-12-02 04:23:59,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-12-02 04:23:59,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:23:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:59,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:23:59,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef21860d-b2ba-49de-b24d-e0e1ad4d4db3/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 04:23:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 04:23:59,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 04:23:59,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 04:23:59,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:23:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:23:59,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:23:59,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-12-02 04:23:59,407 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 04:23:59,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2018-12-02 04:23:59,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 04:23:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 04:23:59,461 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-12-02 04:23:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:23:59,499 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-02 04:23:59,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 04:23:59,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2018-12-02 04:23:59,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2018-12-02 04:23:59,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 04:23:59,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 04:23:59,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-12-02 04:23:59,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:23:59,501 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-02 04:23:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-12-02 04:23:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-12-02 04:23:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 04:23:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 04:23:59,502 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 04:23:59,502 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 04:23:59,502 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 04:23:59,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-12-02 04:23:59,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-12-02 04:23:59,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 04:23:59,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 04:23:59,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2018-12-02 04:23:59,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-12-02 04:23:59,504 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2018-12-02 04:23:59,504 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2018-12-02 04:23:59,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2018-12-02 04:23:59,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2018-12-02 04:23:59,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:23:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2018-12-02 04:23:59,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:23:59,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:23:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 04:23:59,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:23:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:23:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:24:06,655 WARN L180 SmtUtils]: Spent 7.05 s on a formula simplification. DAG size of input: 214 DAG size of output: 162 [2018-12-02 04:24:06,831 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-02 04:24:06,833 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 04:24:06,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 04:24:06,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 04:24:06,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 04:24:06,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 04:24:06,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 04:24:06,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 04:24:06,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 04:24:06,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration13_Lasso [2018-12-02 04:24:06,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 04:24:06,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 04:24:06,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:06,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 04:24:07,100 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 04:24:07,100 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 04:24:07,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,105 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:24:07,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:24:07,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 04:24:07,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 04:24:07,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 04:24:07,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,111 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 04:24:07,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,112 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 04:24:07,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:24:07,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:24:07,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:24:07,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 04:24:07,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 04:24:07,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 04:24:07,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 04:24:07,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 04:24:07,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 04:24:07,117 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 04:24:07,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 04:24:07,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 04:24:07,128 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 04:24:07,129 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 04:24:07,129 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 04:24:07,130 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 04:24:07,130 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 04:24:07,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0) = -2*ULTIMATE.start_main_~#in~0.offset - 2*ULTIMATE.start_main_~idx_in~0 + 19 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 + 11 >= 0] [2018-12-02 04:24:07,134 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-12-02 04:24:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:24:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:24:07,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:24:07,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 04:24:07,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 04:24:07,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 04:24:07,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-12-02 04:24:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:24:07,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:24:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:24:07,191 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-12-02 04:24:07,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-12-02 04:24:07,207 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 28 states and 29 transitions. Complement of second has 3 states. [2018-12-02 04:24:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-02 04:24:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 04:24:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 04:24:07,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2018-12-02 04:24:07,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:24:07,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2018-12-02 04:24:07,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:24:07,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2018-12-02 04:24:07,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 04:24:07,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-12-02 04:24:07,209 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:24:07,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-12-02 04:24:07,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 04:24:07,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 04:24:07,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 04:24:07,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 04:24:07,209 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:24:07,209 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:24:07,209 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:24:07,209 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 04:24:07,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:24:07,210 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 04:24:07,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 04:24:07,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 04:24:07 BoogieIcfgContainer [2018-12-02 04:24:07,214 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 04:24:07,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:24:07,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:24:07,215 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:24:07,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:23:57" (3/4) ... [2018-12-02 04:24:07,217 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:24:07,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:24:07,218 INFO L168 Benchmark]: Toolchain (without parser) took 10330.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 957.1 MB in the beginning and 805.6 MB in the end (delta: 151.4 MB). Peak memory consumption was 356.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,218 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:24:07,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.72 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,219 INFO L168 Benchmark]: Boogie Preprocessor took 44.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,219 INFO L168 Benchmark]: RCFGBuilder took 143.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,220 INFO L168 Benchmark]: BuchiAutomizer took 9985.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 805.6 MB in the end (delta: 292.0 MB). Peak memory consumption was 379.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:24:07,220 INFO L168 Benchmark]: Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 805.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:24:07,222 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 19.72 ms. Allocated memory is still 1.0 GB. Free memory was 946.3 MB in the beginning and 941.0 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9985.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 805.6 MB in the end (delta: 292.0 MB). Peak memory consumption was 379.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 ms. Allocated memory is still 1.2 GB. Free memory is still 805.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function -2 * in + -2 * idx_in + 19 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 9.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 77 SDslu, 58 SDs, 0 SdLazy, 300 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf100 lsp94 ukn54 mio100 lsp60 div158 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...