./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb5770b8d32c05b82025135c2b222cf31b0a4100 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:18:53,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:18:53,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:18:53,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:18:53,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:18:53,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:18:53,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:18:53,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:18:53,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:18:53,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:18:53,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:18:53,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:18:53,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:18:53,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:18:53,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:18:53,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:18:53,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:18:53,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:18:53,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:18:53,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:18:53,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:18:53,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:18:53,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:18:53,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:18:53,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:18:53,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:18:53,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:18:53,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:18:53,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:18:53,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:18:53,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:18:53,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:18:53,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:18:53,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:18:53,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:18:53,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:18:53,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:18:53,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:18:53,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:18:53,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:18:53,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:18:53,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-26 04:18:53,954 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:18:53,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:18:53,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:18:53,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:18:53,959 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:18:53,959 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:18:53,959 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:18:53,960 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:18:53,960 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:18:53,961 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:18:53,962 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:18:53,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:18:53,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:18:53,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:18:53,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:18:53,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:18:53,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:18:53,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:18:53,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:18:53,965 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:18:53,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:18:53,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:18:53,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:18:53,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:18:53,966 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:18:53,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:18:53,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:18:53,967 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:18:53,968 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:18:53,969 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:18:53,970 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb5770b8d32c05b82025135c2b222cf31b0a4100 [2020-10-26 04:18:54,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:18:54,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:18:54,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:18:54,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:18:54,498 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:18:54,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2020-10-26 04:18:54,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be4361d0/c0cac47a75854ef5a7d29062eaa16a0b/FLAGf52f69786 [2020-10-26 04:18:55,297 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:18:55,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2020-10-26 04:18:55,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be4361d0/c0cac47a75854ef5a7d29062eaa16a0b/FLAGf52f69786 [2020-10-26 04:18:55,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4be4361d0/c0cac47a75854ef5a7d29062eaa16a0b [2020-10-26 04:18:55,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:18:55,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:18:55,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:18:55,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:18:55,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:18:55,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:18:55" (1/1) ... [2020-10-26 04:18:55,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e05de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:55, skipping insertion in model container [2020-10-26 04:18:55,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:18:55" (1/1) ... [2020-10-26 04:18:55,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:18:55,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:18:56,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:18:56,097 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:18:56,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:18:56,210 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:18:56,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56 WrapperNode [2020-10-26 04:18:56,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:18:56,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:18:56,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:18:56,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:18:56,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:18:56,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:18:56,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:18:56,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:18:56,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... [2020-10-26 04:18:56,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:18:56,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:18:56,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:18:56,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:18:56,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:18:56,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:18:56,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:18:56,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:18:56,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 04:18:56,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:18:56,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:18:57,078 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:18:57,078 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-26 04:18:57,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:18:57 BoogieIcfgContainer [2020-10-26 04:18:57,081 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:18:57,082 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:18:57,082 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:18:57,086 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:18:57,087 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:18:57,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:18:55" (1/3) ... [2020-10-26 04:18:57,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f2ce9e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:18:57, skipping insertion in model container [2020-10-26 04:18:57,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:18:57,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:18:56" (2/3) ... [2020-10-26 04:18:57,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f2ce9e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:18:57, skipping insertion in model container [2020-10-26 04:18:57,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:18:57,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:18:57" (3/3) ... [2020-10-26 04:18:57,092 INFO L373 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2020-10-26 04:18:57,156 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:18:57,157 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:18:57,157 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:18:57,157 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:18:57,157 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:18:57,157 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:18:57,157 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:18:57,158 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:18:57,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:18:57,205 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 04:18:57,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:18:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:18:57,213 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:18:57,214 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:18:57,214 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:18:57,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-26 04:18:57,220 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2020-10-26 04:18:57,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:18:57,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:18:57,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:18:57,221 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:18:57,231 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet21; 8#L578true assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 3#L558true assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 23#L562-2true [2020-10-26 04:18:57,231 INFO L796 eck$LassoCheckResult]: Loop: 23#L562-2true call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 18#L562true assume !!(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8;call f_#t~mem10 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(2 * f_#t~mem10, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem10; 23#L562-2true [2020-10-26 04:18:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:57,240 INFO L82 PathProgramCache]: Analyzing trace with hash 925608, now seen corresponding path program 1 times [2020-10-26 04:18:57,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:57,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521694106] [2020-10-26 04:18:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:57,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:57,596 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:57,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1446, now seen corresponding path program 1 times [2020-10-26 04:18:57,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:57,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121288073] [2020-10-26 04:18:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:57,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:57,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:57,650 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889509773, now seen corresponding path program 1 times [2020-10-26 04:18:57,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:57,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843504279] [2020-10-26 04:18:57,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:18:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:18:57,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843504279] [2020-10-26 04:18:57,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:18:57,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:18:57,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485077828] [2020-10-26 04:18:57,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:18:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:18:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:18:57,975 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2020-10-26 04:18:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:18:58,168 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2020-10-26 04:18:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:18:58,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2020-10-26 04:18:58,180 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:18:58,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 29 states and 38 transitions. [2020-10-26 04:18:58,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-26 04:18:58,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-26 04:18:58,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2020-10-26 04:18:58,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:18:58,197 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-10-26 04:18:58,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2020-10-26 04:18:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2020-10-26 04:18:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-26 04:18:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-26 04:18:58,239 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-26 04:18:58,239 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-26 04:18:58,240 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:18:58,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-26 04:18:58,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:18:58,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:18:58,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:18:58,246 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:18:58,246 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:18:58,246 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 91#L-1 havoc main_#res;havoc main_#t~nondet21; 84#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 77#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 78#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 93#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 80#L567-2 [2020-10-26 04:18:58,248 INFO L796 eck$LassoCheckResult]: Loop: 80#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 88#L566 assume !f_#t~short13; 89#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 85#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 80#L567-2 [2020-10-26 04:18:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 1 times [2020-10-26 04:18:58,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:58,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625150137] [2020-10-26 04:18:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,411 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1759853, now seen corresponding path program 1 times [2020-10-26 04:18:58,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:58,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481778615] [2020-10-26 04:18:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:18:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:18:58,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481778615] [2020-10-26 04:18:58,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:18:58,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 04:18:58,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70507850] [2020-10-26 04:18:58,441 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:18:58,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:18:58,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 04:18:58,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 04:18:58,442 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-10-26 04:18:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:18:58,473 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-10-26 04:18:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 04:18:58,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2020-10-26 04:18:58,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:18:58,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2020-10-26 04:18:58,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-26 04:18:58,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-26 04:18:58,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2020-10-26 04:18:58,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:18:58,478 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-10-26 04:18:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2020-10-26 04:18:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-26 04:18:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-26 04:18:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-10-26 04:18:58,481 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-10-26 04:18:58,481 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-10-26 04:18:58,481 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:18:58,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2020-10-26 04:18:58,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:18:58,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:18:58,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:18:58,483 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:18:58,483 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:18:58,484 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 136#L-1 havoc main_#res;havoc main_#t~nondet21; 130#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 123#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 124#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 139#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 126#L567-2 [2020-10-26 04:18:58,484 INFO L796 eck$LassoCheckResult]: Loop: 126#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 134#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 135#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 131#L567 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 126#L567-2 [2020-10-26 04:18:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 889509771, now seen corresponding path program 2 times [2020-10-26 04:18:58,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:58,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385685662] [2020-10-26 04:18:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1757931, now seen corresponding path program 1 times [2020-10-26 04:18:58,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:58,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603811467] [2020-10-26 04:18:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,573 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:18:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -260778635, now seen corresponding path program 1 times [2020-10-26 04:18:58,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:18:58,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13398492] [2020-10-26 04:18:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:18:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:18:58,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:18:58,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:18:58,779 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-26 04:19:00,536 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2020-10-26 04:19:01,073 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-26 04:19:01,096 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:19:01,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:19:01,096 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:19:01,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:19:01,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:19:01,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:01,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:19:01,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:19:01,097 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration3_Lasso [2020-10-26 04:19:01,097 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:19:01,098 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:19:01,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:01,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,249 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2020-10-26 04:19:02,530 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2020-10-26 04:19:02,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:02,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:03,552 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:19:03,561 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,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 [2020-10-26 04:19:03,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,602 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 [2020-10-26 04:19:03,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,635 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 [2020-10-26 04:19:03,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,663 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 [2020-10-26 04:19:03,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,695 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 [2020-10-26 04:19:03,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:03,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:03,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,731 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 [2020-10-26 04:19:03,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,760 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 [2020-10-26 04:19:03,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:03,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:03,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:03,815 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 [2020-10-26 04:19:03,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,821 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,847 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 [2020-10-26 04:19:03,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:03,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:03,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:03,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,874 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 [2020-10-26 04:19:03,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:03,897 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:03,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,936 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 [2020-10-26 04:19:03,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:03,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:03,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:03,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:03,996 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 [2020-10-26 04:19:03,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:03,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:03,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:03,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,028 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 [2020-10-26 04:19:04,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,036 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,058 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 [2020-10-26 04:19:04,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,099 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 [2020-10-26 04:19:04,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,142 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 [2020-10-26 04:19:04,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,222 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 [2020-10-26 04:19:04,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:04,268 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 [2020-10-26 04:19:04,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,309 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 [2020-10-26 04:19:04,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,356 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 [2020-10-26 04:19:04,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:04,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:04,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:04,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:04,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:04,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:04,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:19:04,404 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-26 04:19:04,404 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:04,415 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:04,421 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:19:04,422 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:19:04,422 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_1 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_1 - 1 >= 0] [2020-10-26 04:19:04,984 INFO L297 tatePredicateManager]: 56 out of 59 supporting invariants were superfluous and have been removed [2020-10-26 04:19:04,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:19:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:05,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-26 04:19:05,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:05,296 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:05,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2020-10-26 04:19:05,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:05,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:05,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:05,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,370 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-26 04:19:05,373 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:05,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,378 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-26 04:19:05,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,382 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:05,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,389 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:05,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,458 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:05,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,469 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:05,524 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:05,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2020-10-26 04:19:05,537 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:05,580 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:05,613 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:05,614 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:306, output treesize:80 [2020-10-26 04:19:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:05,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:19:05,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:05,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:05,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-26 04:19:05,927 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-26 04:19:08,048 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 29 states and 34 transitions. Complement of second has 10 states. [2020-10-26 04:19:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:19:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:19:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-10-26 04:19:08,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:19:08,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:08,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-26 04:19:08,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:08,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2020-10-26 04:19:08,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:08,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-10-26 04:19:08,060 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:08,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 33 transitions. [2020-10-26 04:19:08,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-26 04:19:08,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-10-26 04:19:08,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2020-10-26 04:19:08,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:19:08,062 INFO L691 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-10-26 04:19:08,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2020-10-26 04:19:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-10-26 04:19:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-26 04:19:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-10-26 04:19:08,069 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-10-26 04:19:08,069 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-10-26 04:19:08,069 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:19:08,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2020-10-26 04:19:08,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:08,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:19:08,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:19:08,072 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-26 04:19:08,072 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:19:08,072 INFO L794 eck$LassoCheckResult]: Stem: 494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 493#L-1 havoc main_#res;havoc main_#t~nondet21; 480#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 477#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 478#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 479#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 485#L567-5 [2020-10-26 04:19:08,073 INFO L796 eck$LassoCheckResult]: Loop: 485#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 497#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 498#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 492#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 485#L567-5 [2020-10-26 04:19:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 890987403, now seen corresponding path program 1 times [2020-10-26 04:19:08,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:08,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745323116] [2020-10-26 04:19:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,196 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:08,198 INFO L82 PathProgramCache]: Analyzing trace with hash 3235563, now seen corresponding path program 1 times [2020-10-26 04:19:08,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:08,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191011853] [2020-10-26 04:19:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,223 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1434718859, now seen corresponding path program 1 times [2020-10-26 04:19:08,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:08,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987959157] [2020-10-26 04:19:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:08,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:08,284 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:08,410 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-10-26 04:19:10,143 WARN L193 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2020-10-26 04:19:10,877 WARN L193 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-10-26 04:19:10,882 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:19:10,883 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:19:10,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:19:10,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:19:10,883 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:19:10,883 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:10,883 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:19:10,883 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:19:10,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i_Iteration4_Lasso [2020-10-26 04:19:10,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:19:10,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:19:10,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:10,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,231 WARN L193 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2020-10-26 04:19:12,526 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2020-10-26 04:19:12,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:19:12,976 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-26 04:19:13,713 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:19:13,713 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,729 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 [2020-10-26 04:19:13,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:13,772 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 [2020-10-26 04:19:13,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:13,813 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 [2020-10-26 04:19:13,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,817 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,839 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 [2020-10-26 04:19:13,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:13,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:13,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,881 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 [2020-10-26 04:19:13,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,907 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 [2020-10-26 04:19:13,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:13,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:13,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,936 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 [2020-10-26 04:19:13,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,938 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,966 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 [2020-10-26 04:19:13,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:13,994 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 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:13,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:13,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:13,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:13,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:13,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:13,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:13,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:13,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,021 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 [2020-10-26 04:19:14,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:14,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:14,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:14,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:14,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:14,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:14,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,054 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 [2020-10-26 04:19:14,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:14,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:14,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:14,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:14,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:14,056 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:14,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:19:14,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:14,088 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 [2020-10-26 04:19:14,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:14,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:19:14,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:14,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:14,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:14,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:19:14,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,117 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 [2020-10-26 04:19:14,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:14,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:14,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:14,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:14,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:14,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:14,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:19:14,149 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 Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:19:14,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:19:14,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:19:14,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:19:14,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:19:14,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:19:14,166 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:19:14,177 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-26 04:19:14,177 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:19:14,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:19:14,192 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-26 04:19:14,192 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:19:14,193 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~y~0.base) ULTIMATE.start_f_~y~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_f_~d_ref~0.base) ULTIMATE.start_f_~d_ref~0.offset)_2 - 2 >= 0] [2020-10-26 04:19:14,589 INFO L297 tatePredicateManager]: 61 out of 64 supporting invariants were superfluous and have been removed [2020-10-26 04:19:14,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-26 04:19:14,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:14,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-26 04:19:14,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:14,838 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:14,839 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2020-10-26 04:19:14,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,854 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-26 04:19:14,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:14,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,882 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-10-26 04:19:14,883 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:14,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,885 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:14,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,888 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:14,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,894 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:14,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,905 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-26 04:19:14,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:14,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:14,913 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:14,982 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:19:14,993 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2020-10-26 04:19:14,994 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:15,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:15,065 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:15,065 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:309, output treesize:80 [2020-10-26 04:19:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-26 04:19:15,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:15,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:15,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-26 04:19:15,284 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-10-26 04:19:15,533 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 37 states and 44 transitions. Complement of second has 10 states. [2020-10-26 04:19:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-26 04:19:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-26 04:19:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-10-26 04:19:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-26 04:19:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:15,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-26 04:19:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:15,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2020-10-26 04:19:15,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:19:15,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2020-10-26 04:19:15,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:15,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 43 transitions. [2020-10-26 04:19:15,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-26 04:19:15,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-26 04:19:15,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 43 transitions. [2020-10-26 04:19:15,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:19:15,538 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-10-26 04:19:15,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 43 transitions. [2020-10-26 04:19:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-10-26 04:19:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-26 04:19:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2020-10-26 04:19:15,541 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 04:19:15,541 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-10-26 04:19:15,541 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:19:15,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2020-10-26 04:19:15,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:15,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:19:15,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:19:15,543 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:19:15,543 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:19:15,543 INFO L794 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 880#L-1 havoc main_#res;havoc main_#t~nondet21; 866#L578 assume 0 != main_#t~nondet21;havoc main_#t~nondet21;f_#in~d := 1;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 859#L558 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 860#L562-2 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 885#L562 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 886#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 872#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 873#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 867#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 861#L568 [2020-10-26 04:19:15,543 INFO L796 eck$LassoCheckResult]: Loop: 861#L568 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 862#L567-2 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 876#L566 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 893#L566-2 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 892#L567 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 861#L568 [2020-10-26 04:19:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:15,544 INFO L82 PathProgramCache]: Analyzing trace with hash -260778639, now seen corresponding path program 1 times [2020-10-26 04:19:15,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:15,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447665615] [2020-10-26 04:19:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:15,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:15,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:15,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 69174960, now seen corresponding path program 1 times [2020-10-26 04:19:15,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:15,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169673282] [2020-10-26 04:19:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:15,606 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:15,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:15,632 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:15,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1938200384, now seen corresponding path program 1 times [2020-10-26 04:19:15,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:15,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85610916] [2020-10-26 04:19:15,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:15,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85610916] [2020-10-26 04:19:15,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046693520] [2020-10-26 04:19:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:19:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:15,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-26 04:19:15,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:16,091 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:16,091 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2020-10-26 04:19:16,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:16,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:16,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,097 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:16,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:16,158 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2020-10-26 04:19:16,158 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:16,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:16,201 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:16,201 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:305, output treesize:76 [2020-10-26 04:19:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:19:16,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:19:16,607 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 57 [2020-10-26 04:19:16,612 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:16,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:16,672 INFO L545 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:16,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:237, output treesize:61 [2020-10-26 04:19:16,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:16,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:19:16,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-10-26 04:19:16,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062799254] [2020-10-26 04:19:17,221 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-10-26 04:19:17,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:19:17,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 04:19:17,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-26 04:19:17,300 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 11 Second operand 8 states. [2020-10-26 04:19:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:19:17,683 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2020-10-26 04:19:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-26 04:19:17,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 68 transitions. [2020-10-26 04:19:17,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:17,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 45 states and 50 transitions. [2020-10-26 04:19:17,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-10-26 04:19:17,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-26 04:19:17,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 50 transitions. [2020-10-26 04:19:17,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:19:17,686 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2020-10-26 04:19:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 50 transitions. [2020-10-26 04:19:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-10-26 04:19:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-26 04:19:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-10-26 04:19:17,689 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-26 04:19:17,689 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-26 04:19:17,690 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 04:19:17,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2020-10-26 04:19:17,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-26 04:19:17,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:19:17,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:19:17,691 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:19:17,691 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-26 04:19:17,691 INFO L794 eck$LassoCheckResult]: Stem: 1047#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1046#L-1 havoc main_#res;havoc main_#t~nondet21; 1029#L578 assume !(0 != main_#t~nondet21);havoc main_#t~nondet21;f_#in~d := 2;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~malloc5.base, f_#t~malloc5.offset, f_#t~malloc6.base, f_#t~malloc6.offset, f_#t~mem7, f_#t~mem10, f_#t~mem8, f_#t~mem9, f_#t~nondet14, f_#t~mem15, f_#t~mem16, f_#t~nondet17, f_#t~mem18, f_#t~mem19, f_#t~mem20, f_#t~mem11, f_#t~mem12, f_#t~short13, f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, f_~x~0.base, f_~x~0.offset, f_~y~0.base, f_~y~0.offset, f_~k~0.base, f_~k~0.offset, f_~z~0.base, f_~z~0.offset;f_~d := f_#in~d;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~d_ref~0.base, f_~d_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~x~0.base, f_~x~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~y~0.base, f_~y~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call f_#t~malloc5.base, f_#t~malloc5.offset := #Ultimate.allocOnStack(4);f_~k~0.base, f_~k~0.offset := f_#t~malloc5.base, f_#t~malloc5.offset;call f_#t~malloc6.base, f_#t~malloc6.offset := #Ultimate.allocOnStack(4);f_~z~0.base, f_~z~0.offset := f_#t~malloc6.base, f_#t~malloc6.offset;call write~int(f_~d, f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(1, f_~x~0.base, f_~x~0.offset, 4);call write~int(1, f_~y~0.base, f_~y~0.offset, 4);call write~int(1, f_~k~0.base, f_~k~0.offset, 4);call write~int(1, f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem7 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1026#L558-1 assume !(f_#t~mem7 > 1073741823);havoc f_#t~mem7; 1027#L562-5 call f_#t~mem8 := read~int(f_~z~0.base, f_~z~0.offset, 4);call f_#t~mem9 := read~int(f_~k~0.base, f_~k~0.offset, 4); 1028#L562-3 assume !(f_#t~mem8 < f_#t~mem9);havoc f_#t~mem9;havoc f_#t~mem8; 1048#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1049#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1053#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1044#L567-3 assume !(0 != f_#t~nondet14);havoc f_#t~nondet14;call f_#t~mem19 := read~int(f_~y~0.base, f_~y~0.offset, 4);call f_#t~mem20 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem19 - f_#t~mem20, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~mem19;havoc f_#t~mem20; 1045#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1050#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1052#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1043#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1033#L568-1 [2020-10-26 04:19:17,692 INFO L796 eck$LassoCheckResult]: Loop: 1033#L568-1 call f_#t~mem15 := read~int(f_~x~0.base, f_~x~0.offset, 4);call f_#t~mem16 := read~int(f_~d_ref~0.base, f_~d_ref~0.offset, 4);call write~int(f_#t~mem15 - f_#t~mem16, f_~x~0.base, f_~x~0.offset, 4);havoc f_#t~mem15;havoc f_#t~mem16;call write~int(f_#t~nondet17, f_~y~0.base, f_~y~0.offset, 4);havoc f_#t~nondet17;call f_#t~mem18 := read~int(f_~z~0.base, f_~z~0.offset, 4);call write~int(f_#t~mem18 - 1, f_~z~0.base, f_~z~0.offset, 4);havoc f_#t~mem18; 1034#L567-5 call f_#t~mem11 := read~int(f_~x~0.base, f_~x~0.offset, 4);f_#t~short13 := f_#t~mem11 > 0; 1056#L566-5 assume f_#t~short13;call f_#t~mem12 := read~int(f_~y~0.base, f_~y~0.offset, 4);f_#t~short13 := f_#t~mem12 > 0; 1055#L566-7 assume !!f_#t~short13;havoc f_#t~mem11;havoc f_#t~short13;havoc f_#t~mem12; 1054#L567-3 assume 0 != f_#t~nondet14;havoc f_#t~nondet14; 1033#L568-1 [2020-10-26 04:19:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash 122778203, now seen corresponding path program 1 times [2020-10-26 04:19:17,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:17,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732523220] [2020-10-26 04:19:17,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:17,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732523220] [2020-10-26 04:19:17,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124806315] [2020-10-26 04:19:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:19:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:19:17,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2020-10-26 04:19:17,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:19:18,014 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:18,015 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 101 [2020-10-26 04:19:18,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 04:19:18,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:18,020 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:18,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:18,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-26 04:19:18,086 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 36 [2020-10-26 04:19:18,087 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:18,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:18,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:18,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:305, output treesize:76 [2020-10-26 04:19:18,446 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2020-10-26 04:19:18,447 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-26 04:19:18,491 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-26 04:19:18,514 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-10-26 04:19:18,515 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:99, output treesize:84 [2020-10-26 04:19:18,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 04:19:18,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 04:19:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:19:18,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:19:18,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-26 04:19:18,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026745694] [2020-10-26 04:19:18,956 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:19:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:19:18,956 INFO L82 PathProgramCache]: Analyzing trace with hash 114981600, now seen corresponding path program 1 times [2020-10-26 04:19:18,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:19:18,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329241095] [2020-10-26 04:19:18,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:19:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:18,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:19:18,972 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:19:18,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:19:19,207 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-10-26 04:19:19,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:19:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:19:19,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:19:19,297 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-10-26 04:19:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:19:19,428 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2020-10-26 04:19:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 04:19:19,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 24 transitions. [2020-10-26 04:19:19,430 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:19:19,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2020-10-26 04:19:19,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:19:19,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:19:19,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:19:19,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:19:19,431 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:19:19,431 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:19:19,431 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:19:19,431 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-26 04:19:19,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:19:19,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:19:19,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:19:19,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:19:19 BoogieIcfgContainer [2020-10-26 04:19:19,438 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:19:19,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:19:19,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:19:19,439 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:19:19,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:18:57" (3/4) ... [2020-10-26 04:19:19,442 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:19:19,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:19:19,443 INFO L168 Benchmark]: Toolchain (without parser) took 23822.19 ms. Allocated memory was 48.2 MB in the beginning and 151.0 MB in the end (delta: 102.8 MB). Free memory was 24.3 MB in the beginning and 75.9 MB in the end (delta: -51.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,444 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 48.2 MB. Free memory was 32.8 MB in the beginning and 32.7 MB in the end (delta: 34.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:19:19,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.95 ms. Allocated memory is still 48.2 MB. Free memory was 23.6 MB in the beginning and 25.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.21 ms. Allocated memory is still 48.2 MB. Free memory was 25.4 MB in the beginning and 23.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,445 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 21.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,446 INFO L168 Benchmark]: RCFGBuilder took 775.73 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 21.7 MB in the beginning and 34.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,446 INFO L168 Benchmark]: BuchiAutomizer took 22355.93 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 34.4 MB in the beginning and 77.0 MB in the end (delta: -42.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,447 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 151.0 MB. Free memory was 77.0 MB in the beginning and 75.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:19:19,450 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 48.2 MB. Free memory was 32.8 MB in the beginning and 32.7 MB in the end (delta: 34.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.95 ms. Allocated memory is still 48.2 MB. Free memory was 23.6 MB in the beginning and 25.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 56.21 ms. Allocated memory is still 48.2 MB. Free memory was 25.4 MB in the beginning and 23.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 21.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 775.73 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 21.7 MB in the beginning and 34.7 MB in the end (delta: -13.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 22355.93 ms. Allocated memory was 58.7 MB in the beginning and 151.0 MB in the end (delta: 92.3 MB). Free memory was 34.4 MB in the beginning and 77.0 MB in the end (delta: -42.6 MB). Peak memory consumption was 48.4 MB. Max. memory is 16.1 GB. * Witness Printer took 3.97 ms. Allocated memory is still 151.0 MB. Free memory was 77.0 MB in the beginning and 75.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 17.3s. Construction of modules took 2.5s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 98 SDtfs, 94 SDslu, 121 SDs, 0 SdLazy, 207 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital546 mio100 ax103 hnf100 lsp94 ukn44 mio100 lsp37 div100 bol100 ite100 ukn100 eq198 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...