./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/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.24-cad4683 [2019-11-15 23:32:42,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:32:42,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:32:42,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:32:42,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:32:42,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:32:42,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:32:42,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:32:42,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:32:42,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:32:42,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:32:42,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:32:42,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:32:42,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:32:42,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:32:42,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:32:42,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:32:42,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:32:42,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:32:42,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:32:42,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:32:42,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:32:42,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:32:42,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:32:43,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:32:43,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:32:43,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:32:43,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:32:43,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:32:43,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:32:43,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:32:43,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:32:43,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:32:43,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:32:43,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:32:43,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:32:43,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:32:43,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:32:43,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:32:43,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:32:43,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:32:43,011 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:32:43,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:32:43,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:32:43,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:32:43,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:32:43,038 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:32:43,038 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:32:43,038 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:32:43,038 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:32:43,039 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:32:43,039 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:32:43,039 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:32:43,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:32:43,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:32:43,041 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:32:43,041 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:32:43,041 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:32:43,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:32:43,042 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:32:43,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:32:43,042 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:32:43,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:32:43,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:32:43,043 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:32:43,043 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:32:43,044 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_df931762-d47c-4fc2-94cf-4264d9fc3507/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-11-15 23:32:43,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:32:43,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:32:43,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:32:43,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:32:43,097 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:32:43,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-15 23:32:43,148 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/data/59a31cd58/bf63bdc284ef459a93b04a44450938ab/FLAGaf51c1719 [2019-11-15 23:32:43,644 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:32:43,645 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-15 23:32:43,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/data/59a31cd58/bf63bdc284ef459a93b04a44450938ab/FLAGaf51c1719 [2019-11-15 23:32:44,170 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/data/59a31cd58/bf63bdc284ef459a93b04a44450938ab [2019-11-15 23:32:44,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:32:44,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:32:44,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:44,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:32:44,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:32:44,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acdc40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44, skipping insertion in model container [2019-11-15 23:32:44,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,195 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:32:44,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:32:44,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:44,638 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:32:44,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:32:44,764 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:32:44,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44 WrapperNode [2019-11-15 23:32:44,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:32:44,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:44,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:32:44,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:32:44,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:32:44,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:32:44,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:32:44,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:32:44,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... [2019-11-15 23:32:44,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:32:44,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:32:44,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:32:44,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:32:44,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/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-11-15 23:32:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:32:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:32:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:32:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:32:44,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:32:44,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:32:45,138 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:32:45,138 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:32:45,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:45 BoogieIcfgContainer [2019-11-15 23:32:45,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:32:45,140 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:32:45,140 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:32:45,142 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:32:45,143 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:32:45,143 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:32:44" (1/3) ... [2019-11-15 23:32:45,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e88ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:32:45, skipping insertion in model container [2019-11-15 23:32:45,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:32:45,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:32:44" (2/3) ... [2019-11-15 23:32:45,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69e88ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:32:45, skipping insertion in model container [2019-11-15 23:32:45,145 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:32:45,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:45" (3/3) ... [2019-11-15 23:32:45,146 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-15 23:32:45,195 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:32:45,195 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:32:45,195 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:32:45,195 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:32:45,196 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:32:45,196 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:32:45,196 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:32:45,196 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:32:45,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:32:45,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:32:45,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:45,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:45,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:32:45,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:32:45,243 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:32:45,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 23:32:45,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 23:32:45,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:45,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:45,245 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:32:45,245 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 23:32:45,250 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-11-15 23:32:45,251 INFO L793 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-11-15 23:32:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-15 23:32:45,261 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:45,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617604102] [2019-11-15 23:32:45,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:45,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-15 23:32:45,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:45,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778696829] [2019-11-15 23:32:45,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,403 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-15 23:32:45,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:45,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213135408] [2019-11-15 23:32:45,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:45,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:45,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:45,722 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 23:32:45,782 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:32:45,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:32:45,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:32:45,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:32:45,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:32:45,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:32:45,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:32:45,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:32:45,785 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-15 23:32:45,785 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:32:45,785 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:32:45,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:45,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:46,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:46,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:46,314 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:32:46,317 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:32:46,319 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-11-15 23:32:46,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,321 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,324 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,324 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,326 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-11-15 23:32:46,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,327 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:32:46,331 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,332 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:32:46,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,351 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:32:46,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:46,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:46,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,362 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-11-15 23:32:46,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,364 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,364 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,366 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-11-15 23:32:46,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,368 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,369 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-11-15 23:32:46,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:46,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,371 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:46,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:46,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,373 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-11-15 23:32:46,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,376 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:46,376 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:46,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:46,380 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-11-15 23:32:46,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:46,381 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:46,381 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:46,381 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:46,386 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:46,386 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:46,435 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:32:46,458 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 23:32:46,459 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:32:46,461 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:32:46,462 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:32:46,463 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:32:46,463 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 Supporting invariants [] [2019-11-15 23:32:46,478 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:32:46,486 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 23:32:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:46,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:32:46,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:46,578 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-11-15 23:32:46,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-15 23:32:46,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2019-11-15 23:32:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:32:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2019-11-15 23:32:46,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-15 23:32:46,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:46,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-15 23:32:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:46,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-15 23:32:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:46,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2019-11-15 23:32:46,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:46,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2019-11-15 23:32:46,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 23:32:46,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:32:46,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-15 23:32:46,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:32:46,662 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:32:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-15 23:32:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 23:32:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:32:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-15 23:32:46,689 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:32:46,690 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-15 23:32:46,690 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:32:46,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-15 23:32:46,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:46,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:46,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:46,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:46,693 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:46,694 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 113#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; 114#L367 assume !(main_~length~0 < 1); 121#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; 122#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 123#L370-3 assume !(main_~i~0 < main_~length~0); 117#L370-4 main_~j~0 := 0; 118#L378-2 [2019-11-15 23:32:46,694 INFO L793 eck$LassoCheckResult]: Loop: 118#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); 120#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; 118#L378-2 [2019-11-15 23:32:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-15 23:32:46,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829481813] [2019-11-15 23:32:46,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:46,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829481813] [2019-11-15 23:32:46,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:32:46,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:32:46,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319136864] [2019-11-15 23:32:46,782 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:32:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-15 23:32:46,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352497106] [2019-11-15 23:32:46,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:46,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:46,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:32:46,910 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 23:32:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:46,943 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-15 23:32:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:46,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-15 23:32:46,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:46,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 23:32:46,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 23:32:46,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 23:32:46,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 23:32:46,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:32:46,946 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 23:32:46,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 23:32:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-15 23:32:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 23:32:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-15 23:32:46,948 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:32:46,948 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-15 23:32:46,948 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:32:46,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-15 23:32:46,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:46,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:46,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:46,950 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:46,950 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:46,950 INFO L791 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#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; 147#L367 assume !(main_~length~0 < 1); 154#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; 155#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 156#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); 148#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; 149#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 157#L370-3 assume !(main_~i~0 < main_~length~0); 150#L370-4 main_~j~0 := 0; 151#L378-2 [2019-11-15 23:32:46,950 INFO L793 eck$LassoCheckResult]: Loop: 151#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); 153#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; 151#L378-2 [2019-11-15 23:32:46,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-15 23:32:46,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112561290] [2019-11-15 23:32:46,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,976 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-15 23:32:46,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976371717] [2019-11-15 23:32:46,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:46,988 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-15 23:32:46,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:46,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142951203] [2019-11-15 23:32:46,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:46,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:47,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:47,338 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-11-15 23:32:47,673 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-15 23:32:47,675 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:32:47,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:32:47,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:32:47,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:32:47,675 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:32:47,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:32:47,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:32:47,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:32:47,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-15 23:32:47,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:32:47,676 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:32:47,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,924 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-15 23:32:47,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:47,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:48,343 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:32:48,343 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:32:48,343 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-11-15 23:32:48,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:48,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:48,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:48,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:48,345 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:48,345 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:48,345 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:48,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:48,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:32:48,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:48,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:48,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:48,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:48,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:48,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:48,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:48,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:48,348 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-11-15 23:32:48,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:48,349 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:32:48,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:48,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:48,351 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:32:48,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:48,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:48,359 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-11-15 23:32:48,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:48,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:48,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:48,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:48,362 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:48,362 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:48,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:48,364 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-11-15 23:32:48,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:48,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:48,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:48,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:48,368 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:48,368 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:48,400 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:32:48,435 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:32:48,435 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-11-15 23:32:48,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:32:48,436 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:32:48,436 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:32:48,437 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-11-15 23:32:48,446 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:32:48,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:48,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:32:48,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:48,498 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-11-15 23:32:48,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 23:32:48,514 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-11-15 23:32:48,515 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-11-15 23:32:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-15 23:32:48,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 23:32:48,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:48,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-15 23:32:48,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:48,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-15 23:32:48,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:48,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-15 23:32:48,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:48,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:32:48,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 23:32:48,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:32:48,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-15 23:32:48,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:32:48,518 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:32:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-15 23:32:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 23:32:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:32:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-15 23:32:48,520 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:32:48,520 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-15 23:32:48,520 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:32:48,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-15 23:32:48,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:48,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:48,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:48,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:48,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:48,525 INFO L791 eck$LassoCheckResult]: Stem: 249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 245#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; 246#L367 assume !(main_~length~0 < 1); 255#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; 256#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 257#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); 243#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; 244#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 258#L370-3 assume !(main_~i~0 < main_~length~0); 247#L370-4 main_~j~0 := 0; 248#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); 254#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; 250#L378-2 [2019-11-15 23:32:48,525 INFO L793 eck$LassoCheckResult]: Loop: 250#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); 251#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; 250#L378-2 [2019-11-15 23:32:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-15 23:32:48,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:48,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362724722] [2019-11-15 23:32:48,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:48,579 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:48,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-15 23:32:48,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:48,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821095037] [2019-11-15 23:32:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:48,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-15 23:32:48,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:48,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828087293] [2019-11-15 23:32:48,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:32:48,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828087293] [2019-11-15 23:32:48,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398969338] [2019-11-15 23:32:48,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:32:48,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:32:48,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:32:48,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-15 23:32:48,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743287925] [2019-11-15 23:32:48,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:48,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:32:48,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:32:48,803 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 23:32:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:48,819 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-15 23:32:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:32:48,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-15 23:32:48,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:48,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-15 23:32:48,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:32:48,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:32:48,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-15 23:32:48,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:32:48,822 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-15 23:32:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-15 23:32:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-15 23:32:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 23:32:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-15 23:32:48,824 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:32:48,824 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-15 23:32:48,824 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:32:48,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-15 23:32:48,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:48,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:48,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:48,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:48,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:48,826 INFO L791 eck$LassoCheckResult]: Stem: 333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#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; 328#L367 assume !(main_~length~0 < 1); 337#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; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#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); 329#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; 330#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 331#L370-4 main_~j~0 := 0; 332#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); 334#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; 335#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); 336#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; 341#L378-2 [2019-11-15 23:32:48,826 INFO L793 eck$LassoCheckResult]: Loop: 341#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); 342#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; 341#L378-2 [2019-11-15 23:32:48,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-15 23:32:48,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:48,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683265746] [2019-11-15 23:32:48,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:48,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:48,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683265746] [2019-11-15 23:32:48,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923448176] [2019-11-15 23:32:48,973 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:49,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:32:49,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:32:49,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:32:49,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:49,085 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:32:49,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-15 23:32:49,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156688468] [2019-11-15 23:32:49,085 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:32:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-15 23:32:49,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:49,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144618338] [2019-11-15 23:32:49,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,092 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:49,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:32:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:32:49,161 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-15 23:32:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:49,347 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-15 23:32:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:32:49,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 23:32:49,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:49,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-15 23:32:49,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:32:49,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 23:32:49,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-15 23:32:49,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:32:49,349 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-15 23:32:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-15 23:32:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 23:32:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:32:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-15 23:32:49,351 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:32:49,351 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-15 23:32:49,351 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:32:49,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-15 23:32:49,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:49,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:49,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:49,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:49,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:49,353 INFO L791 eck$LassoCheckResult]: Stem: 443#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 439#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; 440#L367 assume !(main_~length~0 < 1); 449#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; 450#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 451#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); 454#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; 452#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 453#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); 437#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; 438#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 455#L370-3 assume !(main_~i~0 < main_~length~0); 441#L370-4 main_~j~0 := 0; 442#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); 448#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; 446#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); 447#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; 444#L378-2 [2019-11-15 23:32:49,353 INFO L793 eck$LassoCheckResult]: Loop: 444#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); 445#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; 444#L378-2 [2019-11-15 23:32:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-15 23:32:49,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:49,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931967391] [2019-11-15 23:32:49,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:49,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:49,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-15 23:32:49,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:49,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168711560] [2019-11-15 23:32:49,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,403 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-15 23:32:49,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:49,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241575380] [2019-11-15 23:32:49,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:49,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:49,446 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:49,911 WARN L191 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 123 [2019-11-15 23:32:50,277 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-11-15 23:32:50,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:32:50,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:32:50,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:32:50,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:32:50,278 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:32:50,278 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:32:50,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:32:50,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:32:50,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-15 23:32:50,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:32:50,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:32:50,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:32:50,855 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:32:50,855 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:32:50,855 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-11-15 23:32:50,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:50,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,856 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,856 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:50,856 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:50,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,857 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-11-15 23:32:50,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:50,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,858 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:50,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:50,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,859 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-11-15 23:32:50,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,859 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,859 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,861 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:50,861 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:50,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,862 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-11-15 23:32:50,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:50,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:50,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:50,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,865 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-11-15 23:32:50,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:50,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,866 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,866 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:50,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:50,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,867 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-11-15 23:32:50,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:32:50,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,868 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,868 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,869 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:32:50,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:32:50,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,869 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-11-15 23:32:50,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,870 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,870 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,871 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:50,871 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:50,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,873 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-11-15 23:32:50,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,874 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 23:32:50,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,874 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,875 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 23:32:50,876 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:50,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,880 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-11-15 23:32:50,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,883 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:50,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:50,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:32:50,892 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-11-15 23:32:50,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:32:50,893 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:32:50,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:32:50,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:32:50,896 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:32:50,896 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:32:50,913 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:32:50,929 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 23:32:50,929 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:32:50,929 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:32:50,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:32:50,931 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:32:50,931 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-11-15 23:32:50,959 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 23:32:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:32:50,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:50,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:32:50,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:32:51,007 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-11-15 23:32:51,008 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-15 23:32:51,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 5 states. [2019-11-15 23:32:51,023 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-11-15 23:32:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:32:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-11-15 23:32:51,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 23:32:51,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:51,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 23:32:51,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:51,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-15 23:32:51,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:32:51,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-15 23:32:51,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:51,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 23:32:51,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:32:51,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:32:51,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-11-15 23:32:51,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:32:51,026 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:32:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-11-15 23:32:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-15 23:32:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 23:32:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 23:32:51,028 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:32:51,028 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 23:32:51,028 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:32:51,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-15 23:32:51,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:32:51,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:51,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:51,030 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,030 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:32:51,030 INFO L791 eck$LassoCheckResult]: Stem: 587#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 581#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; 582#L367 assume !(main_~length~0 < 1); 593#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; 594#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 595#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); 599#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; 596#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 597#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); 583#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; 584#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 600#L370-3 assume !(main_~i~0 < main_~length~0); 585#L370-4 main_~j~0 := 0; 586#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); 591#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; 590#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); 592#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; 598#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); 601#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; 588#L378-2 [2019-11-15 23:32:51,030 INFO L793 eck$LassoCheckResult]: Loop: 588#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); 589#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; 588#L378-2 [2019-11-15 23:32:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-15 23:32:51,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484362846] [2019-11-15 23:32:51,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:32:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:32:51,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484362846] [2019-11-15 23:32:51,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104830326] [2019-11-15 23:32:51,230 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:32:51,293 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-15 23:32:51,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:32:51,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-15 23:32:51,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:32:51,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-11-15 23:32:51,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:32:51,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:32:51,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:32:51,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2019-11-15 23:32:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 23:32:51,457 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:32:51,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-15 23:32:51,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125223798] [2019-11-15 23:32:51,457 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 23:32:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-15 23:32:51,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560045431] [2019-11-15 23:32:51,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,464 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:51,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:32:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:32:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:32:51,522 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 12 states. [2019-11-15 23:32:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:32:51,609 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-15 23:32:51,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:32:51,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-15 23:32:51,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:32:51,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 46 transitions. [2019-11-15 23:32:51,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 23:32:51,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 23:32:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2019-11-15 23:32:51,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:32:51,612 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-11-15 23:32:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2019-11-15 23:32:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-11-15 23:32:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 23:32:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2019-11-15 23:32:51,617 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 23:32:51,617 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2019-11-15 23:32:51,617 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:32:51,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2019-11-15 23:32:51,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-15 23:32:51,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:32:51,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:32:51,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:32:51,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-15 23:32:51,619 INFO L791 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 712#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; 713#L367 assume !(main_~length~0 < 1); 723#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; 724#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 725#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); 714#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; 715#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 731#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); 732#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; 726#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 727#L370-3 assume !(main_~i~0 < main_~length~0); 716#L370-4 main_~j~0 := 0; 717#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); 719#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; 720#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); 721#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; 728#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); 744#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; 742#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); 739#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; 737#L378-2 [2019-11-15 23:32:51,619 INFO L793 eck$LassoCheckResult]: Loop: 737#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); 733#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; 734#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); 738#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; 737#L378-2 [2019-11-15 23:32:51,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1142942490, now seen corresponding path program 6 times [2019-11-15 23:32:51,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614798747] [2019-11-15 23:32:51,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:51,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-15 23:32:51,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97819434] [2019-11-15 23:32:51,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,676 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:32:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash -227346514, now seen corresponding path program 7 times [2019-11-15 23:32:51,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:32:51,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304407067] [2019-11-15 23:32:51,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:32:51,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:32:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:32:51,741 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:32:52,329 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 137 [2019-11-15 23:32:52,792 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-15 23:32:52,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:32:52 BoogieIcfgContainer [2019-11-15 23:32:52,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:32:52,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:32:52,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:32:52,817 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:32:52,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:32:45" (3/4) ... [2019-11-15 23:32:52,820 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:32:52,876 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_df931762-d47c-4fc2-94cf-4264d9fc3507/bin/uautomizer/witness.graphml [2019-11-15 23:32:52,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:32:52,878 INFO L168 Benchmark]: Toolchain (without parser) took 8703.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 946.1 MB in the beginning and 905.5 MB in the end (delta: 40.6 MB). Peak memory consumption was 244.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:52,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:32:52,880 INFO L168 Benchmark]: Boogie Preprocessor took 20.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,881 INFO L168 Benchmark]: RCFGBuilder took 314.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,882 INFO L168 Benchmark]: BuchiAutomizer took 7676.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 907.6 MB in the end (delta: 202.6 MB). Peak memory consumption was 250.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,882 INFO L168 Benchmark]: Witness Printer took 59.84 ms. Allocated memory is still 1.2 GB. Free memory was 907.6 MB in the beginning and 905.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:32:52,886 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 584.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 314.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7676.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.2 MB). Free memory was 1.1 GB in the beginning and 907.6 MB in the end (delta: 202.6 MB). Peak memory consumption was 250.9 MB. Max. memory is 11.5 GB. * Witness Printer took 59.84 ms. Allocated memory is still 1.2 GB. Free memory was 907.6 MB in the beginning and 905.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 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 -1 * arr + -4 * i + unknown-#length-unknown[arr] and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 79 SDtfs, 131 SDslu, 88 SDs, 0 SdLazy, 198 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax100 hnf99 lsp81 ukn94 mio100 lsp51 div154 bol100 ite100 ukn100 eq157 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@198a1451=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@c88df0e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b39141e=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@46e83118=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4b39141e=-1, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@d3cb5e7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@61a1ffec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@39cf1ba5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5394e0ce=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