java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:31:41,957 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:31:41,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:31:41,971 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:31:41,972 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:31:41,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:31:41,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:31:41,981 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:31:41,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:31:41,986 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:31:41,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:31:41,990 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:31:41,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:31:41,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:31:41,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:31:41,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:31:41,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:31:41,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:31:42,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:31:42,012 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:31:42,013 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:31:42,014 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:31:42,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:31:42,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:31:42,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:31:42,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:31:42,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:31:42,029 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:31:42,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:31:42,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:31:42,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:31:42,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:31:42,035 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:31:42,035 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:31:42,036 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:31:42,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:31:42,039 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:31:42,063 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:31:42,064 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:31:42,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:31:42,066 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:31:42,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:31:42,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:31:42,067 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:31:42,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:31:42,068 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:31:42,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:31:42,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:31:42,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:31:42,069 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:31:42,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:31:42,069 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:31:42,070 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:31:42,070 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:31:42,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:31:42,070 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:31:42,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:31:42,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:31:42,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:31:42,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:31:42,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:31:42,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:31:42,073 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:31:42,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:31:42,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:31:42,074 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:31:42,074 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:31:42,074 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:31:42,074 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:31:42,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:31:42,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:31:42,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:31:42,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:31:42,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:31:42,161 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:31:42,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 11:31:42,224 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d676312/e62e4f2c9bb44b60a40d1f496cf92f03/FLAG6517a44c2 [2018-11-23 11:31:42,649 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:31:42,649 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 11:31:42,655 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d676312/e62e4f2c9bb44b60a40d1f496cf92f03/FLAG6517a44c2 [2018-11-23 11:31:43,025 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9d676312/e62e4f2c9bb44b60a40d1f496cf92f03 [2018-11-23 11:31:43,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:31:43,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:31:43,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:31:43,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:31:43,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:31:43,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43234e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43, skipping insertion in model container [2018-11-23 11:31:43,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:31:43,087 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:31:43,376 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:31:43,383 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:31:43,419 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:31:43,452 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:31:43,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43 WrapperNode [2018-11-23 11:31:43,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:31:43,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:31:43,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:31:43,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:31:43,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:31:43,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:31:43,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:31:43,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:31:43,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... [2018-11-23 11:31:43,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:31:43,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:31:43,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:31:43,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:31:43,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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 [2018-11-23 11:31:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:31:43,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:31:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:31:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:31:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:31:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:31:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:31:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:31:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:31:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:31:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:31:44,322 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:31:44,323 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:31:44,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:44 BoogieIcfgContainer [2018-11-23 11:31:44,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:31:44,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:31:44,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:31:44,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:31:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:43" (1/3) ... [2018-11-23 11:31:44,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac9cc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:44, skipping insertion in model container [2018-11-23 11:31:44,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:43" (2/3) ... [2018-11-23 11:31:44,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac9cc01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:44, skipping insertion in model container [2018-11-23 11:31:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:44" (3/3) ... [2018-11-23 11:31:44,333 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-11-23 11:31:44,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:31:44,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:31:44,368 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:31:44,402 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:31:44,403 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:31:44,403 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:31:44,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:31:44,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:31:44,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:31:44,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:31:44,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:31:44,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:31:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:31:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:31:44,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:44,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:44,432 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:44,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1079158542, now seen corresponding path program 1 times [2018-11-23 11:31:44,444 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:31:44,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:31:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:44,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:44,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:31:44,947 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:31:44,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:31:44,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #54#return; {27#true} is VALID [2018-11-23 11:31:44,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret11 := main(); {27#true} is VALID [2018-11-23 11:31:44,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32); {47#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-23 11:31:44,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {47#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {47#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-23 11:31:44,986 INFO L256 TraceCheckUtils]: 7: Hoare triple {47#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:44,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:44,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 11:31:44,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:31:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:44,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:31:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:31:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:31:45,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 11:31:45,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:45,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:31:45,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:45,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:31:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:31:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:31:45,175 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-23 11:31:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:46,140 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2018-11-23 11:31:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:31:46,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 11:31:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:31:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 11:31:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:31:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2018-11-23 11:31:46,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2018-11-23 11:31:46,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:46,703 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:31:46,703 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 11:31:46,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:31:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 11:31:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-11-23 11:31:46,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:46,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2018-11-23 11:31:46,920 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2018-11-23 11:31:46,920 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2018-11-23 11:31:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:46,934 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:31:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:31:46,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:46,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:46,936 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2018-11-23 11:31:46,936 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2018-11-23 11:31:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:46,944 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 11:31:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 11:31:46,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:46,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:46,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:46,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:31:46,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-23 11:31:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:46,956 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:31:46,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:31:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:31:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:31:46,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:46,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:46,958 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:46,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash -476045897, now seen corresponding path program 1 times [2018-11-23 11:31:46,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:31:46,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:31:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:47,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:47,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2018-11-23 11:31:47,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {238#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {238#true} is VALID [2018-11-23 11:31:47,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2018-11-23 11:31:47,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #54#return; {238#true} is VALID [2018-11-23 11:31:47,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret11 := main(); {238#true} is VALID [2018-11-23 11:31:47,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32); {258#(= (_ bv0 32) main_~loop_entered~0)} is VALID [2018-11-23 11:31:47,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {258#(= (_ bv0 32) main_~loop_entered~0)} assume !~bvult32(~index1~0, ~index2~0); {258#(= (_ bv0 32) main_~loop_entered~0)} is VALID [2018-11-23 11:31:47,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(= (_ bv0 32) main_~loop_entered~0)} assume 0bv32 != ~loop_entered~0; {239#false} is VALID [2018-11-23 11:31:47,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#false} assume !!~bvult32(~index2~0, ~index1~0);call #t~mem7 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32); {239#false} is VALID [2018-11-23 11:31:47,208 INFO L256 TraceCheckUtils]: 9: Hoare triple {239#false} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {239#false} is VALID [2018-11-23 11:31:47,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2018-11-23 11:31:47,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {239#false} assume 0bv32 == ~cond; {239#false} is VALID [2018-11-23 11:31:47,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {239#false} assume !false; {239#false} is VALID [2018-11-23 11:31:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:47,210 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:31:47,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:31:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:31:47,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:31:47,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:47,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:31:47,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:47,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:31:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:31:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:31:47,260 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 11:31:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:47,388 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 11:31:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:31:47,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:31:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:31:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 11:31:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:31:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 11:31:47,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 11:31:47,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:47,462 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:31:47,462 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:31:47,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:31:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:31:47,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 11:31:47,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:47,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 11:31:47,504 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 11:31:47,505 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 11:31:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:47,508 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:31:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:31:47,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:47,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:47,512 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 11:31:47,512 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 11:31:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:47,518 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 11:31:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 11:31:47,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:47,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:47,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:47,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 11:31:47,525 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-23 11:31:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:47,529 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 11:31:47,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:31:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 11:31:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:31:47,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:47,530 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:47,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:47,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1393486425, now seen corresponding path program 1 times [2018-11-23 11:31:47,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:47,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:31:47,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:31:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:47,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:47,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:31:47,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:31:47,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:31:47,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #54#return; {419#true} is VALID [2018-11-23 11:31:47,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2018-11-23 11:31:47,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32); {439#(bvult main_~index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:31:47,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {439#(bvult main_~index2~0 (_ bv100000 32))} assume !!~bvult32(~index1~0, ~index2~0); {443#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-23 11:31:47,892 INFO L256 TraceCheckUtils]: 7: Hoare triple {443#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {419#true} is VALID [2018-11-23 11:31:47,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2018-11-23 11:31:47,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0bv32 == ~cond); {419#true} is VALID [2018-11-23 11:31:47,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:31:47,894 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {419#true} {443#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} #58#return; {443#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-23 11:31:47,898 INFO L273 TraceCheckUtils]: 12: Hoare triple {443#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume 0bv32 != (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {462#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-23 11:31:47,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {462#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume !!~bvult32(~index1~0, ~index2~0); {462#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is VALID [2018-11-23 11:31:47,909 INFO L256 TraceCheckUtils]: 14: Hoare triple {462#(and (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {469#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:47,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {469#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {473#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:47,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {473#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 11:31:47,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:31:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:47,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:48,259 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:31:48,260 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 11:31:48,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {487#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {483#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:31:48,262 INFO L256 TraceCheckUtils]: 14: Hoare triple {491#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {487#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:31:48,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {491#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {491#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-23 11:31:48,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {498#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume 0bv32 != (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {491#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-23 11:31:48,281 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {419#true} {498#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} #58#return; {498#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} is VALID [2018-11-23 11:31:48,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:31:48,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0bv32 == ~cond); {419#true} is VALID [2018-11-23 11:31:48,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2018-11-23 11:31:48,282 INFO L256 TraceCheckUtils]: 7: Hoare triple {498#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {419#true} is VALID [2018-11-23 11:31:48,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {439#(bvult main_~index2~0 (_ bv100000 32))} assume !!~bvult32(~index1~0, ~index2~0); {498#(and (bvult (bvadd main_~index2~0 (_ bv4294967295 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv1 32)) (_ bv100000 32)))} is VALID [2018-11-23 11:31:48,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32); {439#(bvult main_~index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:31:48,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2018-11-23 11:31:48,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #54#return; {419#true} is VALID [2018-11-23 11:31:48,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:31:48,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:31:48,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:31:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:48,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:48,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 11:31:48,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 11:31:48,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:48,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:31:48,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:31:48,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:31:48,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:31:48,370 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2018-11-23 11:31:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:50,041 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 11:31:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:31:50,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 11:31:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:31:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-11-23 11:31:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:31:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2018-11-23 11:31:50,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2018-11-23 11:31:50,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:50,334 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:31:50,335 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 11:31:50,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:31:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 11:31:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-11-23 11:31:50,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:50,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 21 states. [2018-11-23 11:31:50,351 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 21 states. [2018-11-23 11:31:50,351 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 21 states. [2018-11-23 11:31:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:50,354 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 11:31:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 11:31:50,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:50,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:50,355 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 31 states. [2018-11-23 11:31:50,355 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 31 states. [2018-11-23 11:31:50,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:50,358 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 11:31:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 11:31:50,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:50,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:50,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:50,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:31:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:31:50,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-23 11:31:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:50,362 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:31:50,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:31:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:31:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:31:50,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:50,363 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:50,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:50,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 618852702, now seen corresponding path program 1 times [2018-11-23 11:31:50,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:31:50,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:31:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 11:31:52,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:52,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-23 11:31:52,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:31:52,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:31:52,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:31:52,963 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:31:52,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 55 [2018-11-23 11:31:52,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:31:53,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:31:53,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:31:53,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:3 [2018-11-23 11:31:53,102 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:31:53,102 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#array~0.base|, |main_~#array~0.offset|, main_~index1~0, main_~index2~0]. (let ((.cse3 (bvadd main_~index2~0 (_ bv1 32))) (.cse1 (bvmul (_ bv4 32) main_~index1~0)) (.cse0 (select |#memory_int| |main_~#array~0.base|)) (.cse2 (bvmul (_ bv4 32) main_~index2~0))) (and (bvult main_~index2~0 main_~index1~0) (= (select .cse0 (bvadd |main_~#array~0.offset| .cse1 (_ bv4294967292 32))) (select .cse0 (bvadd .cse2 |main_~#array~0.offset| (_ bv4 32)))) (bvult .cse3 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse3) (= (select .cse0 (bvadd .cse1 |main_~#array~0.offset|)) |main_#t~mem7|) (= (select .cse0 (bvadd .cse2 |main_~#array~0.offset|)) |main_#t~mem8|) (not (bvult main_~index1~0 main_~index2~0)))) [2018-11-23 11:31:53,103 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem8| |main_#t~mem7|) [2018-11-23 11:31:53,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {702#true} call ULTIMATE.init(); {702#true} is VALID [2018-11-23 11:31:53,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {702#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {702#true} is VALID [2018-11-23 11:31:53,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 11:31:53,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {702#true} {702#true} #54#return; {702#true} is VALID [2018-11-23 11:31:53,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {702#true} call #t~ret11 := main(); {702#true} is VALID [2018-11-23 11:31:53,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {702#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~index1~0;havoc ~index2~0;~loop_entered~0 := 0bv32;~index1~0 := #t~nondet1;havoc #t~nondet1;assume 0bv32 != (if ~bvult32(~index1~0, 100000bv32) then 1bv32 else 0bv32);~index2~0 := #t~nondet2;havoc #t~nondet2;assume 0bv32 != (if ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32); {722#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} is VALID [2018-11-23 11:31:53,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {722#(and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)))} assume !!~bvult32(~index1~0, ~index2~0); {726#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-23 11:31:53,175 INFO L256 TraceCheckUtils]: 7: Hoare triple {726#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call __VERIFIER_assert((if ~bvult32(~index1~0, 100000bv32) && ~bvult32(~index2~0, 100000bv32) then 1bv32 else 0bv32)); {702#true} is VALID [2018-11-23 11:31:53,175 INFO L273 TraceCheckUtils]: 8: Hoare triple {702#true} ~cond := #in~cond; {702#true} is VALID [2018-11-23 11:31:53,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#true} assume !(0bv32 == ~cond); {702#true} is VALID [2018-11-23 11:31:53,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#true} assume true; {702#true} is VALID [2018-11-23 11:31:53,177 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {702#true} {726#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} #58#return; {726#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} is VALID [2018-11-23 11:31:55,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0))} call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32);assume 0bv32 != (if #t~mem3 == #t~mem4 then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem4;#t~post5 := ~index1~0;~index1~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5;#t~post6 := ~index2~0;~index2~0 := ~bvsub32(#t~post6, 1bv32);havoc #t~post6;~loop_entered~0 := 1bv32; {745#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} is UNKNOWN [2018-11-23 11:31:55,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {745#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))))} assume !~bvult32(~index1~0, ~index2~0); {749#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-23 11:31:55,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {749#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume 0bv32 != ~loop_entered~0; {749#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} is VALID [2018-11-23 11:31:57,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {749#(and (= (select (select |#memory_int| |main_~#array~0.base|) (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select (select |#memory_int| |main_~#array~0.base|) (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32)))) (bvult (bvadd main_~index2~0 (_ bv1 32)) (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) (bvadd main_~index2~0 (_ bv1 32))) (not (bvult main_~index1~0 main_~index2~0)))} assume !!~bvult32(~index2~0, ~index1~0);call #t~mem7 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index1~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index2~0)), 4bv32); {756#(= |main_#t~mem8| |main_#t~mem7|)} is UNKNOWN [2018-11-23 11:31:57,195 INFO L256 TraceCheckUtils]: 16: Hoare triple {756#(= |main_#t~mem8| |main_#t~mem7|)} call __VERIFIER_assert((if #t~mem7 == #t~mem8 then 1bv32 else 0bv32)); {760#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:57,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {760#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {764#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:31:57,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {764#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {703#false} is VALID [2018-11-23 11:31:57,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {703#false} assume !false; {703#false} is VALID [2018-11-23 11:31:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:57,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:31:57,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:31:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:31:57,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 11:31:57,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:57,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:32:01,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:01,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:32:01,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:32:01,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:01,250 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2018-11-23 11:32:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:02,389 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:32:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:32:02,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 11:32:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-23 11:32:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 23 transitions. [2018-11-23 11:32:02,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 23 transitions. [2018-11-23 11:32:07,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 21 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:07,750 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:32:07,750 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:32:07,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:32:07,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:32:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:32:07,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:07,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:07,752 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:07,752 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:07,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:32:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:07,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:07,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:07,753 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:07,753 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:32:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:07,754 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:32:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:07,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:07,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:07,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:07,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:32:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:32:07,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 11:32:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:07,756 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:32:07,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:32:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:32:07,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:07,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:32:08,072 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-23 11:32:08,388 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2018-11-23 11:32:08,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:32:08,402 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:32:08,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:32:08,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:32:08,402 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:32:08,402 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:32:08,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:32:08,403 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (or (and (bvult main_~index1~0 (_ bv100000 32)) (bvult main_~index2~0 (_ bv100000 32)) (= (_ bv0 32) main_~loop_entered~0)) (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1)))) [2018-11-23 11:32:08,403 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2018-11-23 11:32:08,403 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-11-23 11:32:08,403 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-11-23 11:32:08,403 INFO L444 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (and (bvult main_~index2~0 (_ bv100000 32)) (bvult main_~index1~0 main_~index2~0)) (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1)))) [2018-11-23 11:32:08,404 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (bvult main_~index1~0 main_~index2~0))) (or (let ((.cse0 (bvadd main_~index2~0 (_ bv1 32)))) (and (bvult .cse0 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse0) .cse1)) (and (bvult main_~index2~0 (_ bv100000 32)) (= (_ bv0 32) main_~loop_entered~0) .cse1))) [2018-11-23 11:32:08,404 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-11-23 11:32:08,404 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-11-23 11:32:08,404 INFO L444 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (bvadd main_~index2~0 (_ bv1 32)))) (and (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (bvadd |main_~#array~0.offset| (bvmul (_ bv4 32) main_~index1~0) (_ bv4294967292 32))) (select .cse0 (bvadd (bvmul (_ bv4 32) main_~index2~0) |main_~#array~0.offset| (_ bv4 32))))) (= |main_#t~mem8| |main_#t~mem7|) (bvult .cse1 (_ bv100000 32)) (bvult (bvadd main_~index1~0 (_ bv4294967295 32)) .cse1) (not (bvult main_~index1~0 main_~index2~0)))) [2018-11-23 11:32:08,404 INFO L448 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-11-23 11:32:08,404 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-11-23 11:32:08,405 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-11-23 11:32:08,405 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-23 11:32:08,405 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-11-23 11:32:08,405 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-11-23 11:32:08,405 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-11-23 11:32:08,405 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-11-23 11:32:08,407 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:32:08,410 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 11:32:08,411 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:32:08,411 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:32:08,411 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 11:32:08,411 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 11:32:08,415 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 11:32:08,415 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2018-11-23 11:32:08,415 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:32:08,415 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:32:08,415 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2018-11-23 11:32:08,416 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 11:32:08,417 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 11:32:10,424 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-23 11:32:10,424 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-23 11:32:10,424 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:32:10,424 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:32:10,425 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 11:32:10,425 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:32:10,425 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-23 11:32:10,425 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:32:10,425 INFO L163 areAnnotationChecker]: CFG has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:32:10,433 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,434 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,437 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,439 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,440 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,441 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,441 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:10 BoogieIcfgContainer [2018-11-23 11:32:10,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:32:10,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:32:10,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:32:10,444 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:32:10,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:44" (3/4) ... [2018-11-23 11:32:10,449 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:32:10,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:32:10,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:32:10,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:32:10,464 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 11:32:10,464 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 11:32:10,464 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:32:10,521 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i-witness.graphml [2018-11-23 11:32:10,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:32:10,523 INFO L168 Benchmark]: Toolchain (without parser) took 27486.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -345.6 MB). Peak memory consumption was 392.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:10,524 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:10,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:10,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:10,525 INFO L168 Benchmark]: Boogie Preprocessor took 66.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:10,526 INFO L168 Benchmark]: RCFGBuilder took 769.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:10,527 INFO L168 Benchmark]: TraceAbstraction took 26118.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.0 MB). Peak memory consumption was 415.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:10,527 INFO L168 Benchmark]: Witness Printer took 77.62 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:10,531 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 415.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 769.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26118.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 415.0 MB). Peak memory consumption was 415.0 MB. Max. memory is 7.1 GB. * Witness Printer took 77.62 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2018-11-23 11:32:10,540 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,540 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,541 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,541 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (~bvult32(index2, 100000bv32) && ~bvult32(index1, index2)) || ((unknown-#memory_int-unknown[array][~bvadd64(array, ~bvmul32(4bv32, index1), 4294967292bv32)] == unknown-#memory_int-unknown[array][~bvadd64(~bvmul32(4bv32, index2), array, 4bv32)] && ~bvult32(~bvadd64(index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(index1, 4294967295bv32), ~bvadd64(index2, 1bv32))) - InvariantResult [Line: 31]: Loop Invariant [2018-11-23 11:32:10,542 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,542 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,543 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 11:32:10,543 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~bvult32(index1, 100000bv32) && ~bvult32(index2, 100000bv32)) && 0bv32 == loop_entered) || ((unknown-#memory_int-unknown[array][~bvadd64(array, ~bvmul32(4bv32, index1), 4294967292bv32)] == unknown-#memory_int-unknown[array][~bvadd64(~bvmul32(4bv32, index2), array, 4bv32)] && ~bvult32(~bvadd64(index2, 1bv32), 100000bv32)) && ~bvult32(~bvadd64(index1, 4294967295bv32), ~bvadd64(index2, 1bv32))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 24.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 48 SDslu, 182 SDs, 0 SdLazy, 169 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 160 HoareAnnotationTreeSize, 15 FomulaSimplifications, 126 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 5458 SizeOfPredicates, 13 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 9/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...