./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 704389633f786b8f459e07240134137dbbeaeb7e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: program execution has not yet been computed --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:15:49,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:15:49,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:15:49,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:15:49,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:15:49,754 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:15:49,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:15:49,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:15:49,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:15:49,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:15:49,764 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:15:49,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:15:49,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:15:49,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:15:49,775 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:15:49,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:15:49,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:15:49,781 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:15:49,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:15:49,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:15:49,791 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:15:49,795 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:15:49,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:15:49,800 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:15:49,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:15:49,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:15:49,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:15:49,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:15:49,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:15:49,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:15:49,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:15:49,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:15:49,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:15:49,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:15:49,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:15:49,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:15:49,812 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:15:49,843 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:15:49,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:15:49,844 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:15:49,845 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:15:49,845 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:15:49,845 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:15:49,845 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:15:49,845 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:15:49,846 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:15:49,846 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:15:49,846 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:15:49,846 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:15:49,846 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:15:49,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:15:49,848 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:15:49,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:15:49,849 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:15:49,849 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:15:49,849 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:15:49,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:15:49,850 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:15:49,850 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:15:49,851 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 704389633f786b8f459e07240134137dbbeaeb7e [2019-01-02 00:15:49,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:15:49,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:15:49,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:15:49,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:15:49,910 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:15:49,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2019-01-02 00:15:49,985 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66af07082/ad68c6589e9a46fd9d96dc01bf6ca318/FLAG8887a5c4c [2019-01-02 00:15:50,486 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:15:50,487 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2019-01-02 00:15:50,494 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66af07082/ad68c6589e9a46fd9d96dc01bf6ca318/FLAG8887a5c4c [2019-01-02 00:15:50,802 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66af07082/ad68c6589e9a46fd9d96dc01bf6ca318 [2019-01-02 00:15:50,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:15:50,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:15:50,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:15:50,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:15:50,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:15:50,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:15:50" (1/1) ... [2019-01-02 00:15:50,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ad40a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:50, skipping insertion in model container [2019-01-02 00:15:50,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:15:50" (1/1) ... [2019-01-02 00:15:50,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:15:50,847 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:15:51,050 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:15:51,067 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:15:51,104 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:15:51,128 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:15:51,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51 WrapperNode [2019-01-02 00:15:51,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:15:51,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:15:51,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:15:51,130 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:15:51,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:15:51,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:15:51,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:15:51,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:15:51,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... [2019-01-02 00:15:51,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:15:51,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:15:51,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:15:51,299 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:15:51,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-02 00:15:51,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:15:51,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:15:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:15:51,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:15:51,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:15:51,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:15:51,881 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:15:51,881 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-02 00:15:51,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:15:51 BoogieIcfgContainer [2019-01-02 00:15:51,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:15:51,882 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:15:51,883 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:15:51,887 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:15:51,890 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:15:51,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:15:50" (1/3) ... [2019-01-02 00:15:51,891 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779d5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:15:51, skipping insertion in model container [2019-01-02 00:15:51,892 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:15:51,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:15:51" (2/3) ... [2019-01-02 00:15:51,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779d5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:15:51, skipping insertion in model container [2019-01-02 00:15:51,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:15:51,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:15:51" (3/3) ... [2019-01-02 00:15:51,897 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2019-01-02 00:15:51,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:15:51,961 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:15:51,961 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:15:51,961 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:15:51,962 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:15:51,962 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:15:51,962 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:15:51,962 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:15:51,963 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:15:51,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-02 00:15:52,005 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-02 00:15:52,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:15:52,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:15:52,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:15:52,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:15:52,012 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:15:52,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-02 00:15:52,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-02 00:15:52,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:15:52,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:15:52,017 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-02 00:15:52,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:15:52,027 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 9#L11-3true [2019-01-02 00:15:52,028 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 12#L11-2true avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 9#L11-3true [2019-01-02 00:15:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-02 00:15:52,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:52,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-01-02 00:15:52,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:52,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:52,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-01-02 00:15:52,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:52,716 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-02 00:15:52,802 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:15:52,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:15:52,803 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:15:52,803 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:15:52,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:15:52,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:15:52,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:15:52,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:15:52,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-02 00:15:52,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:15:52,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:15:52,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:52,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,153 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-02 00:15:53,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:53,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:15:54,065 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:15:54,070 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:15:54,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:54,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,084 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 [2019-01-02 00:15:54,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,090 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 [2019-01-02 00:15:54,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:54,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:54,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:15:54,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:54,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:54,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,119 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 [2019-01-02 00:15:54,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,124 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 [2019-01-02 00:15:54,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,129 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 [2019-01-02 00:15:54,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,135 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 [2019-01-02 00:15:54,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,138 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 [2019-01-02 00:15:54,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:15:54,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:15:54,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:15:54,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,142 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 [2019-01-02 00:15:54,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:54,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:54,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,150 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 [2019-01-02 00:15:54,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:54,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:54,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:15:54,167 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 [2019-01-02 00:15:54,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:15:54,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:15:54,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:15:54,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:15:54,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:15:54,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:15:54,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:15:54,357 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:15:54,358 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-02 00:15:54,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:15:54,363 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:15:54,365 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:15:54,366 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, v_rep(select #length ULTIMATE.start_avg_~x.base)_1, ULTIMATE.start_avg_~i~0) = -1*ULTIMATE.start_avg_~x.offset + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_1 - 4*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2019-01-02 00:15:54,400 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-02 00:15:54,418 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:15:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:54,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:54,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:15:54,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:15:54,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-01-02 00:15:54,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2019-01-02 00:15:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:15:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:15:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-01-02 00:15:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-02 00:15:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-02 00:15:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-02 00:15:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:15:54,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2019-01-02 00:15:54,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:54,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2019-01-02 00:15:54,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-02 00:15:54,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-02 00:15:54,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-02 00:15:54,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:15:54,668 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-02 00:15:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-02 00:15:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-02 00:15:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:15:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-02 00:15:54,698 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-02 00:15:54,698 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-02 00:15:54,698 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:15:54,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-02 00:15:54,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:54,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:15:54,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:15:54,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:15:54,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:15:54,702 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 140#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 136#L11-3 assume !(avg_~i~0 < ~N~0); 132#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 133#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 145#L11-8 [2019-01-02 00:15:54,702 INFO L796 eck$LassoCheckResult]: Loop: 145#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 146#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 145#L11-8 [2019-01-02 00:15:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2019-01-02 00:15:54,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:54,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:54,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,718 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:15:54,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:15:54,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:15:54,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:54,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:15:54,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:15:54,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:15:54,823 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:15:54,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-02 00:15:54,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:54,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:54,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:15:54,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:15:54,921 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-02 00:15:54,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:15:54,977 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-02 00:15:54,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-02 00:15:54,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-01-02 00:15:54,981 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:54,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-01-02 00:15:54,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-02 00:15:54,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-02 00:15:54,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-02 00:15:54,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:15:54,984 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-02 00:15:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-02 00:15:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-02 00:15:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-02 00:15:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-02 00:15:54,987 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-02 00:15:54,987 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-02 00:15:54,987 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:15:54,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-02 00:15:54,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:54,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:15:54,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:15:54,989 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:15:54,989 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:15:54,989 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 197#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 196#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 192#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 193#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 194#L11-3 assume !(avg_~i~0 < ~N~0); 188#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 189#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 201#L11-8 [2019-01-02 00:15:54,989 INFO L796 eck$LassoCheckResult]: Loop: 201#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 202#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 201#L11-8 [2019-01-02 00:15:54,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:54,990 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2019-01-02 00:15:54,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:54,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:54,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:54,998 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:15:54,998 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:15:54,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:15:55,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:15:55,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:15:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:15:55,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:15:55,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-02 00:15:55,125 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:15:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2019-01-02 00:15:55,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:55,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,343 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:15:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:15:55,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:15:55,344 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-02 00:15:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:15:55,524 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-02 00:15:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:15:55,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-01-02 00:15:55,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:55,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-01-02 00:15:55,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-02 00:15:55,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-02 00:15:55,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-02 00:15:55,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:15:55,529 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-02 00:15:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-02 00:15:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-02 00:15:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-02 00:15:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-02 00:15:55,532 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-02 00:15:55,532 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-02 00:15:55,532 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:15:55,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-02 00:15:55,533 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-02 00:15:55,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:15:55,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:15:55,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-02 00:15:55,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:15:55,536 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 263#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 262#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 257#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 258#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 259#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 260#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 269#L11-3 assume !(avg_~i~0 < ~N~0); 253#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 254#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 267#L11-8 [2019-01-02 00:15:55,536 INFO L796 eck$LassoCheckResult]: Loop: 267#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 268#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 267#L11-8 [2019-01-02 00:15:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2019-01-02 00:15:55,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:55,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:55,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:15:55,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,545 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:15:55,546 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:15:55,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:15:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:15:55,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:15:55,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-02 00:15:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2019-01-02 00:15:55,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:15:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:15:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2019-01-02 00:15:55,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:15:55,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:15:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:15:55,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:15:55,701 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:15:55,701 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:15:55,702 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:15:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:15:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:15:55,977 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:15:56,142 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-02 00:15:57,275 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2019-01-02 00:16:00,909 WARN L181 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-01-02 00:16:00,916 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:16:00,916 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:16:00,916 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:16:00,917 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:16:00,917 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:16:00,917 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:16:00,917 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:16:00,917 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:16:00,917 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-02 00:16:00,917 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:16:00,917 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:16:00,920 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:16:00,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:00,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:01,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2019-01-02 00:16:02,454 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-02 00:16:02,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:16:02,547 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-02 00:16:04,290 WARN L181 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 180 DAG size of output: 109 [2019-01-02 00:16:04,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-02 00:16:09,433 WARN L181 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 142 DAG size of output: 104 [2019-01-02 00:16:09,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:16:09,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:16:09,495 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 [2019-01-02 00:16:09,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,502 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 [2019-01-02 00:16:09,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,507 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 [2019-01-02 00:16:09,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,512 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 [2019-01-02 00:16:09,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,518 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 [2019-01-02 00:16:09,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:09,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:09,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,525 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 [2019-01-02 00:16:09,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,528 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 [2019-01-02 00:16:09,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:16:09,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:09,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,557 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 [2019-01-02 00:16:09,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,566 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 [2019-01-02 00:16:09,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,569 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 [2019-01-02 00:16:09,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,574 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 [2019-01-02 00:16:09,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:16:09,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:16:09,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:16:09,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:16:09,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:16:09,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:16:09,584 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 [2019-01-02 00:16:09,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:16:09,585 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-02 00:16:09,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:16:09,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:16:09,630 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-02 00:16:09,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:16:09,876 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:16:10,062 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:16:10,062 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-02 00:16:10,063 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:16:10,063 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:16:10,065 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:16:10,066 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_avg_~i~0) = 1*~N~0 - 1*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2019-01-02 00:16:10,172 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:16:10,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:10,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:10,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:16:10,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:16:10,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-02 00:16:10,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 28 transitions. Complement of second has 7 states. [2019-01-02 00:16:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-02 00:16:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:16:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-02 00:16:10,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-02 00:16:10,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:10,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-02 00:16:10,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:10,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-02 00:16:10,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:16:10,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2019-01-02 00:16:10,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:10,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 24 transitions. [2019-01-02 00:16:10,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:16:10,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-02 00:16:10,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-01-02 00:16:10,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:10,756 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-02 00:16:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-01-02 00:16:10,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-02 00:16:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-02 00:16:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-01-02 00:16:10,762 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-02 00:16:10,762 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-02 00:16:10,762 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:16:10,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-01-02 00:16:10,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:10,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:10,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:10,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:10,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:10,770 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 380#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 379#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 374#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 375#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 376#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 377#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 387#L11-3 assume !(avg_~i~0 < ~N~0); 370#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 371#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 384#L11-8 assume !(avg_~i~0 < ~N~0); 382#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 383#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 372#L32-3 [2019-01-02 00:16:10,770 INFO L796 eck$LassoCheckResult]: Loop: 372#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 373#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 372#L32-3 [2019-01-02 00:16:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2019-01-02 00:16:10,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:10,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:10,797 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:16:10,797 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:16:10,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:16:10,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:10,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-02 00:16:11,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:16:11,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-02 00:16:11,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2019-01-02 00:16:11,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:16:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:16:11,101 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-02 00:16:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:11,168 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-02 00:16:11,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:16:11,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2019-01-02 00:16:11,170 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:11,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2019-01-02 00:16:11,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-02 00:16:11,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-02 00:16:11,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-01-02 00:16:11,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:11,172 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-02 00:16:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-01-02 00:16:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-02 00:16:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-02 00:16:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-02 00:16:11,176 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-02 00:16:11,176 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-02 00:16:11,177 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-02 00:16:11,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-02 00:16:11,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:11,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:11,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:11,207 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:11,207 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:11,208 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 466#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 465#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 460#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 461#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 462#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 463#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 473#L11-3 assume !(avg_~i~0 < ~N~0); 456#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 457#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 470#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 471#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 472#L11-8 assume !(avg_~i~0 < ~N~0); 468#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 469#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 458#L32-3 [2019-01-02 00:16:11,209 INFO L796 eck$LassoCheckResult]: Loop: 458#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 459#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 458#L32-3 [2019-01-02 00:16:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2019-01-02 00:16:11,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,225 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:16:11,226 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:16:11,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:16:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:16:11,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:16:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-02 00:16:11,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-02 00:16:11,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-02 00:16:11,475 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:16:11,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2019-01-02 00:16:11,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:16:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:16:11,701 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-02 00:16:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:16:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:16:11,718 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-02 00:16:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:16:11,773 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-02 00:16:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:16:11,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2019-01-02 00:16:11,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:11,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2019-01-02 00:16:11,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-02 00:16:11,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-02 00:16:11,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-01-02 00:16:11,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:16:11,778 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-02 00:16:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-01-02 00:16:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-01-02 00:16:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-02 00:16:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-02 00:16:11,782 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-02 00:16:11,782 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-02 00:16:11,783 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-02 00:16:11,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-01-02 00:16:11,783 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:16:11,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:16:11,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:16:11,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:16:11,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:16:11,786 INFO L794 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 564#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 563#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 558#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 559#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 560#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 561#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 572#L11-3 assume !(avg_~i~0 < ~N~0); 554#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 555#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 568#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 569#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 570#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 571#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 573#L11-8 assume !(avg_~i~0 < ~N~0); 566#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 567#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 556#L32-3 [2019-01-02 00:16:11,786 INFO L796 eck$LassoCheckResult]: Loop: 556#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 557#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 556#L32-3 [2019-01-02 00:16:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:16:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2019-01-02 00:16:11,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:16:11,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:16:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:16:11,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:16:11,795 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-02 00:16:11,795 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-02 00:16:11,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-02 00:16:11,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-02 00:16:11,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-02 00:16:11,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-02 00:16:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-01-02 00:16:11,971 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:929) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-02 00:16:11,978 INFO L168 Benchmark]: Toolchain (without parser) took 21166.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.1 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -349.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:11,979 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:11,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.54 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:11,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.59 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:16:11,985 INFO L168 Benchmark]: Boogie Preprocessor took 117.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:11,986 INFO L168 Benchmark]: RCFGBuilder took 583.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:11,989 INFO L168 Benchmark]: BuchiAutomizer took 20090.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:16:12,000 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.54 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.59 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -199.5 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 583.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20090.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -187.0 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...