./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/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 f5878942b695ddbfe46daa43f5d95028455ef120 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:23:14,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:23:14,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:23:14,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:23:14,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:23:14,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:23:14,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:23:14,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:23:14,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:23:14,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:23:14,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:23:14,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:23:14,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:23:14,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:23:14,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:23:14,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:23:14,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:23:14,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:23:14,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:23:14,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:23:14,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:23:14,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:23:14,830 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:23:14,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:23:14,830 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:23:14,831 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:23:14,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:23:14,832 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:23:14,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:23:14,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:23:14,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:23:14,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:23:14,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:23:14,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:23:14,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:23:14,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:23:14,835 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:23:14,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:23:14,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:23:14,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:23:14,844 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:23:14,844 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:23:14,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:23:14,845 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:23:14,845 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:23:14,845 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:23:14,845 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:23:14,845 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:23:14,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:23:14,846 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:23:14,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:23:14,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:23:14,847 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:23:14,848 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:23:14,848 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_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-12-08 09:23:14,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:23:14,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:23:14,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:23:14,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:23:14,875 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:23:14,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:23:14,909 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/data/7c3a4383c/d75c885a085e4852a19d3d77940b7a45/FLAGf68cbeec2 [2018-12-08 09:23:15,410 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:23:15,410 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:23:15,416 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/data/7c3a4383c/d75c885a085e4852a19d3d77940b7a45/FLAGf68cbeec2 [2018-12-08 09:23:15,896 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/data/7c3a4383c/d75c885a085e4852a19d3d77940b7a45 [2018-12-08 09:23:15,898 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:23:15,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:23:15,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:23:15,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:23:15,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:23:15,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:23:15" (1/1) ... [2018-12-08 09:23:15,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8ed641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:15, skipping insertion in model container [2018-12-08 09:23:15,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:23:15" (1/1) ... [2018-12-08 09:23:15,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:23:15,929 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:23:16,066 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:23:16,073 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:23:16,127 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:23:16,146 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:23:16,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16 WrapperNode [2018-12-08 09:23:16,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:23:16,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:23:16,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:23:16,147 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:23:16,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,159 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:23:16,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:23:16,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:23:16,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:23:16,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... [2018-12-08 09:23:16,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:23:16,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:23:16,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:23:16,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:23:16,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:23:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:23:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:23:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:23:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:23:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:23:16,335 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:23:16,335 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:23:16,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:16 BoogieIcfgContainer [2018-12-08 09:23:16,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:23:16,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:23:16,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:23:16,338 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:23:16,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:23:16,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:23:15" (1/3) ... [2018-12-08 09:23:16,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5093d69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:23:16, skipping insertion in model container [2018-12-08 09:23:16,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:23:16,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:23:16" (2/3) ... [2018-12-08 09:23:16,340 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5093d69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:23:16, skipping insertion in model container [2018-12-08 09:23:16,340 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:23:16,340 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:16" (3/3) ... [2018-12-08 09:23:16,341 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:23:16,373 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:23:16,374 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:23:16,374 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:23:16,374 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:23:16,374 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:23:16,374 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:23:16,374 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:23:16,374 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:23:16,374 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:23:16,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:23:16,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 09:23:16,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:16,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:16,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:23:16,402 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:23:16,402 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:23:16,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-08 09:23:16,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 09:23:16,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:16,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:16,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:23:16,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:23:16,408 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L555-3true [2018-12-08 09:23:16,408 INFO L796 eck$LassoCheckResult]: Loop: 6#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 13#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L557-3true assume !true; 4#L557-4true call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 6#L555-3true [2018-12-08 09:23:16,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,412 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 09:23:16,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-08 09:23:16,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:16,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:16,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 09:23:16,523 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:23:16,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 09:23:16,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 09:23:16,533 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-08 09:23:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:16,537 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-08 09:23:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 09:23:16,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-08 09:23:16,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 09:23:16,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-12-08 09:23:16,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-08 09:23:16,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-08 09:23:16,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-08 09:23:16,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:23:16,543 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-08 09:23:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-08 09:23:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-08 09:23:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 09:23:16,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-08 09:23:16,559 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-08 09:23:16,559 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-08 09:23:16,559 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:23:16,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-08 09:23:16,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-08 09:23:16,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:16,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:16,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:23:16,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-08 09:23:16,560 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-12-08 09:23:16,561 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 36#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 38#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 34#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 33#L555-3 [2018-12-08 09:23:16,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,561 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 09:23:16,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-08 09:23:16,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:16,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-12-08 09:23:16,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:16,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:23:16,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:23:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:23:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:23:16,745 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-12-08 09:23:16,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:16,781 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-08 09:23:16,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:23:16,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-08 09:23:16,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:23:16,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-12-08 09:23:16,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:23:16,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 09:23:16,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-12-08 09:23:16,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:23:16,783 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-08 09:23:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-12-08 09:23:16,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-08 09:23:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 09:23:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-08 09:23:16,783 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-08 09:23:16,783 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-08 09:23:16,784 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:23:16,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-08 09:23:16,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:23:16,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:16,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:16,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:23:16,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-08 09:23:16,784 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 61#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 62#L555-3 [2018-12-08 09:23:16,784 INFO L796 eck$LassoCheckResult]: Loop: 62#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 65#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 68#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 66#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 67#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 69#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 63#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 62#L555-3 [2018-12-08 09:23:16,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-08 09:23:16,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-12-08 09:23:16,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:16,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 1 times [2018-12-08 09:23:16,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:16,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:16,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:17,088 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-12-08 09:23:17,160 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:23:17,161 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:23:17,161 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:23:17,161 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:23:17,161 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:23:17,161 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:17,162 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:23:17,162 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:23:17,162 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-08 09:23:17,162 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:23:17,162 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:23:17,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,360 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-08 09:23:17,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:17,698 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:23:17,701 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:23:17,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:17,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:17,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:17,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:17,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:17,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:17,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:17,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:17,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:17,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:17,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:17,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:17,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,730 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,732 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:23:17,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,734 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:23:17,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,740 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:23:17,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,741 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:23:17,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:17,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:17,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:17,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:17,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:17,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:17,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:17,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:17,766 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:23:17,769 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:23:17,769 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:23:17,771 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:23:17,772 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:23:17,772 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:23:17,772 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-12-08 09:23:17,808 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-08 09:23:17,811 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:23:17,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:17,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:17,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:17,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-12-08 09:23:17,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-12-08 09:23:17,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:17,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,918 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-12-08 09:23:17,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 09:23:17,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:17,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:17,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-12-08 09:23:17,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,958 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 37 [2018-12-08 09:23:17,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,961 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:17,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:17,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:17,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 55 [2018-12-08 09:23:17,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:17,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:18,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-08 09:23:18,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:18,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:18,024 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-08 09:23:18,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:18,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:18,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:18,054 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:74, output treesize:22 [2018-12-08 09:23:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:18,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-08 09:23:18,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-12-08 09:23:18,203 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 10 transitions. cyclomatic complexity: 2. Second operand 7 states. Result 23 states and 26 transitions. Complement of second has 13 states. [2018-12-08 09:23:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 09:23:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-08 09:23:18,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2018-12-08 09:23:18,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:18,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2018-12-08 09:23:18,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:18,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2018-12-08 09:23:18,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:18,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2018-12-08 09:23:18,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:23:18,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 25 transitions. [2018-12-08 09:23:18,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-08 09:23:18,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 09:23:18,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-12-08 09:23:18,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:23:18,207 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-08 09:23:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-12-08 09:23:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-08 09:23:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-08 09:23:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-08 09:23:18,208 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 09:23:18,208 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-08 09:23:18,208 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:23:18,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-08 09:23:18,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:23:18,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:18,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:18,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:23:18,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-08 09:23:18,209 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 239#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 240#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 248#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 258#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 249#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 250#L557-3 [2018-12-08 09:23:18,209 INFO L796 eck$LassoCheckResult]: Loop: 250#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 253#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 256#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 255#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 241#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 242#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 246#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 250#L557-3 [2018-12-08 09:23:18,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-12-08 09:23:18,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:18,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 2 times [2018-12-08 09:23:18,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:18,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:18,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:18,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -425323062, now seen corresponding path program 2 times [2018-12-08 09:23:18,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:18,620 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-12-08 09:23:18,706 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:23:18,706 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:23:18,706 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:23:18,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:23:18,706 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:23:18,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:18,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:23:18,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:23:18,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-12-08 09:23:18,707 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:23:18,707 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:23:18,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:18,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:19,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:23:19,222 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:23:19,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:19,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:19,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:19,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:19,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:19,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:19,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:19,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:19,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:19,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:19,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:19,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:19,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:19,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:19,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:19,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:19,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:19,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:19,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:19,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:19,263 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:23:19,274 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 09:23:19,274 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 09:23:19,274 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:23:19,275 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:23:19,275 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:23:19,275 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-08 09:23:19,337 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-08 09:23:19,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:23:19,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:19,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:19,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:19,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-08 09:23:19,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,404 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 45 treesize of output 36 [2018-12-08 09:23:19,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-12-08 09:23:19,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:19,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:19,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:50 [2018-12-08 09:23:19,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-12-08 09:23:19,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,508 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-12-08 09:23:19,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-08 09:23:19,541 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 09:23:19,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:19,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 54 [2018-12-08 09:23:19,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:19,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:19,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:61 [2018-12-08 09:23:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:19,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-08 09:23:19,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2018-12-08 09:23:19,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 8 states. Result 51 states and 58 transitions. Complement of second has 17 states. [2018-12-08 09:23:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 09:23:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-12-08 09:23:19,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 7 letters. [2018-12-08 09:23:19,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:19,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-08 09:23:19,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:19,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 6 letters. Loop has 14 letters. [2018-12-08 09:23:19,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:19,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 58 transitions. [2018-12-08 09:23:19,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 09:23:19,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 43 states and 50 transitions. [2018-12-08 09:23:19,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-08 09:23:19,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-08 09:23:19,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2018-12-08 09:23:19,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:23:19,719 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-08 09:23:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2018-12-08 09:23:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2018-12-08 09:23:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 09:23:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-08 09:23:19,720 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-08 09:23:19,721 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-08 09:23:19,721 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 09:23:19,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2018-12-08 09:23:19,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 09:23:19,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:19,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:19,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-08 09:23:19,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:23:19,721 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 486#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 487#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 494#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 500#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 518#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 516#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-12-08 09:23:19,722 INFO L796 eck$LassoCheckResult]: Loop: 496#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 497#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 496#L557-1 [2018-12-08 09:23:19,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907812, now seen corresponding path program 2 times [2018-12-08 09:23:19,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:19,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 1 times [2018-12-08 09:23:19,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:19,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:19,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620447, now seen corresponding path program 3 times [2018-12-08 09:23:19,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:19,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:20,094 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 115 [2018-12-08 09:23:20,193 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:23:20,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:23:20,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:23:20,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:23:20,194 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:23:20,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:20,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:23:20,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:23:20,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-08 09:23:20,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:23:20,194 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:23:20,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,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-12-08 09:23:20,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,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-12-08 09:23:20,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:20,681 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:23:20,681 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:23:20,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:20,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:20,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:20,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:20,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:20,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:20,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:20,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:20,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:20,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:23:20,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:23:20,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:23:20,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:20,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:20,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:20,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:20,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:20,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:20,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:20,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:20,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:20,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:20,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:20,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:20,712 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:23:20,727 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 09:23:20,727 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:23:20,727 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:23:20,728 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-08 09:23:20,728 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:23:20,728 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem7, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*ULTIMATE.start_test_fun_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0] [2018-12-08 09:23:20,791 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-12-08 09:23:20,795 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:23:20,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:20,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:20,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:20,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:20,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:20,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:20,841 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 38 treesize of output 29 [2018-12-08 09:23:20,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:20,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:20,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:20,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:20,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 09:23:20,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:20,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-12-08 09:23:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:20,911 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 09:23:20,911 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-08 09:23:20,937 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 48 states and 56 transitions. Complement of second has 5 states. [2018-12-08 09:23:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:23:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-08 09:23:20,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-08 09:23:20,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:20,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-08 09:23:20,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:20,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-08 09:23:20,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:20,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2018-12-08 09:23:20,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 09:23:20,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 42 states and 48 transitions. [2018-12-08 09:23:20,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-08 09:23:20,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-12-08 09:23:20,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2018-12-08 09:23:20,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:23:20,940 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-08 09:23:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2018-12-08 09:23:20,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-12-08 09:23:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-08 09:23:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-08 09:23:20,943 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-08 09:23:20,943 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-08 09:23:20,943 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 09:23:20,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-12-08 09:23:20,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-08 09:23:20,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:20,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:20,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-12-08 09:23:20,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-08 09:23:20,944 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 721#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 727#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 735#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 751#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 749#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 746#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 745#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 744#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 743#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 742#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 740#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 739#L557-3 [2018-12-08 09:23:20,945 INFO L796 eck$LassoCheckResult]: Loop: 739#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 738#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 737#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 736#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 722#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 723#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 741#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 739#L557-3 [2018-12-08 09:23:20,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:20,945 INFO L82 PathProgramCache]: Analyzing trace with hash -474670092, now seen corresponding path program 3 times [2018-12-08 09:23:20,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:20,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:20,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:20,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:21,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:23:21,033 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ef60f9cb-8c06-4567-a7cc-adf24f7d1cf1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:23:21,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 09:23:21,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 09:23:21,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:23:21,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:21,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 09:23:21,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:23:21,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 09:23:21,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,082 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 25 treesize of output 28 [2018-12-08 09:23:21,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,085 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:21,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-08 09:23:21,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2018-12-08 09:23:21,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,135 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 43 treesize of output 34 [2018-12-08 09:23:21,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:21,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 47 [2018-12-08 09:23:21,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:21,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:23:21,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:23:21,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:29 [2018-12-08 09:23:21,212 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 15 treesize of output 11 [2018-12-08 09:23:21,213 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 11 treesize of output 3 [2018-12-08 09:23:21,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:21,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:44, output treesize:3 [2018-12-08 09:23:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:21,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:23:21,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-12-08 09:23:21,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 09:23:21,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:21,237 INFO L82 PathProgramCache]: Analyzing trace with hash 296665942, now seen corresponding path program 3 times [2018-12-08 09:23:21,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:21,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:21,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:21,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 09:23:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-08 09:23:21,346 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-08 09:23:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:21,460 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-08 09:23:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:23:21,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2018-12-08 09:23:21,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:23:21,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 22 states and 24 transitions. [2018-12-08 09:23:21,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 09:23:21,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 09:23:21,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2018-12-08 09:23:21,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:23:21,462 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-08 09:23:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2018-12-08 09:23:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-08 09:23:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-08 09:23:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-08 09:23:21,463 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-08 09:23:21,463 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-08 09:23:21,463 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 09:23:21,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-08 09:23:21,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:23:21,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:21,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:21,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 1, 1, 1, 1] [2018-12-08 09:23:21,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:23:21,463 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 850#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 854#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 860#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 865#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 859#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 862#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 864#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 863#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 851#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 852#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 855#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 861#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-12-08 09:23:21,463 INFO L796 eck$LassoCheckResult]: Loop: 856#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 857#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 856#L557-1 [2018-12-08 09:23:21,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash -300113017, now seen corresponding path program 4 times [2018-12-08 09:23:21,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:21,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 2 times [2018-12-08 09:23:21,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:21,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -645799806, now seen corresponding path program 5 times [2018-12-08 09:23:21,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:22,828 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 168 DAG size of output: 150 [2018-12-08 09:23:23,032 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-12-08 09:23:23,034 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:23:23,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:23:23,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:23:23,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:23:23,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:23:23,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:23,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:23:23,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:23:23,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-12-08 09:23:23,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:23:23,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:23:23,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:23,535 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:23:23,535 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:23:23,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:23,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:23,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:23,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:23,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:23,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:23,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:23,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:23,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:23,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:23,537 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:23:23,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:23,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:23,538 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:23:23,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:23,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:23,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:23,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:23,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:23,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:23,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:23,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:23,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:23,548 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:23:23,557 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 09:23:23,557 INFO L444 ModelExtractionUtils]: 15 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 09:23:23,557 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:23:23,558 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-08 09:23:23,558 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:23:23,558 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7) = -1*ULTIMATE.start_test_fun_#t~mem6 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 1 >= 0] [2018-12-08 09:23:23,616 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 09:23:23,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:23,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:23,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 09:23:23,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 09:23:23,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 09:23:23,686 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 11 treesize of output 8 [2018-12-08 09:23:23,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:23:23,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-08 09:23:23,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:23,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:23,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:23,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:23,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:23,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:23,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 09:23:23,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,778 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 32 treesize of output 23 [2018-12-08 09:23:23,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-08 09:23:23,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-08 09:23:23,803 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-08 09:23:23,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-08 09:23:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:23,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:23,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:23,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,839 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 38 treesize of output 29 [2018-12-08 09:23:23,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:23,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:23,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-12-08 09:23:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:23,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-08 09:23:23,880 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-12-08 09:23:23,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-12-08 09:23:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 09:23:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-08 09:23:23,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-08 09:23:23,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:23,902 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:23:23,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:23,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:23,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 09:23:23,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 09:23:23,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 09:23:23,968 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 11 treesize of output 8 [2018-12-08 09:23:23,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:23:23,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-08 09:23:23,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:23,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,984 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:23,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:23,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:23,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:23,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:24,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,001 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:24,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:24,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 09:23:24,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,046 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 32 treesize of output 23 [2018-12-08 09:23:24,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-08 09:23:24,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-08 09:23:24,087 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-08 09:23:24,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-08 09:23:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:24,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:24,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:24,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-12-08 09:23:24,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:24,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,150 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 24 treesize of output 25 [2018-12-08 09:23:24,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-12-08 09:23:24,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:24,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-08 09:23:24,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-12-08 09:23:24,191 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 18 states and 20 transitions. Complement of second has 5 states. [2018-12-08 09:23:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 09:23:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2018-12-08 09:23:24,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-08 09:23:24,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:24,192 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:23:24,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:24,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:24,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-12-08 09:23:24,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 09:23:24,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 09:23:24,246 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 11 treesize of output 8 [2018-12-08 09:23:24,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:23:24,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-08 09:23:24,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:24,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:24,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:24,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:23:24,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,283 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:23:24,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:13 [2018-12-08 09:23:24,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 09:23:24,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,327 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 32 treesize of output 23 [2018-12-08 09:23:24,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-12-08 09:23:24,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-08 09:23:24,352 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-08 09:23:24,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:20 [2018-12-08 09:23:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:24,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:24,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:24,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,391 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 38 treesize of output 29 [2018-12-08 09:23:24,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:24,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:24,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:24,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:24,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-12-08 09:23:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:24,430 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 2 loop predicates [2018-12-08 09:23:24,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-12-08 09:23:24,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 4. Second operand 11 states. Result 49 states and 57 transitions. Complement of second has 22 states. [2018-12-08 09:23:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 9 stem states 1 non-accepting loop states 2 accepting loop states [2018-12-08 09:23:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-08 09:23:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2018-12-08 09:23:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 2 letters. [2018-12-08 09:23:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-08 09:23:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-08 09:23:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:24,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-12-08 09:23:24,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:23:24,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 36 states and 41 transitions. [2018-12-08 09:23:24,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-08 09:23:24,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-08 09:23:24,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2018-12-08 09:23:24,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:23:24,522 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-08 09:23:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2018-12-08 09:23:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2018-12-08 09:23:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-08 09:23:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-08 09:23:24,523 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 09:23:24,523 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-08 09:23:24,523 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 09:23:24,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2018-12-08 09:23:24,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-08 09:23:24,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:23:24,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:23:24,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 1, 1, 1, 1] [2018-12-08 09:23:24,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 09:23:24,524 INFO L794 eck$LassoCheckResult]: Stem: 1292#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1288#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 1289#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1293#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1302#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1295#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1296#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1304#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1305#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1310#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1300#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1301#L557-1 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1290#L557-4 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 1291#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1294#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1303#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-12-08 09:23:24,524 INFO L796 eck$LassoCheckResult]: Loop: 1299#L557-1 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem8, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem8; 1298#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1299#L557-1 [2018-12-08 09:23:24,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash 883958124, now seen corresponding path program 6 times [2018-12-08 09:23:24,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:24,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:24,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:24,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1660, now seen corresponding path program 3 times [2018-12-08 09:23:24,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:24,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:24,550 INFO L82 PathProgramCache]: Analyzing trace with hash -919766745, now seen corresponding path program 7 times [2018-12-08 09:23:24,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:23:24,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:23:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:23:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:23:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:23:26,225 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 182 DAG size of output: 163 [2018-12-08 09:23:26,373 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-08 09:23:26,376 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:23:26,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:23:26,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:23:26,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:23:26,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:23:26,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:23:26,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:23:26,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:23:26,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-08 09:23:26,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:23:26,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:23:26,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:23:26,825 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:23:26,825 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:23:26,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:26,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:26,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:26,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:26,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:23:26,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:23:26,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:23:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:23:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:23:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:23:26,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:23:26,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:23:26,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:23:26,859 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 09:23:26,860 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:23:26,860 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:23:26,861 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-08 09:23:26,861 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:23:26,861 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5, ULTIMATE.start_test_fun_#t~mem7) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem7 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 1*ULTIMATE.start_test_fun_#t~mem6 >= 0] [2018-12-08 09:23:26,913 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2018-12-08 09:23:26,917 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:23:26,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:26,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:26,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:26,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:26,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:26,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:26,963 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 38 treesize of output 29 [2018-12-08 09:23:26,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:26,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:26,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:26,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:26,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 09:23:27,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:27,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-12-08 09:23:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:27,012 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 09:23:27,012 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 09:23:27,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-12-08 09:23:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:23:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-08 09:23:27,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-08 09:23:27,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:27,032 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:23:27,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:27,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:27,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:27,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:27,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,079 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 38 treesize of output 29 [2018-12-08 09:23:27,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:27,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:27,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:27,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 09:23:27,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:27,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-12-08 09:23:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:27,129 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 09:23:27,129 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 09:23:27,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 34 states and 40 transitions. Complement of second has 5 states. [2018-12-08 09:23:27,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:23:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-08 09:23:27,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-08 09:23:27,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:27,148 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:23:27,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:27,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:27,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:27,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-12-08 09:23:27,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,201 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 38 treesize of output 29 [2018-12-08 09:23:27,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:27,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:23:27,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2018-12-08 09:23:27,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 09:23:27,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 09:23:27,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:27,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-12-08 09:23:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:23:27,256 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-08 09:23:27,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-08 09:23:27,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 26 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 39 states and 47 transitions. Complement of second has 4 states. [2018-12-08 09:23:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-08 09:23:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 09:23:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-12-08 09:23:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 2 letters. [2018-12-08 09:23:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 18 letters. Loop has 2 letters. [2018-12-08 09:23:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:27,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 16 letters. Loop has 4 letters. [2018-12-08 09:23:27,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:23:27,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-12-08 09:23:27,277 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:23:27,277 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-12-08 09:23:27,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:23:27,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:23:27,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:23:27,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:23:27,277 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:23:27,277 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:23:27,277 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:23:27,277 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 09:23:27,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:23:27,278 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:23:27,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:23:27,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:23:27 BoogieIcfgContainer [2018-12-08 09:23:27,282 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:23:27,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:23:27,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:23:27,282 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:23:27,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:23:16" (3/4) ... [2018-12-08 09:23:27,284 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:23:27,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:23:27,285 INFO L168 Benchmark]: Toolchain (without parser) took 11386.63 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 957.1 MB in the beginning and 798.1 MB in the end (delta: 158.9 MB). Peak memory consumption was 541.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:23:27,285 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:23:27,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:23:27,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.46 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-12-08 09:23:27,286 INFO L168 Benchmark]: Boogie Preprocessor took 14.22 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-12-08 09:23:27,286 INFO L168 Benchmark]: RCFGBuilder took 149.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:23:27,286 INFO L168 Benchmark]: BuchiAutomizer took 10945.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 798.1 MB in the end (delta: 285.9 MB). Peak memory consumption was 541.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:23:27,286 INFO L168 Benchmark]: Witness Printer took 2.80 ms. Allocated memory is still 1.4 GB. Free memory is still 798.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:23:27,287 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.46 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. * Boogie Preprocessor took 14.22 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 149.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10945.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.9 MB). Free memory was 1.1 GB in the beginning and 798.1 MB in the end (delta: 285.9 MB). Peak memory consumption was 541.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.80 ms. Allocated memory is still 1.4 GB. Free memory is still 798.1 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 - 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 8 terminating modules (3 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 9 locations. One deterministic module has affine ranking function aux-x_ref-aux + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 3 locations. One nondeterministic module has affine ranking function -1 * aux-y_ref-aux + aux-x_ref-aux and consists of 12 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + aux-x_ref-aux and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.9s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 8.4s. Construction of modules took 0.2s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/4 HoareTripleCheckerStatistics: 57 SDtfs, 70 SDslu, 27 SDs, 0 SdLazy, 337 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital729 mio100 ax103 hnf100 lsp95 ukn33 mio100 lsp36 div100 bol100 ite100 ukn100 eq181 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...