./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 604294306b5c2c89672e57997bbce546f96c9935 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:42:57,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:42:57,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:42:57,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:42:57,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:42:57,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:42:57,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:42:57,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:42:57,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:42:57,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:42:57,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:42:57,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:42:57,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:42:57,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:42:57,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:42:57,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:42:57,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:42:57,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:42:57,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:42:57,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:42:57,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:42:57,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:42:57,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:42:57,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:42:57,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:42:57,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:42:57,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:42:57,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:42:57,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:42:57,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:42:57,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:42:57,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:42:57,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:42:57,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:42:57,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:42:57,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:42:57,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:42:57,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:42:57,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:42:57,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:42:57,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:42:57,988 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:42:58,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:42:58,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:42:58,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:42:58,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:42:58,032 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:42:58,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:42:58,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:42:58,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:42:58,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:42:58,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:42:58,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:42:58,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:42:58,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:42:58,034 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:42:58,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:42:58,035 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:42:58,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:42:58,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:42:58,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:42:58,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:42:58,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:42:58,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:42:58,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:42:58,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:42:58,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:42:58,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:42:58,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:42:58,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:42:58,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/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(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 604294306b5c2c89672e57997bbce546f96c9935 [2019-11-15 20:42:58,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:42:58,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:42:58,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:42:58,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:42:58,100 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:42:58,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-15 20:42:58,178 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/data/a5c81e16a/146a1af386d04c6a8064faeee93854a6/FLAG68cf3d86d [2019-11-15 20:42:58,595 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:42:58,596 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-15 20:42:58,602 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/data/a5c81e16a/146a1af386d04c6a8064faeee93854a6/FLAG68cf3d86d [2019-11-15 20:42:59,004 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/data/a5c81e16a/146a1af386d04c6a8064faeee93854a6 [2019-11-15 20:42:59,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:42:59,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:42:59,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:59,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:42:59,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:42:59,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@538b3fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59, skipping insertion in model container [2019-11-15 20:42:59,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,025 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:42:59,052 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:42:59,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:59,427 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:42:59,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:42:59,485 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:42:59,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59 WrapperNode [2019-11-15 20:42:59,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:42:59,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:59,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:42:59,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:42:59,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:42:59,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:42:59,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:42:59,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:42:59,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... [2019-11-15 20:42:59,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:42:59,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:42:59,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:42:59,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:42:59,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:42:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:42:59,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:42:59,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:42:59,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:42:59,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:42:59,973 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:42:59,973 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:42:59,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:59 BoogieIcfgContainer [2019-11-15 20:42:59,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:42:59,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:42:59,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:42:59,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:42:59,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:42:59" (1/3) ... [2019-11-15 20:42:59,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea265b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:59, skipping insertion in model container [2019-11-15 20:42:59,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:42:59" (2/3) ... [2019-11-15 20:42:59,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea265b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:42:59, skipping insertion in model container [2019-11-15 20:42:59,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:59" (3/3) ... [2019-11-15 20:42:59,983 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-15 20:42:59,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:43:00,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 20:43:00,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 20:43:00,056 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:43:00,056 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:43:00,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:43:00,057 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:43:00,057 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:43:00,057 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:43:00,057 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:43:00,057 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:43:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-11-15 20:43:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:43:00,081 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,082 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:00,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -551124073, now seen corresponding path program 1 times [2019-11-15 20:43:00,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867895695] [2019-11-15 20:43:00,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:00,369 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 20:43:00,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867895695] [2019-11-15 20:43:00,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:00,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:43:00,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113570074] [2019-11-15 20:43:00,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:00,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:00,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:00,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,398 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2019-11-15 20:43:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,439 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2019-11-15 20:43:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:00,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 20:43:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,454 INFO L225 Difference]: With dead ends: 46 [2019-11-15 20:43:00,455 INFO L226 Difference]: Without dead ends: 29 [2019-11-15 20:43:00,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-15 20:43:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-11-15 20:43:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 20:43:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-15 20:43:00,493 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2019-11-15 20:43:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,493 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-15 20:43:00,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-11-15 20:43:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:43:00,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,495 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:00,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2085816175, now seen corresponding path program 1 times [2019-11-15 20:43:00,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862775059] [2019-11-15 20:43:00,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:00,542 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 20:43:00,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862775059] [2019-11-15 20:43:00,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:00,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:43:00,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130823791] [2019-11-15 20:43:00,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:00,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,546 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-11-15 20:43:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,613 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-11-15 20:43:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:00,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 20:43:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,616 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:43:00,616 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 20:43:00,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 20:43:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-11-15 20:43:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 20:43:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-15 20:43:00,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2019-11-15 20:43:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,624 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 20:43:00,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-15 20:43:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:43:00,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:00,625 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-11-15 20:43:00,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990391877] [2019-11-15 20:43:00,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:00,691 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 20:43:00,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990391877] [2019-11-15 20:43:00,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:00,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:43:00,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420998125] [2019-11-15 20:43:00,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:43:00,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:43:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:43:00,694 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-11-15 20:43:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,762 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-11-15 20:43:00,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:43:00,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 20:43:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,768 INFO L225 Difference]: With dead ends: 47 [2019-11-15 20:43:00,768 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 20:43:00,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:43:00,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 20:43:00,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-11-15 20:43:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-15 20:43:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-15 20:43:00,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2019-11-15 20:43:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,781 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-15 20:43:00,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:43:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-15 20:43:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 20:43:00,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:00,783 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1997962921, now seen corresponding path program 1 times [2019-11-15 20:43:00,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244967219] [2019-11-15 20:43:00,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:00,850 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 20:43:00,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244967219] [2019-11-15 20:43:00,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:00,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:43:00,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145629007] [2019-11-15 20:43:00,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:43:00,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:43:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,852 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-11-15 20:43:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:00,897 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-15 20:43:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:43:00,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 20:43:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:00,899 INFO L225 Difference]: With dead ends: 50 [2019-11-15 20:43:00,899 INFO L226 Difference]: Without dead ends: 30 [2019-11-15 20:43:00,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:43:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-15 20:43:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 20:43:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:43:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-11-15 20:43:00,905 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2019-11-15 20:43:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:00,905 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 20:43:00,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:43:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-11-15 20:43:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:43:00,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:00,907 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:00,908 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 588886092, now seen corresponding path program 1 times [2019-11-15 20:43:00,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:00,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171191767] [2019-11-15 20:43:00,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:00,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:01,435 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2019-11-15 20:43:01,763 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-11-15 20:43:01,846 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 20:43:01,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171191767] [2019-11-15 20:43:01,851 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:01,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:43:01,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739558265] [2019-11-15 20:43:01,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:43:01,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:01,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:43:01,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:01,854 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 8 states. [2019-11-15 20:43:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:02,220 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-15 20:43:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:43:02,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-15 20:43:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:02,222 INFO L225 Difference]: With dead ends: 40 [2019-11-15 20:43:02,222 INFO L226 Difference]: Without dead ends: 25 [2019-11-15 20:43:02,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:43:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-15 20:43:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-15 20:43:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 20:43:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-15 20:43:02,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2019-11-15 20:43:02,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:02,233 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-15 20:43:02,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:43:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-15 20:43:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:43:02,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:02,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:02,235 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:02,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:02,236 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2019-11-15 20:43:02,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:02,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176913821] [2019-11-15 20:43:02,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:02,332 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 20:43:02,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176913821] [2019-11-15 20:43:02,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:43:02,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:43:02,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027261285] [2019-11-15 20:43:02,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:43:02,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:02,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:43:02,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:43:02,335 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2019-11-15 20:43:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:02,418 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-15 20:43:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:43:02,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-15 20:43:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:02,419 INFO L225 Difference]: With dead ends: 38 [2019-11-15 20:43:02,420 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 20:43:02,420 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:43:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 20:43:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-11-15 20:43:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 20:43:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-15 20:43:02,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-11-15 20:43:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:02,426 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-15 20:43:02,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:43:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-15 20:43:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 20:43:02,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:43:02,428 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:43:02,428 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:43:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:43:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1016031163, now seen corresponding path program 1 times [2019-11-15 20:43:02,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:43:02,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389530164] [2019-11-15 20:43:02,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:43:02,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:43:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:02,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389530164] [2019-11-15 20:43:02,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012193998] [2019-11-15 20:43:02,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/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 20:43:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:43:02,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:43:02,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:43:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:43:02,791 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:43:02,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-11-15 20:43:02,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920624587] [2019-11-15 20:43:02,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:43:02,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:43:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:43:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:43:02,796 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2019-11-15 20:43:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:43:05,355 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-11-15 20:43:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:43:05,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-15 20:43:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:43:05,357 INFO L225 Difference]: With dead ends: 26 [2019-11-15 20:43:05,357 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:43:05,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:43:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:43:05,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:43:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:43:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:43:05,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-15 20:43:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:43:05,359 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:43:05,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:43:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:43:05,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:43:05,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:43:05,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:43:05,719 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-15 20:43:06,129 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-15 20:43:06,419 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-15 20:43:06,529 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-11-15 20:43:06,529 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (let ((.cse6 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse5 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (or (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse6 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse3 (select .cse4 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse5 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse1 (+ .cse2 (* 4294967296 (div .cse3 4294967296)))) (.cse0 (+ (* 4294967296 (div .cse2 4294967296)) .cse3))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))))) (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 .cse6)) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse5)))))) (= ULTIMATE.start_main_~main__loop_entered~0 0)) [2019-11-15 20:43:06,530 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-11-15 20:43:06,530 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-11-15 20:43:06,531 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse9 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse6))) (.cse8 (* 4294967296 .cse7)) (.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) .cse0 (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse3 (select .cse5 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse7 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse4 (select .cse5 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse6 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse4 4294967296)))) (.cse1 (+ (* 4294967296 (div .cse3 4294967296)) .cse4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8) .cse9))) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8 1) .cse9) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse8 99999)) .cse0)))) [2019-11-15 20:43:06,531 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-15 20:43:06,531 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:43:06,531 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:43:06,531 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:43:06,531 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-11-15 20:43:06,532 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-11-15 20:43:06,532 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)) 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))) [2019-11-15 20:43:06,532 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-11-15 20:43:06,532 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-11-15 20:43:06,533 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-11-15 20:43:06,533 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (let ((.cse1 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and .cse1 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) .cse2) (and .cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))))))) [2019-11-15 20:43:06,533 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-11-15 20:43:06,533 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 20:43:06,533 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-11-15 20:43:06,534 INFO L446 ceAbstractionStarter]: At program point L161(lines 9 163) the Hoare annotation is: true [2019-11-15 20:43:06,534 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:43:06,534 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-11-15 20:43:06,534 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-11-15 20:43:06,534 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2019-11-15 20:43:06,534 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-11-15 20:43:06,535 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-11-15 20:43:06,535 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-11-15 20:43:06,535 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-15 20:43:06,535 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 20:43:06,535 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-15 20:43:06,535 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-11-15 20:43:06,556 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,557 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,558 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,578 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,592 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,599 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,604 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,604 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:43:06 BoogieIcfgContainer [2019-11-15 20:43:06,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:43:06,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:43:06,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:43:06,610 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:43:06,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:42:59" (3/4) ... [2019-11-15 20:43:06,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:43:06,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-15 20:43:06,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-15 20:43:06,724 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_df6262c6-98c7-4c31-a5d0-9e1200ac9a83/bin/uautomizer/witness.graphml [2019-11-15 20:43:06,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:43:06,726 INFO L168 Benchmark]: Toolchain (without parser) took 7717.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:43:06,726 INFO L168 Benchmark]: CDTParser took 0.31 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 20:43:06,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 477.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:06,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.86 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 20:43:06,728 INFO L168 Benchmark]: Boogie Preprocessor took 26.52 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 20:43:06,728 INFO L168 Benchmark]: RCFGBuilder took 397.89 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:06,729 INFO L168 Benchmark]: TraceAbstraction took 6632.79 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: -25.0 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:06,729 INFO L168 Benchmark]: Witness Printer took 115.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:43:06,731 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.31 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 477.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.1 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.86 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. * Boogie Preprocessor took 26.52 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. * RCFGBuilder took 397.89 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6632.79 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: -25.0 MB). Peak memory consumption was 236.5 MB. Max. memory is 11.5 GB. * Witness Printer took 115.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main____CPAchecker_TMP_0 == 1) && 1 == __VERIFIER_assert__cond) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0))) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant [2019-11-15 20:43:06,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,747 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,750 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1 && 1 == __VERIFIER_assert__cond) && ((4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-11-15 20:43:06,752 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,753 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,754 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,756 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:43:06,757 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1 && 1 == __VERIFIER_assert__cond) && ((4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || (((!(0 == __VERIFIER_assert__cond) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && 4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 3 error locations. Result: SAFE, OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 172 SDtfs, 180 SDslu, 193 SDs, 0 SdLazy, 151 SolverSat, 14 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 21 NumberOfFragments, 526 HoareAnnotationTreeSize, 9 FomulaSimplifications, 508 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 19844 SizeOfPredicates, 2 NumberOfNonLiveVariables, 83 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...