./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:17,760 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:17,762 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:17,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:17,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:17,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:17,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:17,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:17,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:17,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:17,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:17,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:17,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:17,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:17,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:17,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:17,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:17,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:17,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:17,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:17,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:17,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:17,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:17,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:17,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:17,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:17,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:17,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:17,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:17,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:17,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:17,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:17,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:17,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:17,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:17,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:17,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:17,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:17,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:17,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:17,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:17,822 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:17,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:17,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:17,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:17,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:17,845 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:17,846 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:17,846 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:17,846 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:17,846 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:17,846 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:17,846 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:17,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:17,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:17,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:17,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:17,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:17,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:17,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:17,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:17,848 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:17,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:17,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:17,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:17,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:17,849 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:17,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:17,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:17,849 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:17,850 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:17,850 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2019-10-22 08:56:17,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:17,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:17,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:17,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:17,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:17,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2019-10-22 08:56:17,945 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/data/350e872cf/a62adcf4a1774f778260aded43925eb9/FLAG669b6c214 [2019-10-22 08:56:18,381 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:18,382 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2019-10-22 08:56:18,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/data/350e872cf/a62adcf4a1774f778260aded43925eb9/FLAG669b6c214 [2019-10-22 08:56:18,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/data/350e872cf/a62adcf4a1774f778260aded43925eb9 [2019-10-22 08:56:18,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:18,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:18,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:18,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:18,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:18,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e716305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18, skipping insertion in model container [2019-10-22 08:56:18,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:18,453 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:18,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:18,777 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:18,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:18,857 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:18,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18 WrapperNode [2019-10-22 08:56:18,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:18,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:18,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:18,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:18,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:18,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:18,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:18,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:18,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... [2019-10-22 08:56:18,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:18,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:18,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:18,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:18,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:18,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:19,281 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:19,282 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:56:19,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:19 BoogieIcfgContainer [2019-10-22 08:56:19,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:19,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:19,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:19,286 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:19,287 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:19,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:18" (1/3) ... [2019-10-22 08:56:19,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e600e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:19, skipping insertion in model container [2019-10-22 08:56:19,289 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:19,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:18" (2/3) ... [2019-10-22 08:56:19,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e600e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:19, skipping insertion in model container [2019-10-22 08:56:19,289 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:19,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:19" (3/3) ... [2019-10-22 08:56:19,291 INFO L371 chiAutomizerObserver]: Analyzing ICFG array03-alloca-1.i [2019-10-22 08:56:19,335 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:19,335 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:19,335 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:19,335 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:19,336 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:19,336 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:19,336 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:19,336 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:19,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:56:19,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:19,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:19,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:19,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:19,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:19,378 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:19,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:56:19,379 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:19,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:19,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:19,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:19,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:19,387 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 6#L567true assume !(main_~array_size~0 < 1); 10#L567-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 3#L551-3true [2019-10-22 08:56:19,388 INFO L793 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 13#L553true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 7#L558-2true assume !true; 9#L558-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 17#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2019-10-22 08:56:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,393 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:56:19,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656635620] [2019-10-22 08:56:19,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,524 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:19,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2019-10-22 08:56:19,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444607552] [2019-10-22 08:56:19,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:19,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444607552] [2019-10-22 08:56:19,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:19,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:19,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56382471] [2019-10-22 08:56:19,569 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:56:19,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:19,584 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-10-22 08:56:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:19,590 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-10-22 08:56:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:19,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-10-22 08:56:19,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:19,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2019-10-22 08:56:19,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:19,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:19,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-10-22 08:56:19,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:19,599 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:56:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-10-22 08:56:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:56:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:56:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-10-22 08:56:19,626 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:56:19,627 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-10-22 08:56:19,627 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:19,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-10-22 08:56:19,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:56:19,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:19,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:19,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:56:19,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:19,629 INFO L791 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~array_size~0 < 1); 47#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 40#L551-3 [2019-10-22 08:56:19,629 INFO L793 eck$LassoCheckResult]: Loop: 40#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 42#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 45#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L551-3 [2019-10-22 08:56:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-10-22 08:56:19,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895070479] [2019-10-22 08:56:19,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,630 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2019-10-22 08:56:19,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468503719] [2019-10-22 08:56:19,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,695 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2019-10-22 08:56:19,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:19,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920730818] [2019-10-22 08:56:19,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:19,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:19,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:19,998 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:19,998 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:19,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:19,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:19,999 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:19,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:19,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:19,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:20,000 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration2_Lasso [2019-10-22 08:56:20,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:20,000 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:20,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-10-22 08:56:20,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,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-10-22 08:56:20,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:20,556 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:20,561 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:20,562 INFO L120 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-10-22 08:56:20,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,567 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,569 INFO L120 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-10-22 08:56:20,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,571 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,571 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,572 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,572 INFO L120 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-10-22 08:56:20,573 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,573 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,573 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,574 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,574 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,574 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,574 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,576 INFO L120 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-10-22 08:56:20,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,577 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,579 INFO L120 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-10-22 08:56:20,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,582 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,589 INFO L120 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-10-22 08:56:20,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,592 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,592 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,593 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,593 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,594 INFO L120 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-10-22 08:56:20,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,595 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,597 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,597 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,620 INFO L120 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-10-22 08:56:20,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,621 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,621 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,621 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,623 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,627 INFO L120 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-10-22 08:56:20,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,630 INFO L120 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-10-22 08:56:20,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,632 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,633 INFO L120 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-10-22 08:56:20,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,635 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,635 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,637 INFO L120 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-10-22 08:56:20,637 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,637 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,639 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,642 INFO L120 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-10-22 08:56:20,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:20,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:20,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:20,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,646 INFO L120 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-10-22 08:56:20,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,648 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,649 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,652 INFO L120 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-10-22 08:56:20,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:20,669 INFO L120 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-10-22 08:56:20,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:20,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:20,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:20,671 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:20,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:20,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:20,773 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:20,829 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:56:20,830 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:56:20,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:20,833 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:20,834 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:20,834 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-10-22 08:56:20,851 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:20,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:20,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:20,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:20,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:20,928 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-10-22 08:56:20,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-10-22 08:56:20,985 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2019-10-22 08:56:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:56:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-10-22 08:56:20,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2019-10-22 08:56:20,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:20,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:56:20,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:20,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2019-10-22 08:56:20,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:20,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2019-10-22 08:56:20,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:20,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2019-10-22 08:56:20,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:56:20,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:20,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2019-10-22 08:56:20,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:20,998 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-10-22 08:56:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2019-10-22 08:56:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:56:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:56:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-10-22 08:56:21,001 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-10-22 08:56:21,001 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-10-22 08:56:21,002 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:56:21,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-10-22 08:56:21,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:21,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:21,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:21,003 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:56:21,003 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:21,003 INFO L791 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 133#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 134#L567 assume !(main_~array_size~0 < 1); 143#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 129#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 131#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 135#L558-2 [2019-10-22 08:56:21,004 INFO L793 eck$LassoCheckResult]: Loop: 135#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 139#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 135#L558-2 [2019-10-22 08:56:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2019-10-22 08:56:21,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897151951] [2019-10-22 08:56:21,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,030 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:21,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-10-22 08:56:21,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066874924] [2019-10-22 08:56:21,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,045 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:21,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064026622] [2019-10-22 08:56:21,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,100 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2019-10-22 08:56:21,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270852891] [2019-10-22 08:56:21,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,120 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:21,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86996220] [2019-10-22 08:56:21,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:21,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:21,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:21,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-10-22 08:56:21,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:21,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:21,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:21,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-10-22 08:56:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:21,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270852891] [2019-10-22 08:56:21,237 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:56:21,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86996220] [2019-10-22 08:56:21,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:21,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:21,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349426292] [2019-10-22 08:56:21,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:21,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:21,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:21,297 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 08:56:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:21,339 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-10-22 08:56:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:21,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-10-22 08:56:21,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:21,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-10-22 08:56:21,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:21,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:21,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-10-22 08:56:21,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:21,342 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-10-22 08:56:21,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-10-22 08:56:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-10-22 08:56:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 08:56:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-10-22 08:56:21,344 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:56:21,344 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-10-22 08:56:21,344 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:56:21,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-10-22 08:56:21,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:21,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:21,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:21,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:21,346 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:21,346 INFO L791 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 204#L567 assume !(main_~array_size~0 < 1); 213#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 201#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 205#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 209#L558-2 [2019-10-22 08:56:21,346 INFO L793 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 209#L558-2 [2019-10-22 08:56:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-10-22 08:56:21,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138907370] [2019-10-22 08:56:21,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,363 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:21,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2019-10-22 08:56:21,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645066309] [2019-10-22 08:56:21,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,367 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:21,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906469569] [2019-10-22 08:56:21,368 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:21,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 08:56:21,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:56:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2019-10-22 08:56:21,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:21,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088200989] [2019-10-22 08:56:21,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:21,415 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:21,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972823446] [2019-10-22 08:56:21,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:21,566 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:21,767 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-10-22 08:56:21,818 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:21,818 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:21,818 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:21,818 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:21,818 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:21,818 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:21,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:21,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:21,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration4_Lasso [2019-10-22 08:56:21,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:21,819 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:21,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:21,977 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-22 08:56:21,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:22,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:22,327 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:22,327 INFO L120 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-10-22 08:56:22,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:22,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,329 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:22,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:22,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:22,330 INFO L120 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-10-22 08:56:22,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:22,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:22,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:22,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:22,339 INFO L120 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-10-22 08:56:22,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:22,340 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:22,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:22,346 INFO L120 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-10-22 08:56:22,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:22,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:22,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:22,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:22,349 INFO L120 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-10-22 08:56:22,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:22,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:22,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:22,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:22,353 INFO L120 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-10-22 08:56:22,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:22,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:22,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:22,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:22,355 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:22,356 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:22,375 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:22,381 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:22,383 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:22,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:22,384 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:22,385 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:22,385 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-10-22 08:56:22,398 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:22,399 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:22,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:22,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:22,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:22,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:22,449 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-10-22 08:56:22,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-10-22 08:56:22,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2019-10-22 08:56:22,474 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-10-22 08:56:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-10-22 08:56:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:56:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:56:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:22,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:56:22,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:22,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-10-22 08:56:22,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:22,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2019-10-22 08:56:22,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:56:22,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:56:22,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-10-22 08:56:22,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:22,478 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-10-22 08:56:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-10-22 08:56:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-10-22 08:56:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:56:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-10-22 08:56:22,486 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-10-22 08:56:22,486 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-10-22 08:56:22,486 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:56:22,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2019-10-22 08:56:22,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:22,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:22,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:22,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:22,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:22,487 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L567 assume !(main_~array_size~0 < 1); 336#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 322#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 324#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 338#L555 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 332#L558-2 [2019-10-22 08:56:22,487 INFO L793 eck$LassoCheckResult]: Loop: 332#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 331#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 332#L558-2 [2019-10-22 08:56:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-10-22 08:56:22,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315910859] [2019-10-22 08:56:22,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:22,513 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2019-10-22 08:56:22,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858939460] [2019-10-22 08:56:22,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,519 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:22,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549810706] [2019-10-22 08:56:22,519 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:22,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-22 08:56:22,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:56:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:22,561 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:22,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2019-10-22 08:56:22,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,562 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464296479] [2019-10-22 08:56:22,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,571 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:22,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350271108] [2019-10-22 08:56:22,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:22,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:22,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:22,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2019-10-22 08:56:22,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:56:22,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:22,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:56:22,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-10-22 08:56:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:22,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464296479] [2019-10-22 08:56:22,642 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-22 08:56:22,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350271108] [2019-10-22 08:56:22,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:22,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:22,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359214412] [2019-10-22 08:56:22,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:22,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:56:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:22,674 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-10-22 08:56:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:22,729 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-10-22 08:56:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:56:22,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-10-22 08:56:22,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:22,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2019-10-22 08:56:22,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:56:22,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:56:22,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-10-22 08:56:22,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:22,734 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:56:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-10-22 08:56:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-22 08:56:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:56:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-22 08:56:22,736 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:56:22,736 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:56:22,736 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:56:22,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-10-22 08:56:22,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:22,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:22,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:22,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:22,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:22,738 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L567 assume !(main_~array_size~0 < 1); 438#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 426#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 427#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 432#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 436#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 429#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 430#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 434#L558-2 [2019-10-22 08:56:22,738 INFO L793 eck$LassoCheckResult]: Loop: 434#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 433#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 434#L558-2 [2019-10-22 08:56:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2019-10-22 08:56:22,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025832087] [2019-10-22 08:56:22,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:22,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:22,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025832087] [2019-10-22 08:56:22,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:22,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:56:22,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85507656] [2019-10-22 08:56:22,815 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:56:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2019-10-22 08:56:22,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485258497] [2019-10-22 08:56:22,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,816 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,819 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:22,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367817500] [2019-10-22 08:56:22,819 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/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-10-22 08:56:22,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:56:22,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:56:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:22,861 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:22,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:22,930 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-10-22 08:56:22,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:22,979 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-22 08:56:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:22,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-10-22 08:56:22,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:22,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2019-10-22 08:56:22,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:56:22,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:56:22,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-10-22 08:56:22,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:56:22,982 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-22 08:56:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-10-22 08:56:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-22 08:56:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:56:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-10-22 08:56:22,984 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-22 08:56:22,984 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-10-22 08:56:22,984 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:56:22,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-10-22 08:56:22,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:22,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:22,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:22,986 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:22,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:22,986 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L567 assume !(main_~array_size~0 < 1); 511#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 498#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 499#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 524#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 512#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 508#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 509#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 501#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 502#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 507#L558-2 [2019-10-22 08:56:22,986 INFO L793 eck$LassoCheckResult]: Loop: 507#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 506#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 507#L558-2 [2019-10-22 08:56:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2019-10-22 08:56:22,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:22,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404633782] [2019-10-22 08:56:22,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:22,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:22,997 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:22,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780297883] [2019-10-22 08:56:22,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:23,072 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:23,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2019-10-22 08:56:23,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:23,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011763509] [2019-10-22 08:56:23,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:23,078 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:23,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [152397211] [2019-10-22 08:56:23,079 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:23,132 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 08:56:23,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:56:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:23,138 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:23,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:23,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2019-10-22 08:56:23,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:23,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36286132] [2019-10-22 08:56:23,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:23,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:23,144 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-22 08:56:23,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1161068024] [2019-10-22 08:56:23,146 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e89c78b0-0ab1-44be-97df-b5c87cec50ce/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:23,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:56:23,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-10-22 08:56:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:23,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:23,499 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-10-22 08:56:23,554 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:23,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:23,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:23,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:23,554 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:23,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:23,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:23,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:23,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration7_Lasso [2019-10-22 08:56:23,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:23,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:23,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:23,921 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:23,921 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:23,921 INFO L120 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-10-22 08:56:23,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,922 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:23,922 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,923 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:23,923 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:23,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,924 INFO L120 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-10-22 08:56:23,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,924 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:23,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,925 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:23,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:23,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,926 INFO L120 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-10-22 08:56:23,926 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:23,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:23,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,929 INFO L120 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-10-22 08:56:23,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,931 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:23,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:23,933 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,933 INFO L120 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-10-22 08:56:23,934 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,935 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:23,935 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:23,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,940 INFO L120 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-10-22 08:56:23,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,940 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:56:23,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,942 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:56:23,942 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:23,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:23,949 INFO L120 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-10-22 08:56:23,949 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:23,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:23,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:23,950 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:23,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:23,951 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:23,956 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:23,958 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:56:23,958 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:56:23,959 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:23,960 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:23,960 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:23,960 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-10-22 08:56:23,977 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:56:23,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:56:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,034 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-10-22 08:56:24,034 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:56:24,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-10-22 08:56:24,049 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-10-22 08:56:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:56:24,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:24,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:24,050 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:56:24,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:56:24,123 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-10-22 08:56:24,124 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-10-22 08:56:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 08:56:24,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:24,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:24,125 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:56:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:24,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:56:24,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:24,172 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:56:24,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-10-22 08:56:24,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2019-10-22 08:56:24,197 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-10-22 08:56:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-10-22 08:56:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2019-10-22 08:56:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2019-10-22 08:56:24,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:24,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2019-10-22 08:56:24,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:24,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-10-22 08:56:24,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:24,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2019-10-22 08:56:24,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:56:24,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:56:24,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:56:24,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:24,201 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:24,201 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:24,201 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:24,201 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:56:24,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:24,201 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:56:24,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:56:24,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:56:24 BoogieIcfgContainer [2019-10-22 08:56:24,207 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:56:24,208 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:24,208 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:24,208 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:24,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:19" (3/4) ... [2019-10-22 08:56:24,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:24,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:24,213 INFO L168 Benchmark]: Toolchain (without parser) took 5806.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 944.5 MB in the beginning and 901.7 MB in the end (delta: 42.8 MB). Peak memory consumption was 232.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:24,213 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:24,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:24,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:24,215 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:24,215 INFO L168 Benchmark]: RCFGBuilder took 356.78 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:24,216 INFO L168 Benchmark]: BuchiAutomizer took 4924.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 901.7 MB in the end (delta: 193.7 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:24,216 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 901.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:24,218 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -174.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.06 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 356.78 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4924.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 901.7 MB in the end (delta: 193.7 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.2 GB. Free memory is still 901.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax110 hnf99 lsp87 ukn66 mio100 lsp51 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...