./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-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_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/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 e6c4332f1874752b59e29803328ba77ee4005585 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:07:19,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:07:19,986 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:07:19,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:07:19,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:07:19,993 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:07:19,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:07:19,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:07:19,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:07:19,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:07:19,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:07:19,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:07:19,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:07:19,997 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:07:19,998 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:07:19,998 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:07:19,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:07:19,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:07:20,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:07:20,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:07:20,001 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:07:20,002 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:07:20,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:07:20,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:07:20,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:07:20,004 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:07:20,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:07:20,005 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:07:20,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:07:20,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:07:20,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:07:20,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:07:20,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:07:20,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:07:20,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:07:20,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:07:20,007 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 22:07:20,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:07:20,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:07:20,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:07:20,016 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 22:07:20,016 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 22:07:20,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:07:20,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 22:07:20,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:07:20,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:07:20,018 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 22:07:20,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:07:20,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:07:20,018 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 22:07:20,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 22:07:20,019 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_718dec2c-982e-4cc4-93bf-18d532d42560/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 -> e6c4332f1874752b59e29803328ba77ee4005585 [2018-12-01 22:07:20,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:07:20,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:07:20,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:07:20,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:07:20,045 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:07:20,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-12-01 22:07:20,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/data/ae31c00ce/67dc934a6e354054a5be753ae3fe028b/FLAG3cce984d6 [2018-12-01 22:07:20,424 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:07:20,424 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/sv-benchmarks/c/termination-memory-alloca/a.06-alloca_true-termination_true-no-overflow.c.i [2018-12-01 22:07:20,431 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/data/ae31c00ce/67dc934a6e354054a5be753ae3fe028b/FLAG3cce984d6 [2018-12-01 22:07:20,816 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/bin-2019/uautomizer/data/ae31c00ce/67dc934a6e354054a5be753ae3fe028b [2018-12-01 22:07:20,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:07:20,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:07:20,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:07:20,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:07:20,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:07:20,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:07:20" (1/1) ... [2018-12-01 22:07:20,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725a737b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:20, skipping insertion in model container [2018-12-01 22:07:20,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:07:20" (1/1) ... [2018-12-01 22:07:20,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:07:20,859 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:07:20,999 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:07:21,006 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:07:21,063 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:07:21,088 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:07:21,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21 WrapperNode [2018-12-01 22:07:21,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:07:21,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:07:21,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:07:21,089 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:07:21,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,115 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:07:21,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:07:21,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:07:21,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:07:21,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... [2018-12-01 22:07:21,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:07:21,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:07:21,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:07:21,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:07:21,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_718dec2c-982e-4cc4-93bf-18d532d42560/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-01 22:07:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:07:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 22:07:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:07:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:07:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:07:21,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:07:21,315 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:07:21,315 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 22:07:21,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:07:21 BoogieIcfgContainer [2018-12-01 22:07:21,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:07:21,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 22:07:21,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 22:07:21,320 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 22:07:21,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:07:21,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 10:07:20" (1/3) ... [2018-12-01 22:07:21,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d290a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:07:21, skipping insertion in model container [2018-12-01 22:07:21,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:07:21,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:07:21" (2/3) ... [2018-12-01 22:07:21,321 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41d290a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 10:07:21, skipping insertion in model container [2018-12-01 22:07:21,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 22:07:21,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:07:21" (3/3) ... [2018-12-01 22:07:21,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.06-alloca_true-termination_true-no-overflow.c.i [2018-12-01 22:07:21,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:07:21,352 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 22:07:21,352 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 22:07:21,352 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 22:07:21,352 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:07:21,353 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:07:21,353 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 22:07:21,353 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:07:21,353 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 22:07:21,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-01 22:07:21,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:21,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:21,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:21,377 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 22:07:21,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:21,377 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 22:07:21,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-12-01 22:07:21,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:21,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:21,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:21,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 22:07:21,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:21,383 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4#L557-20true [2018-12-01 22:07:21,383 INFO L796 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2018-12-01 22:07:21,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 22:07:21,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:21,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:21,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:21,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2018-12-01 22:07:21,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:21,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:21,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:21,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:21,516 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-01 22:07:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:07:21,519 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:07:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:07:21,529 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-12-01 22:07:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:21,569 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-12-01 22:07:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:07:21,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-12-01 22:07:21,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-01 22:07:21,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2018-12-01 22:07:21,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-01 22:07:21,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-01 22:07:21,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2018-12-01 22:07:21,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:07:21,576 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-01 22:07:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2018-12-01 22:07:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-01 22:07:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-01 22:07:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2018-12-01 22:07:21,592 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-01 22:07:21,593 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-12-01 22:07:21,593 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 22:07:21,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2018-12-01 22:07:21,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-01 22:07:21,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:21,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:21,593 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 22:07:21,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:21,594 INFO L794 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 61#L557-20 [2018-12-01 22:07:21,594 INFO L796 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2018-12-01 22:07:21,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-01 22:07:21,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2018-12-01 22:07:21,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:21,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:21,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:21,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2018-12-01 22:07:21,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:21,895 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2018-12-01 22:07:22,222 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-12-01 22:07:22,347 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-01 22:07:22,356 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:07:22,356 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:07:22,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:07:22,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:07:22,357 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:07:22,357 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:07:22,357 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:07:22,357 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:07:22,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-01 22:07:22,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:07:22,357 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:07:22,371 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-01 22:07:22,375 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-01 22:07:22,377 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-01 22:07:22,378 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-01 22:07:22,380 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-01 22:07:22,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,384 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-01 22:07:22,386 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-01 22:07:22,387 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-01 22:07:22,389 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-01 22:07:22,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,391 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-01 22:07:22,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,394 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-01 22:07:22,396 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-01 22:07:22,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,399 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-01 22:07:22,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 22:07:22,401 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-01 22:07:22,402 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-01 22:07:22,403 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-01 22:07:22,404 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-01 22:07:22,406 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-01 22:07:22,408 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-01 22:07:22,409 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-01 22:07:22,410 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-01 22:07:22,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-01 22:07:22,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-01 22:07:22,717 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-12-01 22:07:22,802 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-01 22:07:23,170 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:07:23,173 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:07:23,175 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-01 22:07:23,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:07:23,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,181 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-01 22:07:23,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,184 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-01 22:07:23,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,187 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-01 22:07:23,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,189 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-01 22:07:23,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,190 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-01 22:07:23,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,192 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-01 22:07:23,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,196 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-01 22:07:23,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,199 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-01 22:07:23,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,201 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-01 22:07:23,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,204 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-01 22:07:23,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,206 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-01 22:07:23,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,208 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-01 22:07:23,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,211 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-01 22:07:23,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,213 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-01 22:07:23,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,217 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-01 22:07:23,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,220 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-01 22:07:23,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,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-01 22:07:23,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,225 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-01 22:07:23,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,227 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-01 22:07:23,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,232 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-01 22:07:23,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,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-01 22:07:23,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,236 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-01 22:07:23,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,240 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-01 22:07:23,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,243 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-01 22:07:23,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,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-01 22:07:23,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:07:23,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 22:07:23,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 22:07:23,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 22:07:23,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,260 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-01 22:07:23,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,265 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-01 22:07:23,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,273 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-01 22:07:23,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,299 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-01 22:07:23,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,300 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:07:23,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,301 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:07:23,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,306 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-01 22:07:23,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,309 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-01 22:07:23,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,312 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-01 22:07:23,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,313 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:07:23,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 22:07:23,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:23,318 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-01 22:07:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:23,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:23,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:23,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:23,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:23,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:23,339 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:07:23,353 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:07:23,353 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-01 22:07:23,355 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:07:23,356 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 22:07:23,356 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:07:23,357 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-12-01 22:07:23,483 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-12-01 22:07:23,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:07:23,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:23,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:07:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:23,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:07:23,597 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-01 22:07:23,599 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-01 22:07:23,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-01 22:07:23,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 73 states and 101 transitions. Complement of second has 12 states. [2018-12-01 22:07:23,736 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-01 22:07:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:07:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-12-01 22:07:23,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2018-12-01 22:07:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2018-12-01 22:07:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2018-12-01 22:07:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:23,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-12-01 22:07:23,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-01 22:07:23,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2018-12-01 22:07:23,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-01 22:07:23,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-01 22:07:23,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2018-12-01 22:07:23,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:23,742 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 92 transitions. [2018-12-01 22:07:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2018-12-01 22:07:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-12-01 22:07:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-01 22:07:23,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2018-12-01 22:07:23,744 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-12-01 22:07:23,744 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2018-12-01 22:07:23,744 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 22:07:23,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2018-12-01 22:07:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-01 22:07:23,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:23,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:23,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:23,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:23,745 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 409#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 410#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2018-12-01 22:07:23,745 INFO L796 eck$LassoCheckResult]: Loop: 393#L557-1 assume !test_fun_#t~short9; 400#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 407#L557-4 assume test_fun_#t~short14; 423#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 396#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 397#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 403#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 405#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 415#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 418#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 392#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 393#L557-1 [2018-12-01 22:07:23,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-01 22:07:23,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:23,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2018-12-01 22:07:23,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:07:23,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:23,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:07:23,775 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:23,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:07:23,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:07:23,776 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand 4 states. [2018-12-01 22:07:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:23,798 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2018-12-01 22:07:23,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:07:23,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2018-12-01 22:07:23,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-12-01 22:07:23,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2018-12-01 22:07:23,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-01 22:07:23,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-01 22:07:23,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2018-12-01 22:07:23,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:23,801 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-01 22:07:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2018-12-01 22:07:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2018-12-01 22:07:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 22:07:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-12-01 22:07:23,803 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-12-01 22:07:23,803 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-12-01 22:07:23,803 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 22:07:23,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2018-12-01 22:07:23,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:23,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:23,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:23,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:23,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:23,805 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 520#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 521#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2018-12-01 22:07:23,805 INFO L796 eck$LassoCheckResult]: Loop: 506#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 511#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 518#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 522#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 529#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 501#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 502#L557-10 assume !test_fun_#t~short18; 509#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 514#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 516#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 524#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 527#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 505#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 506#L557-1 [2018-12-01 22:07:23,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-01 22:07:23,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,821 INFO L82 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2018-12-01 22:07:23,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:23,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:23,841 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-01 22:07:23,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:23,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:07:23,842 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:07:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:07:23,842 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-01 22:07:23,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:23,870 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-12-01 22:07:23,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:07:23,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2018-12-01 22:07:23,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-01 22:07:23,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2018-12-01 22:07:23,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-01 22:07:23,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-01 22:07:23,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2018-12-01 22:07:23,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:23,872 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 78 transitions. [2018-12-01 22:07:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2018-12-01 22:07:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-12-01 22:07:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 22:07:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-12-01 22:07:23,875 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-12-01 22:07:23,875 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-12-01 22:07:23,875 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 22:07:23,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2018-12-01 22:07:23,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-01 22:07:23,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:23,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:23,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:23,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:23,876 INFO L794 eck$LassoCheckResult]: Stem: 638#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 631#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 632#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2018-12-01 22:07:23,876 INFO L796 eck$LassoCheckResult]: Loop: 612#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 620#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 629#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 633#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 641#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 607#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 608#L557-10 assume !test_fun_#t~short18; 615#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 625#L557-13 assume !test_fun_#t~short20; 626#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 636#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 639#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 611#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 612#L557-1 [2018-12-01 22:07:23,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-12-01 22:07:23,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,894 INFO L82 PathProgramCache]: Analyzing trace with hash 624883089, now seen corresponding path program 1 times [2018-12-01 22:07:23,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:23,913 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-01 22:07:23,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:07:23,914 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:07:23,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:07:23,914 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-12-01 22:07:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:23,933 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-12-01 22:07:23,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:07:23,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 64 transitions. [2018-12-01 22:07:23,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:23,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 39 states and 46 transitions. [2018-12-01 22:07:23,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 22:07:23,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 22:07:23,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-12-01 22:07:23,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:23,934 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-01 22:07:23,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-12-01 22:07:23,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-01 22:07:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 22:07:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-12-01 22:07:23,936 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-01 22:07:23,936 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-01 22:07:23,937 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 22:07:23,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2018-12-01 22:07:23,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:23,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:23,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:23,937 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:23,937 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:23,938 INFO L794 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 734#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 735#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2018-12-01 22:07:23,938 INFO L796 eck$LassoCheckResult]: Loop: 719#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 724#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 732#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 736#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 743#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 714#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 715#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 722#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 727#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 729#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 738#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 741#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 718#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 719#L557-1 [2018-12-01 22:07:23,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2018-12-01 22:07:23,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:23,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:23,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2018-12-01 22:07:23,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:23,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:24,014 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-01 22:07:24,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:24,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:07:24,014 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:07:24,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:07:24,015 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-01 22:07:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:24,136 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-12-01 22:07:24,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 22:07:24,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 98 transitions. [2018-12-01 22:07:24,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-12-01 22:07:24,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 75 states and 82 transitions. [2018-12-01 22:07:24,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-12-01 22:07:24,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-12-01 22:07:24,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 82 transitions. [2018-12-01 22:07:24,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:24,137 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-01 22:07:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 82 transitions. [2018-12-01 22:07:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 43. [2018-12-01 22:07:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-01 22:07:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-12-01 22:07:24,139 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-01 22:07:24,139 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-01 22:07:24,139 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 22:07:24,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2018-12-01 22:07:24,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-01 22:07:24,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:24,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:24,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:24,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:24,140 INFO L794 eck$LassoCheckResult]: Stem: 894#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 886#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 887#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2018-12-01 22:07:24,140 INFO L796 eck$LassoCheckResult]: Loop: 871#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 876#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 884#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 897#L557-6 assume !test_fun_#t~short13; 898#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 866#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 867#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 874#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 880#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 882#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 892#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 895#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 870#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 871#L557-1 [2018-12-01 22:07:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2018-12-01 22:07:24,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:24,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2018-12-01 22:07:24,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:24,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:24,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:24,162 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-01 22:07:24,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:07:24,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:07:24,162 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 22:07:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:07:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:07:24,162 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-01 22:07:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:07:24,189 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-01 22:07:24,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:07:24,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2018-12-01 22:07:24,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:24,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2018-12-01 22:07:24,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-01 22:07:24,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-01 22:07:24,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2018-12-01 22:07:24,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 22:07:24,190 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-01 22:07:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2018-12-01 22:07:24,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-01 22:07:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-01 22:07:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-01 22:07:24,191 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-01 22:07:24,191 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-01 22:07:24,191 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 22:07:24,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-12-01 22:07:24,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-01 22:07:24,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 22:07:24,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 22:07:24,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-01 22:07:24,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:07:24,192 INFO L794 eck$LassoCheckResult]: Stem: 995#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 990#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 991#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2018-12-01 22:07:24,192 INFO L796 eck$LassoCheckResult]: Loop: 975#L557-1 assume !test_fun_#t~short9; 980#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 988#L557-4 assume !test_fun_#t~short14;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem10 < 0; 992#L557-6 assume test_fun_#t~short13;call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short13 := test_fun_#t~mem12 > -2147483648 - test_fun_#t~mem11; 998#L557-8 test_fun_#t~short14 := test_fun_#t~short13; 970#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 971#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 978#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 983#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 985#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 993#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~short14;havoc test_fun_#t~mem19;havoc test_fun_#t~short18;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem17;havoc test_fun_#t~mem16;havoc test_fun_#t~mem10;havoc test_fun_#t~mem12;havoc test_fun_#t~short13;havoc test_fun_#t~short22;havoc test_fun_#t~mem8;havoc test_fun_#t~short20;havoc test_fun_#t~mem15;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 974#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 975#L557-1 [2018-12-01 22:07:24,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2018-12-01 22:07:24,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:24,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:24,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2018-12-01 22:07:24,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:24,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:07:24,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:24,211 INFO L82 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2018-12-01 22:07:24,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:07:24,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:07:24,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:07:24,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:07:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:07:24,500 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2018-12-01 22:07:24,939 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2018-12-01 22:07:25,238 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 116 [2018-12-01 22:07:25,582 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-01 22:07:25,585 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 22:07:25,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 22:07:25,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 22:07:25,585 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 22:07:25,585 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 22:07:25,585 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 22:07:25,585 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 22:07:25,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 22:07:25,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-01 22:07:25,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 22:07:25,585 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 22:07:25,592 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-01 22:07:26,165 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-12-01 22:07:26,432 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-12-01 22:07:26,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-01 22:07:26,433 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-01 22:07:26,434 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-01 22:07:26,435 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-01 22:07:26,436 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-01 22:07:26,436 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-01 22:07:26,437 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-01 22:07:26,438 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-01 22:07:26,439 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-01 22:07:26,440 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-01 22:07:26,441 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-01 22:07:26,442 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-01 22:07:26,444 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-01 22:07:26,445 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-01 22:07:26,446 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-01 22:07:26,447 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-01 22:07:26,447 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-01 22:07:26,448 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-01 22:07:26,449 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-01 22:07:26,450 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-01 22:07:26,451 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-01 22:07:26,452 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-01 22:07:26,453 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-01 22:07:26,454 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-01 22:07:26,455 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-01 22:07:26,455 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-01 22:07:26,456 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-01 22:07:26,874 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-01 22:07:27,051 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 22:07:27,051 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 22:07:27,051 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-01 22:07:27,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:27,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:27,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:27,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:27,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:27,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:27,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:27,067 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-01 22:07:27,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:27,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 22:07:27,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 22:07:27,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:27,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 22:07:27,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 22:07:27,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 22:07:27,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 22:07:27,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 22:07:27,071 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 22:07:27,071 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 22:07:27,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 22:07:27,080 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-01 22:07:27,080 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-01 22:07:27,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 22:07:27,152 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 22:07:27,152 INFO L444 ModelExtractionUtils]: 73 out of 76 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 22:07:27,153 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 22:07:27,153 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-01 22:07:27,154 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 22:07:27,154 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)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-12-01 22:07:27,268 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-12-01 22:07:27,270 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 22:07:27,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:07:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:27,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:07:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:07:27,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 22:07:27,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,367 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 73 [2018-12-01 22:07:27,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,378 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 59 treesize of output 50 [2018-12-01 22:07:27,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,416 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 52 treesize of output 51 [2018-12-01 22:07:27,417 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 76 [2018-12-01 22:07:27,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-01 22:07:27,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,461 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 100 [2018-12-01 22:07:27,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,518 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 42 treesize of output 47 [2018-12-01 22:07:27,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,521 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 23 treesize of output 16 [2018-12-01 22:07:27,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,526 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,553 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 57 [2018-12-01 22:07:27,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 54 treesize of output 46 [2018-12-01 22:07:27,556 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,577 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 32 treesize of output 39 [2018-12-01 22:07:27,578 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:07:27,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,599 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-12-01 22:07:27,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,602 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 52 treesize of output 39 [2018-12-01 22:07:27,603 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,618 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 34 treesize of output 38 [2018-12-01 22:07:27,620 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 35 treesize of output 27 [2018-12-01 22:07:27,620 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,632 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,636 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,641 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-01 22:07:27,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,644 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 37 treesize of output 26 [2018-12-01 22:07:27,644 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,654 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 34 treesize of output 43 [2018-12-01 22:07:27,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 22:07:27,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-01 22:07:27,656 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,659 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,662 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 22:07:27,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-01 22:07:27,685 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 3 variables, input treesize:78, output treesize:35 [2018-12-01 22:07:27,700 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-01 22:07:27,701 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-01 22:07:27,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-01 22:07:27,733 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 78 states and 87 transitions. Complement of second has 8 states. [2018-12-01 22:07:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-01 22:07:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-01 22:07:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-12-01 22:07:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 13 letters. [2018-12-01 22:07:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 16 letters. Loop has 13 letters. [2018-12-01 22:07:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:27,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 26 letters. [2018-12-01 22:07:27,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 22:07:27,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 87 transitions. [2018-12-01 22:07:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:07:27,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 22:07:27,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 22:07:27,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 22:07:27,737 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 22:07:27,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 22:07:27,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 22:07:27,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 22:07:27,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 10:07:27 BoogieIcfgContainer [2018-12-01 22:07:27,743 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 22:07:27,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:07:27,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:07:27,743 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:07:27,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:07:21" (3/4) ... [2018-12-01 22:07:27,747 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:07:27,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:07:27,747 INFO L168 Benchmark]: Toolchain (without parser) took 6928.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -108.2 MB). Peak memory consumption was 103.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:07:27,748 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:07:27,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:07:27,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:07:27,749 INFO L168 Benchmark]: Boogie Preprocessor took 14.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:07:27,750 INFO L168 Benchmark]: RCFGBuilder took 186.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:07:27,750 INFO L168 Benchmark]: BuchiAutomizer took 6426.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:07:27,750 INFO L168 Benchmark]: Witness Printer took 3.61 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-01 22:07:27,753 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6426.69 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 113.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 5.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 45 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 157 SDtfs, 165 SDslu, 254 SDs, 0 SdLazy, 260 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital693 mio100 ax103 hnf99 lsp73 ukn75 mio100 lsp30 div100 bol105 ite100 ukn100 eq170 hnf89 smp90 dnf228 smp74 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 83ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...