./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/config/TaipanReach.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_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan --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 Taipan --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.25-f470102 [2019-12-07 21:25:01,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:25:01,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:25:01,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:25:01,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:25:01,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:25:01,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:25:01,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:25:01,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:25:01,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:25:01,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:25:01,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:25:01,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:25:01,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:25:01,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:25:01,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:25:01,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:25:01,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:25:01,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:25:01,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:25:01,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:25:01,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:25:01,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:25:01,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:25:01,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:25:01,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:25:01,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:25:01,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:25:01,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:25:01,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:25:01,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:25:01,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:25:01,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:25:01,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:25:01,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:25:01,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:25:01,606 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:25:01,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:25:01,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:25:01,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:25:01,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:25:01,608 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:25:01,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:25:01,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:25:01,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:25:01,619 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:25:01,619 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:25:01,619 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:25:01,619 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:25:01,619 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:25:01,620 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:25:01,620 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:25:01,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:25:01,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:25:01,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:25:01,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:25:01,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:25:01,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:25:01,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:25:01,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:25:01,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:25:01,623 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:25:01,624 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan 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 -> Taipan 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-12-07 21:25:01,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:25:01,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:25:01,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:25:01,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:25:01,737 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:25:01,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-12-07 21:25:01,778 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/data/a5e436d6f/368a47e8fcfd4d42a0c50af99861dd6d/FLAG1aa072364 [2019-12-07 21:25:02,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:25:02,181 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-12-07 21:25:02,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/data/a5e436d6f/368a47e8fcfd4d42a0c50af99861dd6d/FLAG1aa072364 [2019-12-07 21:25:02,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/data/a5e436d6f/368a47e8fcfd4d42a0c50af99861dd6d [2019-12-07 21:25:02,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:25:02,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:25:02,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:25:02,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:25:02,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:25:02,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02, skipping insertion in model container [2019-12-07 21:25:02,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:25:02,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:25:02,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:25:02,370 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:25:02,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:25:02,401 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:25:02,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02 WrapperNode [2019-12-07 21:25:02,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:25:02,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:25:02,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:25:02,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:25:02,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:25:02,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:25:02,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:25:02,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:25:02,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... [2019-12-07 21:25:02,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:25:02,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:25:02,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:25:02,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:25:02,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/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-12-07 21:25:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:25:02,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:25:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:25:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:25:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:25:02,647 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:25:02,648 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 21:25:02,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:02 BoogieIcfgContainer [2019-12-07 21:25:02,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:25:02,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:25:02,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:25:02,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:25:02,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:25:02" (1/3) ... [2019-12-07 21:25:02,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c85dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:25:02, skipping insertion in model container [2019-12-07 21:25:02,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:02" (2/3) ... [2019-12-07 21:25:02,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484c85dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:25:02, skipping insertion in model container [2019-12-07 21:25:02,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:02" (3/3) ... [2019-12-07 21:25:02,653 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-12-07 21:25:02,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:25:02,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-07 21:25:02,671 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-07 21:25:02,687 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:25:02,687 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:25:02,687 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:25:02,688 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:25:02,688 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:25:02,688 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:25:02,688 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:25:02,688 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:25:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-12-07 21:25:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:25:02,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:02,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:02,702 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1546650789, now seen corresponding path program 1 times [2019-12-07 21:25:02,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901780444] [2019-12-07 21:25:02,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:02,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901780444] [2019-12-07 21:25:02,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:02,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:02,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545523197] [2019-12-07 21:25:02,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:02,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:02,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:02,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:02,845 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-12-07 21:25:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:02,865 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2019-12-07 21:25:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:02,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 21:25:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:02,872 INFO L225 Difference]: With dead ends: 42 [2019-12-07 21:25:02,873 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 21:25:02,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 21:25:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 21:25:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 21:25:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 21:25:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-12-07 21:25:02,897 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 8 [2019-12-07 21:25:02,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:02,897 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-12-07 21:25:02,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-12-07 21:25:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:25:02,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:02,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:02,898 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1412593997, now seen corresponding path program 1 times [2019-12-07 21:25:02,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:02,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81399686] [2019-12-07 21:25:02,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:02,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81399686] [2019-12-07 21:25:02,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:02,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:25:02,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572785431] [2019-12-07 21:25:02,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:02,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:02,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:02,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:02,920 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-12-07 21:25:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:02,945 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-12-07 21:25:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:02,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:25:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:02,946 INFO L225 Difference]: With dead ends: 53 [2019-12-07 21:25:02,946 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 21:25:02,947 INFO L630 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-12-07 21:25:02,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 21:25:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2019-12-07 21:25:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 21:25:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 21:25:02,951 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 9 [2019-12-07 21:25:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:02,951 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 21:25:02,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 21:25:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:25:02,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:02,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:02,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1344104488, now seen corresponding path program 1 times [2019-12-07 21:25:02,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:02,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306069093] [2019-12-07 21:25:02,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:02,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306069093] [2019-12-07 21:25:02,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:02,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:25:02,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034816018] [2019-12-07 21:25:02,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:25:02,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:02,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:25:02,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:02,979 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-12-07 21:25:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:03,005 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-12-07 21:25:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:25:03,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 21:25:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:03,006 INFO L225 Difference]: With dead ends: 46 [2019-12-07 21:25:03,007 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 21:25:03,007 INFO L630 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-12-07 21:25:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 21:25:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2019-12-07 21:25:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 21:25:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 21:25:03,013 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2019-12-07 21:25:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:03,013 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 21:25:03,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:25:03,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 21:25:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:25:03,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:03,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:03,014 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1220471443, now seen corresponding path program 1 times [2019-12-07 21:25:03,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:03,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083642487] [2019-12-07 21:25:03,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:03,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083642487] [2019-12-07 21:25:03,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:03,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:25:03,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311946560] [2019-12-07 21:25:03,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:03,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:03,039 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-12-07 21:25:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:03,062 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-12-07 21:25:03,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:03,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 21:25:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:03,063 INFO L225 Difference]: With dead ends: 49 [2019-12-07 21:25:03,063 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 21:25:03,064 INFO L630 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-12-07 21:25:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 21:25:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-12-07 21:25:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 21:25:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-12-07 21:25:03,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2019-12-07 21:25:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:03,068 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-12-07 21:25:03,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:03,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-12-07 21:25:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:25:03,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:03,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:03,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:03,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1299008504, now seen corresponding path program 1 times [2019-12-07 21:25:03,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:03,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430773788] [2019-12-07 21:25:03,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:03,683 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 87 [2019-12-07 21:25:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:03,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430773788] [2019-12-07 21:25:03,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:03,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:25:03,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092137586] [2019-12-07 21:25:03,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:25:03,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:25:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:25:03,733 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2019-12-07 21:25:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:03,974 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-12-07 21:25:03,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:25:03,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 21:25:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:03,975 INFO L225 Difference]: With dead ends: 39 [2019-12-07 21:25:03,975 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 21:25:03,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:25:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 21:25:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 21:25:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 21:25:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 21:25:03,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-12-07 21:25:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:03,979 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 21:25:03,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:25:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 21:25:03,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:25:03,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:03,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:03,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:03,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:03,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1999003900, now seen corresponding path program 1 times [2019-12-07 21:25:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:03,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437751072] [2019-12-07 21:25:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:04,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437751072] [2019-12-07 21:25:04,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:04,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:25:04,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574016189] [2019-12-07 21:25:04,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:25:04,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:25:04,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:25:04,013 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2019-12-07 21:25:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:04,056 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-12-07 21:25:04,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:25:04,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 21:25:04,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:04,057 INFO L225 Difference]: With dead ends: 37 [2019-12-07 21:25:04,057 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 21:25:04,057 INFO L630 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-12-07 21:25:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 21:25:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-12-07 21:25:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 21:25:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-12-07 21:25:04,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2019-12-07 21:25:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:04,061 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-12-07 21:25:04,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:25:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-12-07 21:25:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:25:04,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:04,061 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:04,062 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:04,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1488428289, now seen corresponding path program 1 times [2019-12-07 21:25:04,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:04,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579564770] [2019-12-07 21:25:04,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:05,751 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 21:25:05,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579564770] [2019-12-07 21:25:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265850842] [2019-12-07 21:25:05,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/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-12-07 21:25:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:05,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:25:05,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:25:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:10,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:25:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:13,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1589202422] [2019-12-07 21:25:13,321 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-12-07 21:25:13,321 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:25:13,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:25:13,331 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:25:13,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:25:13,608 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:25:15,529 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 21:25:25,816 WARN L192 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-07 21:25:28,130 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:25:28,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:25:28,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2019-12-07 21:25:28,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655434633] [2019-12-07 21:25:28,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:25:28,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:25:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=393, Unknown=2, NotChecked=0, Total=506 [2019-12-07 21:25:28,132 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2019-12-07 21:25:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:45,580 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-12-07 21:25:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:25:45,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-12-07 21:25:45,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:45,581 INFO L225 Difference]: With dead ends: 33 [2019-12-07 21:25:45,581 INFO L226 Difference]: Without dead ends: 25 [2019-12-07 21:25:45,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=118, Invalid=431, Unknown=3, NotChecked=0, Total=552 [2019-12-07 21:25:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-12-07 21:25:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 21:25:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 21:25:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 21:25:45,584 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 17 [2019-12-07 21:25:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:45,584 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 21:25:45,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:25:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-12-07 21:25:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:25:45,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:45,585 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:45,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:25:45,786 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1177646914, now seen corresponding path program 1 times [2019-12-07 21:25:45,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:45,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963560400] [2019-12-07 21:25:45,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:48,046 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse3 (div c_ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (* .cse3 (- 4294967296))) (.cse1 (* 4294967296 .cse2))) (or (<= c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 .cse0 (- 4294967297)) 4294967296)) 1)) (and (<= (+ .cse1 (* 4294967296 (div (+ (* c_ULTIMATE.start_main_~main__index2~0 2) (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295)) .cse0 (* .cse2 18446744069414584320) 8589734594) 4294967296)) 1) (+ c_ULTIMATE.start_main_~main__index1~0 (* 4294967296 .cse3))) (<= c_ULTIMATE.start_main_~main__index2~0 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (* .cse3 4294967296) (* .cse2 (- 4294967296)) (- 1)) 4294967296)) 99998))) (<= (+ c_ULTIMATE.start_main_~main__index1~0 4294867296) .cse1)))) is different from false [2019-12-07 21:25:50,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse5 (div c_ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse1 (* 4294967296 .cse5)) (.cse0 (* 4294967296 .cse4))) (and (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ c_ULTIMATE.start_main_~main__index2~0 .cse1)) (let ((.cse2 (* .cse4 (- 4294967296)))) (or (<= c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 .cse2 (- 4294967297)) 4294967296)) 1)) (let ((.cse3 (+ c_ULTIMATE.start_main_~main__index1~0 .cse0))) (and (<= .cse3 (+ .cse1 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (* .cse4 4294967296) (* .cse5 (- 4294967296)) (- 1)) 4294967296)) 99997)) (<= (+ .cse1 (* 4294967296 (div (+ (* c_ULTIMATE.start_main_~main__index2~0 2) (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295)) .cse2 (* .cse5 18446744069414584320) 8589734594) 4294967296)) 1) .cse3)))))))) is different from false [2019-12-07 21:25:52,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse4 (div c_ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse1 (* 4294967296 .cse4)) (.cse0 (* 4294967296 .cse3))) (and (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ c_ULTIMATE.start_main_~main__index2~0 .cse1)) (or (let ((.cse2 (+ c_ULTIMATE.start_main_~main__index1~0 .cse0))) (and (<= .cse2 (+ .cse1 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (* .cse3 4294967296) (* .cse4 (- 4294967296)) (- 1)) 4294967296)) 99997)) (<= (+ .cse1 (* 4294967296 (div (+ (* c_ULTIMATE.start_main_~main__index2~0 4294967296) (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295)) (* .cse3 (- 18446744069414584320)) (* .cse4 18446744069414584320) (- 429483844698112)) 4294967296)) 1) .cse2))) (<= (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index2~0 (* (div (+ (* c_ULTIMATE.start_main_~main__index2~0 (- 1)) c_ULTIMATE.start_main_~main__index1~0 4294967294) 4294967296) 4294967296) 8589834592) 4294967296)) 1) c_ULTIMATE.start_main_~main__index1~0))))) is different from false [2019-12-07 21:25:54,155 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_ULTIMATE.start_main_~main__index2~0 4294967296))) (.cse1 (* 4294967296 (div c_ULTIMATE.start_main_~main__index1~0 4294967296)))) (or (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse0 4294967293) (+ c_ULTIMATE.start_main_~main__index2~0 .cse1)) (and (<= (+ (* 4294967296 (div (+ (* (div (+ c_ULTIMATE.start_main_~main__index2~0 (* c_ULTIMATE.start_main_~main__index1~0 (- 1)) 1) 4294967296) (- 18446744073709551616)) (* c_ULTIMATE.start_main_~main__index2~0 4294967296) (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295)) (- 429475254763521)) 4294967296)) 2) c_ULTIMATE.start_main_~main__index1~0) (<= c_ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (- 2)) 4294967296)) 99998))) (<= (+ c_ULTIMATE.start_main_~main__index2~0 4294867298) .cse0) (<= (+ .cse1 4294967298) c_ULTIMATE.start_main_~main__index1~0))) is different from false [2019-12-07 21:25:59,062 WARN L192 SmtUtils]: Spent 4.55 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 21:26:01,098 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ (* 4294967296 (div (+ (* (div (+ c_ULTIMATE.start_main_~main__index2~0 (* c_ULTIMATE.start_main_~main__index1~0 (- 1)) 1) 4294967296) (- 18446744073709551616)) (* c_ULTIMATE.start_main_~main__index2~0 4294967296) (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295)) (- 429475254763521)) 4294967296)) 2) c_ULTIMATE.start_main_~main__index1~0) (<= c_ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (- 2)) 4294967296)) 99998))) is different from false [2019-12-07 21:26:01,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-12-07 21:26:01,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963560400] [2019-12-07 21:26:01,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204953332] [2019-12-07 21:26:01,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/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-12-07 21:26:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:01,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 21:26:01,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:26:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:26:05,406 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:26:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:26:07,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542252989] [2019-12-07 21:26:07,750 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-12-07 21:26:07,750 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:26:07,750 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:26:07,750 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:26:07,751 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:26:11,321 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:26:11,474 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-07 21:26:15,526 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-07 21:26:16,633 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 100 DAG size of output: 69 [2019-12-07 21:26:17,081 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-12-07 21:26:18,044 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:26:18,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:26:18,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 15 [2019-12-07 21:26:18,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217339962] [2019-12-07 21:26:18,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 21:26:18,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 21:26:18,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=510, Unknown=8, NotChecked=260, Total=930 [2019-12-07 21:26:18,046 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 15 states. [2019-12-07 21:26:45,774 WARN L192 SmtUtils]: Spent 10.24 s on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2019-12-07 21:27:25,761 WARN L192 SmtUtils]: Spent 27.58 s on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-12-07 21:27:53,931 WARN L192 SmtUtils]: Spent 15.87 s on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2019-12-07 21:28:00,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse5 (div c_ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse2 (* c_ULTIMATE.start_main_~main__index1~0 (- 4294967295))) (.cse0 (* 4294967296 .cse5)) (.cse1 (* 4294967296 .cse4))) (and (<= c_ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (or (<= (+ c_ULTIMATE.start_main_~main__index1~0 .cse0 4294967293) (+ c_ULTIMATE.start_main_~main__index2~0 .cse1)) (and (<= (+ (* 4294967296 (div (+ (* (div (+ c_ULTIMATE.start_main_~main__index2~0 (* c_ULTIMATE.start_main_~main__index1~0 (- 1)) 1) 4294967296) (- 18446744073709551616)) (* c_ULTIMATE.start_main_~main__index2~0 4294967296) .cse2 (- 429475254763521)) 4294967296)) 2) c_ULTIMATE.start_main_~main__index1~0) (<= c_ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (- 2)) 4294967296)) 99998))) (<= (+ c_ULTIMATE.start_main_~main__index2~0 4294867298) .cse0) (<= (+ .cse1 4294967298) c_ULTIMATE.start_main_~main__index1~0)) (let ((.cse3 (* .cse5 (- 4294967296)))) (or (<= c_ULTIMATE.start_main_~main__index1~0 (+ c_ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 .cse3 (- 4294967297)) 4294967296)) 1)) (and (<= (+ .cse1 (* 4294967296 (div (+ (* c_ULTIMATE.start_main_~main__index2~0 2) .cse2 .cse3 (* .cse4 18446744069414584320) 8589734594) 4294967296)) 1) (+ c_ULTIMATE.start_main_~main__index1~0 .cse0)) (<= c_ULTIMATE.start_main_~main__index2~0 (+ (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (* .cse5 4294967296) (* .cse4 (- 4294967296)) (- 1)) 4294967296)) 99998))) (<= (+ c_ULTIMATE.start_main_~main__index1~0 4294867296) .cse1))) (<= (+ c_ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index2~0 1) 4294967296))) (+ c_ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ c_ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 1)) (<= c_ULTIMATE.start_main_~main__index1~0 (+ .cse1 99999))))) is different from false [2019-12-07 21:28:18,209 WARN L192 SmtUtils]: Spent 11.85 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 21:28:36,259 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-12-07 21:29:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:29:09,716 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-12-07 21:29:10,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:29:10,024 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-12-07 21:29:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:29:10,024 INFO L225 Difference]: With dead ends: 43 [2019-12-07 21:29:10,024 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:29:10,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 175.0s TimeCoverageRelationStatistics Valid=216, Invalid=833, Unknown=31, NotChecked=402, Total=1482 [2019-12-07 21:29:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:29:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:29:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:29:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:29:10,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-12-07 21:29:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:29:10,025 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:29:10,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 21:29:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:29:10,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:29:10,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:29:10,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:29:10,758 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 29 [2019-12-07 21:29:21,169 WARN L192 SmtUtils]: Spent 10.41 s on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-07 21:29:21,399 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-07 21:29:21,432 INFO L249 CegarLoopResult]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-12-07 21:29:21,432 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-12-07 21:29:21,432 INFO L242 CegarLoopResult]: At program point L151(lines 21 152) the Hoare annotation is: (or (= ULTIMATE.start_main_~main__loop_entered~0 0) (let ((.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse7)) (.cse8 (* 4294967296 .cse6))) (and (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div (+ ULTIMATE.start_main_~main__index2~0 1) 4294967296))) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 1)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (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 .cse0) (+ ULTIMATE.start_main_~main__index2~0 .cse8))) (<= ULTIMATE.start_main_~main__index1~0 (+ .cse8 99999)))))) [2019-12-07 21:29:21,432 INFO L246 CegarLoopResult]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L242 CegarLoopResult]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse11 (* 4294967296 .cse7)) (.cse8 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse8)) (.cse9 (+ ULTIMATE.start_main_~main__index2~0 .cse11)) (.cse1 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse10 (<= ULTIMATE.start_main_~main__index1~0 (+ .cse11 99999)))) (or (and (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div (+ ULTIMATE.start_main_~main__index2~0 1) 4294967296))) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296)) 1)) .cse1 (or (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse4 (select .cse6 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse8 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse5 (select .cse6 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse7 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse5 4294967296)))) (.cse2 (+ (* 4294967296 (div .cse4 4294967296)) .cse5))) (and (<= .cse2 .cse3) (<= .cse3 .cse2))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0) .cse9)) .cse10) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) .cse9) .cse1 .cse10))))) [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L242 CegarLoopResult]: At program point L82(lines 57 83) 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__index2~0 (+ .cse0 99999)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0)))) [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-12-07 21:29:21,433 INFO L246 CegarLoopResult]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L242 CegarLoopResult]: 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-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L249 CegarLoopResult]: At program point L161(lines 9 163) the Hoare annotation is: true [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L242 CegarLoopResult]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L242 CegarLoopResult]: 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-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-12-07 21:29:21,434 INFO L242 CegarLoopResult]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-12-07 21:29:21,435 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 21:29:21,435 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 21:29:21,435 INFO L246 CegarLoopResult]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-12-07 21:29:21,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,448 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,449 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,451 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,453 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,454 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,455 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,456 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:29:21 BoogieIcfgContainer [2019-12-07 21:29:21,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:29:21,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:29:21,459 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:29:21,459 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:29:21,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:02" (3/4) ... [2019-12-07 21:29:21,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:29:21,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 21:29:21,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 21:29:21,470 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:29:21,515 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ba9c57e7-7622-4cef-abc9-8607a59864df/bin/utaipan/witness.graphml [2019-12-07 21:29:21,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:29:21,516 INFO L168 Benchmark]: Toolchain (without parser) took 259319.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 943.5 MB in the beginning and 970.6 MB in the end (delta: -27.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,517 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:29:21,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:29:21,518 INFO L168 Benchmark]: Boogie Preprocessor took 15.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,518 INFO L168 Benchmark]: RCFGBuilder took 205.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,519 INFO L168 Benchmark]: TraceAbstraction took 258809.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 15.7 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 96.1 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,519 INFO L168 Benchmark]: Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory was 977.9 MB in the beginning and 970.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:29:21,521 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258809.81 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 15.7 MB). Free memory was 1.1 GB in the beginning and 977.9 MB in the end (delta: 96.1 MB). Peak memory consumption was 111.8 MB. Max. memory is 11.5 GB. * Witness Printer took 56.20 ms. Allocated memory is still 1.2 GB. Free memory was 977.9 MB in the beginning and 970.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 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: 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 - PositiveResult [Line: 105]: 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-12-07 21:29:21,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: main__loop_entered == 0 || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main__index1 + 4294967296 * ((main__index2 + 1) / 4294967296) <= main__index2 + 4294967296 * ((main__index1 + -1) / 4294967296) + 1) && 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__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-12-07 21:29:21,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 21:29:21,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main__index1 + 4294967296 * ((main__index2 + 1) / 4294967296) <= main__index2 + 4294967296 * ((main__index1 + -1) / 4294967296) + 1) && 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__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) || (((!(0 == __VERIFIER_assert__cond) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && 1 == __VERIFIER_assert__cond) && main__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) - InvariantResult [Line: 57]: 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) && 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, 29 locations, 3 error locations. Result: SAFE, OverallTime: 247.5s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 189.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.2s, HoareTripleCheckerStatistics: 177 SDtfs, 223 SDslu, 205 SDs, 0 SdLazy, 222 SolverSat, 24 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 37.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 101 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 203.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred 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, 8 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 29 NumberOfFragments, 548 HoareAnnotationTreeSize, 9 FomulaSimplifications, 2302 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 837 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 31.7s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 80878 SizeOfPredicates, 7 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/21 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...