./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:32:31,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:32:31,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:32:31,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:32:31,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:32:31,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:32:31,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:32:31,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:32:31,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:32:31,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:32:31,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:32:31,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:32:31,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:32:31,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:32:31,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:32:31,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:32:31,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:32:31,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:32:31,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:32:31,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:32:31,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:32:31,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:32:31,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:32:31,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:32:31,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:32:31,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:32:31,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:32:31,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:32:31,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:32:31,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:32:31,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:32:31,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:32:31,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:32:31,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:32:31,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:32:31,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:32:31,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:32:31,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:32:31,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:32:31,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:32:31,936 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:32:31,936 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-12-07 17:32:31,947 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:32:31,948 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:32:31,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:32:31,949 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 17:32:31,949 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 17:32:31,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 17:32:31,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 17:32:31,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 17:32:31,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:32:31,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:32:31,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:32:31,952 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 17:32:31,952 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 17:32:31,952 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-12-07 17:32:32,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:32:32,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:32:32,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:32:32,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:32:32,062 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:32:32,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-12-07 17:32:32,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/data/ab9a3b445/ac25eec3e1714154a4bf45a5a824c162/FLAG21e2e32b9 [2019-12-07 17:32:32,540 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:32:32,540 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-12-07 17:32:32,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/data/ab9a3b445/ac25eec3e1714154a4bf45a5a824c162/FLAG21e2e32b9 [2019-12-07 17:32:32,561 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/data/ab9a3b445/ac25eec3e1714154a4bf45a5a824c162 [2019-12-07 17:32:32,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:32:32,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:32:32,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:32:32,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:32:32,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:32:32,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495175ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32, skipping insertion in model container [2019-12-07 17:32:32,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:32:32,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:32:32,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:32:32,832 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:32:32,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:32:32,899 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:32:32,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32 WrapperNode [2019-12-07 17:32:32,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:32:32,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:32:32,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:32:32,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:32:32,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:32:32,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:32:32,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:32:32,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:32:32,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... [2019-12-07 17:32:32,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:32:32,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:32:32,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:32:32,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:32:32,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:32:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:32:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:32:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:32:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:32:32,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:32:33,120 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:32:33,120 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 17:32:33,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:32:33 BoogieIcfgContainer [2019-12-07 17:32:33,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:32:33,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 17:32:33,121 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 17:32:33,123 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 17:32:33,124 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:32:33,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 05:32:32" (1/3) ... [2019-12-07 17:32:33,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d67aa07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:32:33, skipping insertion in model container [2019-12-07 17:32:33,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:32:33,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:32:32" (2/3) ... [2019-12-07 17:32:33,125 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d67aa07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 05:32:33, skipping insertion in model container [2019-12-07 17:32:33,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 17:32:33,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:32:33" (3/3) ... [2019-12-07 17:32:33,126 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-12-07 17:32:33,155 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 17:32:33,156 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 17:32:33,156 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 17:32:33,156 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:32:33,156 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:32:33,156 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 17:32:33,156 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:32:33,156 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 17:32:33,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 17:32:33,183 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 17:32:33,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:33,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:33,189 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 17:32:33,189 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:32:33,189 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 17:32:33,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-12-07 17:32:33,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-12-07 17:32:33,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:33,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:33,191 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 17:32:33,191 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-12-07 17:32:33,196 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-12-07 17:32:33,196 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-12-07 17:32:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-12-07 17:32:33,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:33,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737134388] [2019-12-07 17:32:33,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,292 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-12-07 17:32:33,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:33,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696738281] [2019-12-07 17:32:33,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-12-07 17:32:33,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:33,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662838299] [2019-12-07 17:32:33,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:33,355 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:33,537 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:32:33,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:32:33,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:32:33,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:32:33,537 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:32:33,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:33,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:32:33,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:32:33,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-12-07 17:32:33,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:32:33,538 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:32:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:33,800 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:32:33,804 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:33,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:33,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:33,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:33,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:33,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:33,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:33,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:33,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:33,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:33,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:33,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:33,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:33,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:33,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:33,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:32:33,928 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-12-07 17:32:33,928 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:33,935 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:32:33,938 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 17:32:33,938 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:32:33,939 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-12-07 17:32:33,951 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-12-07 17:32:33,961 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 17:32:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:33,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:32:34,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:34,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 17:32:34,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:34,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:34,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:34,038 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 17:32:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:34,055 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:32:34,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:34,082 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-12-07 17:32:34,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-12-07 17:32:34,151 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-12-07 17:32:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 17:32:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-12-07 17:32:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-12-07 17:32:34,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-12-07 17:32:34,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:34,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-12-07 17:32:34,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:34,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-12-07 17:32:34,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:34,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-12-07 17:32:34,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:34,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-12-07 17:32:34,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-12-07 17:32:34,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 17:32:34,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-12-07 17:32:34,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:32:34,163 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-12-07 17:32:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-12-07 17:32:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-07 17:32:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 17:32:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-12-07 17:32:34,181 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-12-07 17:32:34,181 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-12-07 17:32:34,181 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 17:32:34,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-12-07 17:32:34,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:34,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:34,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:34,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:34,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:34,182 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-12-07 17:32:34,182 INFO L796 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 130#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 128#L378-2 [2019-12-07 17:32:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-12-07 17:32:34,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:34,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471392393] [2019-12-07 17:32:34,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:34,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471392393] [2019-12-07 17:32:34,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:34,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:32:34,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150490923] [2019-12-07 17:32:34,218 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:32:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-12-07 17:32:34,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:34,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706215528] [2019-12-07 17:32:34,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,229 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:34,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:34,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:32:34,292 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-12-07 17:32:34,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:34,311 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-12-07 17:32:34,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:32:34,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-12-07 17:32:34,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:34,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 17:32:34,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-12-07 17:32:34,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-12-07 17:32:34,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-12-07 17:32:34,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 17:32:34,313 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 17:32:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-12-07 17:32:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-12-07 17:32:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 17:32:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-12-07 17:32:34,315 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 17:32:34,315 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-12-07 17:32:34,315 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 17:32:34,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-12-07 17:32:34,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:34,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:34,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:34,316 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:34,316 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:34,316 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 158#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-12-07 17:32:34,316 INFO L796 eck$LassoCheckResult]: Loop: 161#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 163#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 161#L378-2 [2019-12-07 17:32:34,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-12-07 17:32:34,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:34,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936318804] [2019-12-07 17:32:34,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:34,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:34,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-12-07 17:32:34,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:34,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711469950] [2019-12-07 17:32:34,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,352 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-12-07 17:32:34,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:34,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507376837] [2019-12-07 17:32:34,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:34,386 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:34,712 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 17:32:34,714 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:32:34,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:32:34,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:32:34,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:32:34,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:32:34,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:34,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:32:34,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:32:34,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-12-07 17:32:34,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:32:34,715 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:32:34,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,881 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-07 17:32:34,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:34,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:35,125 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:32:35,125 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:35,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:35,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:35,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:35,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:35,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:35,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:35,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:35,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,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 [2019-12-07 17:32:35,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,143 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:35,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:35,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:35,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:35,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:35,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:35,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:35,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:35,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:35,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:35,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:35,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:35,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:35,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:35,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:35,192 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:32:35,214 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-12-07 17:32:35,214 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:35,217 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:32:35,223 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 17:32:35,223 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:32:35,223 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-12-07 17:32:35,232 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 17:32:35,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:35,247 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:32:35,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:35,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:32:35,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:35,258 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-12-07 17:32:35,259 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-12-07 17:32:35,267 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-12-07 17:32:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 17:32:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 17:32:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-12-07 17:32:35,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-12-07 17:32:35,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:35,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-12-07 17:32:35,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:35,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-12-07 17:32:35,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:35,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-12-07 17:32:35,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-12-07 17:32:35,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-12-07 17:32:35,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 17:32:35,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-12-07 17:32:35,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:32:35,270 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-12-07 17:32:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-12-07 17:32:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 17:32:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 17:32:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-12-07 17:32:35,272 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-12-07 17:32:35,272 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-12-07 17:32:35,272 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 17:32:35,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-12-07 17:32:35,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:35,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:35,273 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:35,273 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:35,273 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 254#L367 assume !(main_~length~0 < 1); 265#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 266#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 267#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 255#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 256#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 268#L370-3 assume !(main_~i~0 < main_~length~0); 257#L370-4 main_~j~0 := 0; 258#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 264#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 260#L378-2 [2019-12-07 17:32:35,273 INFO L796 eck$LassoCheckResult]: Loop: 260#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 261#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 260#L378-2 [2019-12-07 17:32:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-12-07 17:32:35,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989877458] [2019-12-07 17:32:35,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,303 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-12-07 17:32:35,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673243063] [2019-12-07 17:32:35,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-12-07 17:32:35,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582594339] [2019-12-07 17:32:35,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:32:35,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582594339] [2019-12-07 17:32:35,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381952363] [2019-12-07 17:32:35,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:35,364 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:32:35,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:32:35,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:32:35,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-12-07 17:32:35,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848432046] [2019-12-07 17:32:35,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:32:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:32:35,410 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-12-07 17:32:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:35,419 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-12-07 17:32:35,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:32:35,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-12-07 17:32:35,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-12-07 17:32:35,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 17:32:35,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 17:32:35,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-12-07 17:32:35,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:32:35,421 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-12-07 17:32:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-12-07 17:32:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-12-07 17:32:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 17:32:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-12-07 17:32:35,422 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-12-07 17:32:35,422 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-12-07 17:32:35,422 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 17:32:35,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-12-07 17:32:35,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:35,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:35,423 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:35,423 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:35,423 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 340#L367 assume !(main_~length~0 < 1); 347#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 348#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 349#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 337#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 338#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 350#L370-3 assume !(main_~i~0 < main_~length~0); 341#L370-4 main_~j~0 := 0; 342#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 344#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 345#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 346#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 351#L378-2 [2019-12-07 17:32:35,423 INFO L796 eck$LassoCheckResult]: Loop: 351#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 352#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 351#L378-2 [2019-12-07 17:32:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-12-07 17:32:35,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232875477] [2019-12-07 17:32:35,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:35,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232875477] [2019-12-07 17:32:35,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486166392] [2019-12-07 17:32:35,497 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:35,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:32:35,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:32:35,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:32:35,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:35,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:32:35,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-12-07 17:32:35,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295884981] [2019-12-07 17:32:35,550 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:32:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-12-07 17:32:35,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481104085] [2019-12-07 17:32:35,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:35,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:32:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:32:35,597 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-12-07 17:32:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:35,701 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-12-07 17:32:35,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:32:35,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-12-07 17:32:35,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-12-07 17:32:35,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-12-07 17:32:35,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-12-07 17:32:35,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-12-07 17:32:35,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:32:35,703 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-12-07 17:32:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-12-07 17:32:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-12-07 17:32:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 17:32:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-12-07 17:32:35,704 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-12-07 17:32:35,704 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-12-07 17:32:35,704 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 17:32:35,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-12-07 17:32:35,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:35,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:35,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:35,705 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:35,705 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:35,705 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 450#L367 assume !(main_~length~0 < 1); 459#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 460#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 461#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 464#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 462#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 463#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 447#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 448#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 465#L370-3 assume !(main_~i~0 < main_~length~0); 451#L370-4 main_~j~0 := 0; 452#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 457#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 456#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 458#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 454#L378-2 [2019-12-07 17:32:35,705 INFO L796 eck$LassoCheckResult]: Loop: 454#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 455#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 454#L378-2 [2019-12-07 17:32:35,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-12-07 17:32:35,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016439553] [2019-12-07 17:32:35,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:35,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-12-07 17:32:35,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984190112] [2019-12-07 17:32:35,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,758 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:35,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-12-07 17:32:35,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:35,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576749390] [2019-12-07 17:32:35,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:35,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:36,129 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2019-12-07 17:32:36,424 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-12-07 17:32:36,426 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 17:32:36,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 17:32:36,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 17:32:36,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 17:32:36,426 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 17:32:36,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:36,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 17:32:36,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 17:32:36,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-12-07 17:32:36,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 17:32:36,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 17:32:36,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 17:32:36,756 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 17:32:36,757 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:36,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 [2019-12-07 17:32:36,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:36,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:36,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:36,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:36,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:36,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 17:32:36,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 17:32:36,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 17:32:36,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:36,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:36,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:36,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:36,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 17:32:36,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:36,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:36,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:36,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:36,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:36,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:36,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:36,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:36,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 17:32:36,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 17:32:36,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 17:32:36,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 17:32:36,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 17:32:36,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 17:32:36,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 17:32:36,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 17:32:36,856 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 17:32:36,856 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/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 [2019-12-07 17:32:36,858 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 17:32:36,860 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-12-07 17:32:36,860 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 17:32:36,860 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 10 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 + 8 >= 0] [2019-12-07 17:32:36,876 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-12-07 17:32:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:36,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:32:36,904 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:36,907 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-12-07 17:32:36,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:36,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:36,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:36,910 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:32:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:36,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:32:36,968 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:36,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-12-07 17:32:36,980 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-12-07 17:32:37,083 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 35 states and 47 transitions. Complement of second has 11 states. [2019-12-07 17:32:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-12-07 17:32:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 17:32:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2019-12-07 17:32:37,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2019-12-07 17:32:37,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:37,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2019-12-07 17:32:37,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:37,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2019-12-07 17:32:37,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 17:32:37,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-12-07 17:32:37,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:37,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2019-12-07 17:32:37,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-12-07 17:32:37,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-12-07 17:32:37,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-12-07 17:32:37,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:32:37,087 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-12-07 17:32:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-12-07 17:32:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-12-07 17:32:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 17:32:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-12-07 17:32:37,090 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 17:32:37,090 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-12-07 17:32:37,090 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 17:32:37,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-12-07 17:32:37,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 17:32:37,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:37,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:37,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:37,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 17:32:37,091 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 635#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 636#L367 assume !(main_~length~0 < 1); 645#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 646#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 649#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 654#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 650#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 651#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 652#L370-3 assume !(main_~i~0 < main_~length~0); 653#L370-4 main_~j~0 := 0; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 644#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 640#L378-2 [2019-12-07 17:32:37,092 INFO L796 eck$LassoCheckResult]: Loop: 640#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 641#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 640#L378-2 [2019-12-07 17:32:37,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:37,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-12-07 17:32:37,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:37,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828149779] [2019-12-07 17:32:37,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:32:37,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828149779] [2019-12-07 17:32:37,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875511450] [2019-12-07 17:32:37,348 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:37,376 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-07 17:32:37,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:32:37,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:32:37,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:32:37,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 17:32:37,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:37,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:37,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:32:37,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-12-07 17:32:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:32:37,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:32:37,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-12-07 17:32:37,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492796224] [2019-12-07 17:32:37,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 17:32:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-12-07 17:32:37,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:37,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116935780] [2019-12-07 17:32:37,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:37,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:32:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:32:37,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:32:37,494 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 16 states. [2019-12-07 17:32:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:32:37,622 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-12-07 17:32:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:32:37,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-12-07 17:32:37,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 17:32:37,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2019-12-07 17:32:37,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 17:32:37,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-12-07 17:32:37,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2019-12-07 17:32:37,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-12-07 17:32:37,624 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-12-07 17:32:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2019-12-07 17:32:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-12-07 17:32:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 17:32:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-12-07 17:32:37,627 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-12-07 17:32:37,627 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-12-07 17:32:37,627 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 17:32:37,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-12-07 17:32:37,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-12-07 17:32:37,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 17:32:37,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 17:32:37,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:32:37,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-12-07 17:32:37,628 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 782#L367 assume !(main_~length~0 < 1); 792#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 793#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 794#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 798#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 802#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 799#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 800#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 795#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 796#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 783#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 784#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 801#L370-3 assume !(main_~i~0 < main_~length~0); 785#L370-4 main_~j~0 := 0; 786#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 788#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 789#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 791#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-12-07 17:32:37,628 INFO L796 eck$LassoCheckResult]: Loop: 810#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 805#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 813#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-12-07 17:32:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2019-12-07 17:32:37,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:37,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649828253] [2019-12-07 17:32:37,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:37,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-12-07 17:32:37,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:37,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037370134] [2019-12-07 17:32:37,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,659 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:32:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2019-12-07 17:32:37,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:32:37,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309470008] [2019-12-07 17:32:37,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:32:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:32:37,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:32:38,183 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 144 [2019-12-07 17:32:39,134 WARN L192 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 78 [2019-12-07 17:32:39,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 05:32:39 BoogieIcfgContainer [2019-12-07 17:32:39,156 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 17:32:39,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:32:39,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:32:39,156 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:32:39,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:32:33" (3/4) ... [2019-12-07 17:32:39,159 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-12-07 17:32:39,190 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ba77685-fbfc-4fec-9c66-0a7519c58a4b/bin/uautomizer/witness.graphml [2019-12-07 17:32:39,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:32:39,191 INFO L168 Benchmark]: Toolchain (without parser) took 6626.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 942.0 MB in the beginning and 873.9 MB in the end (delta: 68.1 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,191 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:32:39,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,192 INFO L168 Benchmark]: Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,192 INFO L168 Benchmark]: RCFGBuilder took 175.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,193 INFO L168 Benchmark]: BuchiAutomizer took 6034.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 876.4 MB in the end (delta: 196.1 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,193 INFO L168 Benchmark]: Witness Printer took 34.04 ms. Allocated memory is still 1.2 GB. Free memory was 876.4 MB in the beginning and 873.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:39,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6034.77 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 93.3 MB). Free memory was 1.1 GB in the beginning and 876.4 MB in the end (delta: 196.1 MB). Peak memory consumption was 289.4 MB. Max. memory is 11.5 GB. * Witness Printer took 34.04 ms. Allocated memory is still 1.2 GB. Free memory was 876.4 MB in the beginning and 873.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 10 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 164 SDslu, 95 SDs, 0 SdLazy, 298 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp80 ukn92 mio100 lsp51 div161 bol100 ite100 ukn100 eq156 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@76f120c7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2311b881=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30fa8597=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@6d02ebc9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30fa8597=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5baf131f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@5583b75b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7fbb53bc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@13bddfb0=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i