./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/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 64bit --witnessprinter.graph.data.programhash e9d8db831e66fcf4f47c300fcbd3a74f1185238a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:44:42,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:44:42,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:44:42,046 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:44:42,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:44:42,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:44:42,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:44:42,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:44:42,050 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:44:42,051 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:44:42,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:44:42,052 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:44:42,052 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:44:42,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:44:42,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:44:42,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:44:42,055 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:44:42,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:44:42,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:44:42,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:44:42,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:44:42,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:44:42,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:44:42,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:44:42,062 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:44:42,063 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:44:42,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:44:42,064 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:44:42,065 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:44:42,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:44:42,066 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:44:42,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:44:42,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:44:42,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:44:42,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:44:42,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:44:42,068 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:44:42,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:44:42,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:44:42,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:44:42,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:44:42,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:44:42,077 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:44:42,077 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:44:42,077 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:44:42,077 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:44:42,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:44:42,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:44:42,079 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:44:42,079 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:44:42,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:44:42,080 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:44:42,080 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:44:42,081 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:44:42,081 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_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9d8db831e66fcf4f47c300fcbd3a74f1185238a [2018-11-28 12:44:42,101 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:44:42,110 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:44:42,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:44:42,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:44:42,114 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:44:42,115 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-28 12:44:42,160 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/data/39151c44c/f101a88cb6624a2c88ba810551460ab5/FLAG1a5c60e76 [2018-11-28 12:44:42,572 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:44:42,573 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/sv-benchmarks/c/termination-memory-alloca/KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-28 12:44:42,579 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/data/39151c44c/f101a88cb6624a2c88ba810551460ab5/FLAG1a5c60e76 [2018-11-28 12:44:42,589 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/data/39151c44c/f101a88cb6624a2c88ba810551460ab5 [2018-11-28 12:44:42,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:44:42,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:44:42,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:44:42,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:44:42,597 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:44:42,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42171c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42, skipping insertion in model container [2018-11-28 12:44:42,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:44:42,629 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:44:42,801 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:44:42,848 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:44:42,878 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:44:42,908 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:44:42,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42 WrapperNode [2018-11-28 12:44:42,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:44:42,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:44:42,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:44:42,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:44:42,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:44:42,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:44:42,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:44:42,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:44:42,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... [2018-11-28 12:44:42,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:44:42,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:44:42,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:44:42,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:44:42,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:44:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:44:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:44:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:44:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:44:43,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:44:43,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:44:43,172 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:44:43,172 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 12:44:43,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:43 BoogieIcfgContainer [2018-11-28 12:44:43,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:44:43,173 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:44:43,173 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:44:43,177 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:44:43,177 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:44:43,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:44:42" (1/3) ... [2018-11-28 12:44:43,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f86f60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:44:43, skipping insertion in model container [2018-11-28 12:44:43,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:44:43,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:44:42" (2/3) ... [2018-11-28 12:44:43,179 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f86f60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:44:43, skipping insertion in model container [2018-11-28 12:44:43,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:44:43,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:43" (3/3) ... [2018-11-28 12:44:43,181 INFO L375 chiAutomizerObserver]: Analyzing ICFG KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i [2018-11-28 12:44:43,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:44:43,224 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:44:43,224 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:44:43,224 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:44:43,224 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:44:43,224 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:44:43,224 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:44:43,224 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:44:43,225 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:44:43,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 12:44:43,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:43,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:44:43,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:44:43,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:44:43,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:43,254 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:44:43,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 12:44:43,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:43,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:44:43,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:44:43,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:44:43,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:43,261 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 10#L558-2true [2018-11-28 12:44:43,261 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 8#L552-1true assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 4#L553true assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 9#L553-2true call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 5#L558true assume 0 != main_#t~mem10;havoc main_#t~mem10;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 10#L558-2true [2018-11-28 12:44:43,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,265 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 12:44:43,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:43,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 35468238, now seen corresponding path program 1 times [2018-11-28 12:44:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:43,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907724, now seen corresponding path program 1 times [2018-11-28 12:44:43,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:43,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:44:43,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:44:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:44:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:44:43,648 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 5 states. [2018-11-28 12:44:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:43,680 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-28 12:44:43,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 12:44:43,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-28 12:44:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:43,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-11-28 12:44:43,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 12:44:43,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:44:43,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 12:44:43,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:44:43,687 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:44:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 12:44:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 12:44:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:44:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 12:44:43,705 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:44:43,705 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:44:43,705 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:44:43,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 12:44:43,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:43,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:44:43,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:44:43,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:44:43,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:43,706 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 37#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 38#L558-2 [2018-11-28 12:44:43,706 INFO L796 eck$LassoCheckResult]: Loop: 38#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 43#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 39#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 40#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 41#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 38#L558-2 [2018-11-28 12:44:43,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 12:44:43,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:43,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash 35468240, now seen corresponding path program 1 times [2018-11-28 12:44:43,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:43,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907726, now seen corresponding path program 1 times [2018-11-28 12:44:43,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:43,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:43,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:43,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,012 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:44:44,013 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:44:44,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:44:44,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:44:44,013 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:44:44,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:44:44,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:44:44,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:44:44,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 12:44:44,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:44:44,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:44:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:44,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:44:44,477 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:44:44,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:44,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:44,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:44,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:44,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:44,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:44,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:44,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:44,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:44,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:44,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:44,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:44,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,489 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:44:44,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,491 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:44:44,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:44:44,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,517 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:44:44,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,557 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:44,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:44,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:44,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:44,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:44,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:44,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:44,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:44,570 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:44:44,574 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:44:44,574 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:44:44,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:44:44,577 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:44:44,578 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:44:44,578 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2018-11-28 12:44:44,604 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 12:44:44,611 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:44:44,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:44,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:44,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:44,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:44,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-28 12:44:44,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:44,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-11-28 12:44:44,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:44,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:44,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:44,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:17 [2018-11-28 12:44:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:44,712 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 12:44:44,713 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-28 12:44:44,742 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 18 states and 21 transitions. Complement of second has 9 states. [2018-11-28 12:44:44,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:44:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:44:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-28 12:44:44,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-28 12:44:44,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:44,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 12:44:44,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:44,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-28 12:44:44,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:44,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-28 12:44:44,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:44,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-28 12:44:44,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 12:44:44,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 12:44:44,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-28 12:44:44,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:44:44,747 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-28 12:44:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-28 12:44:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 12:44:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 12:44:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-28 12:44:44,749 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 12:44:44,749 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-28 12:44:44,749 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:44:44,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-28 12:44:44,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:44,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:44:44,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:44:44,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:44,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:44,751 INFO L794 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 157#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 167#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 158#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 159#L553-2 [2018-11-28 12:44:44,751 INFO L796 eck$LassoCheckResult]: Loop: 159#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 169#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 172#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 171#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 170#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 159#L553-2 [2018-11-28 12:44:44,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:44,751 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2018-11-28 12:44:44,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:44,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 2 times [2018-11-28 12:44:44,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:44,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:44,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash 705693312, now seen corresponding path program 1 times [2018-11-28 12:44:44,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:44,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:44:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:45,055 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-11-28 12:44:45,201 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-11-28 12:44:45,203 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:44:45,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:44:45,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:44:45,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:44:45,203 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:44:45,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:44:45,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:44:45,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:44:45,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: KroeningSharyginaTsitovichWintersteiger-2010CAV-Fig1-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 12:44:45,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:44:45,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:44:45,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:44:45,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:44:45,575 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:44:45,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:44:45,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:44:45,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:44:45,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,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-11-28 12:44:45,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,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-11-28 12:44:45,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,620 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:44:45,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,621 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:44:45,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,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-11-28 12:44:45,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:44:45,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,633 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:44:45,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:44:45,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:44:45,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:44:45,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:44:45,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:44:45,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:44:45,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:44:45,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:44:45,646 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:44:45,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:44:45,650 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:44:45,650 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:44:45,651 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:44:45,651 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:44:45,651 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2018-11-28 12:44:45,692 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 12:44:45,693 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:44:45,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:45,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:45,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:45,753 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:44:45,753 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 12:44:45,781 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 27 states and 32 transitions. Complement of second has 9 states. [2018-11-28 12:44:45,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:44:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:44:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 12:44:45,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-28 12:44:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:45,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-28 12:44:45,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:45,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 12:44:45,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:44:45,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-28 12:44:45,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:45,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 12:44:45,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 12:44:45,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 12:44:45,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-28 12:44:45,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:44:45,786 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 12:44:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-28 12:44:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 12:44:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 12:44:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-28 12:44:45,788 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 12:44:45,788 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-28 12:44:45,788 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:44:45,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-28 12:44:45,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:44:45,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:44:45,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:44:45,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-28 12:44:45,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:44:45,794 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet4, main_#t~mem6, main_#t~mem7, main_#t~post8, main_#t~mem9, main_#t~mem10, main_#t~mem5, main_~x~0.base, main_~x~0.offset, main_~debug~0.base, main_~debug~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~debug~0.base, main_~debug~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(main_#t~nondet4, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet4;call write~int(0, main_~debug~0.base, main_~debug~0.offset, 4); 303#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 320#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 321#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 319#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 318#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 324#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 322#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 304#L553 assume 0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2);havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~post8 := main_#t~mem7;call write~int(main_#t~post8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem7;havoc main_#t~post8; 305#L553-2 [2018-11-28 12:44:45,794 INFO L796 eck$LassoCheckResult]: Loop: 305#L553-2 call main_#t~mem10 := read~int(main_~debug~0.base, main_~debug~0.offset, 4); 308#L558 assume !(0 != main_#t~mem10);havoc main_#t~mem10; 309#L558-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); 313#L552-1 assume !!(main_#t~mem5 < 255);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4); 314#L553 assume !(0 != (if main_#t~mem6 < 0 && 0 != main_#t~mem6 % 2 then main_#t~mem6 % 2 - 2 else main_#t~mem6 % 2));havoc main_#t~mem6;call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(2 + main_#t~mem9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem9; 305#L553-2 [2018-11-28 12:44:45,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash 705693310, now seen corresponding path program 1 times [2018-11-28 12:44:45,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:45,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:44:45,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2c4e169-e651-488f-9bf1-7d5b0e6e7fcc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:44:45,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:44:45,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:44:45,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:45,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-28 12:44:45,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:45,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-11-28 12:44:45,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:46,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-28 12:44:46,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:44:46,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-28 12:44:46,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:12 [2018-11-28 12:44:46,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-28 12:44:46,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 21 treesize of output 11 [2018-11-28 12:44:46,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:44:46,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:11 [2018-11-28 12:44:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:44:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:44:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-11-28 12:44:46,119 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:44:46,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:44:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 46898150, now seen corresponding path program 3 times [2018-11-28 12:44:46,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:44:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:44:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:44:46,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:44:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:44:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:44:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:44:46,221 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-28 12:44:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:44:46,261 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-28 12:44:46,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:44:46,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-28 12:44:46,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:44:46,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 12:44:46,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:44:46,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:44:46,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:44:46,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:44:46,263 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:44:46,263 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:44:46,263 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:44:46,263 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:44:46,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:44:46,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:44:46,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:44:46,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:44:46 BoogieIcfgContainer [2018-11-28 12:44:46,269 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:44:46,269 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:44:46,269 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:44:46,269 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:44:46,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:44:43" (3/4) ... [2018-11-28 12:44:46,272 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:44:46,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:44:46,275 INFO L168 Benchmark]: Toolchain (without parser) took 3682.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 950.6 MB in the beginning and 962.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 230.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:46,275 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:46,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:46,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:46,277 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:46,277 INFO L168 Benchmark]: RCFGBuilder took 208.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:46,277 INFO L168 Benchmark]: BuchiAutomizer took 3095.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:44:46,278 INFO L168 Benchmark]: Witness Printer took 3.01 ms. Allocated memory is still 1.3 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:44:46,280 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -196.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3095.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 962.0 MB in the end (delta: 162.4 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.01 ms. Allocated memory is still 1.3 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 21 SDslu, 21 SDs, 0 SdLazy, 73 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital245 mio100 ax107 hnf100 lsp89 ukn57 mio100 lsp39 div162 bol100 ite100 ukn100 eq151 hnf70 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 2 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...