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/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:54,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:54,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:54,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:54,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:54,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:54,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:54,350 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:54,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:54,356 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:54,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:54,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:54,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:54,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:54,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:54,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:54,366 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:54,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:54,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:54,372 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:54,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:54,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:54,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:54,377 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:54,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:54,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:54,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:54,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:54,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:54,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:54,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:54,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:54,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:54,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:54,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:54,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:54,386 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 10:13:54,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:54,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:54,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:54,405 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:54,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:54,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:54,408 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:54,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:54,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:54,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:54,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:54,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:54,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:54,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:54,410 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:54,410 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:54,411 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:54,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:54,411 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:54,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:54,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:54,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:54,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:54,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:54,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:54,414 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:54,414 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:54,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:54,415 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:54,415 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:54,415 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:54,415 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:54,416 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:54,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:54,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:54,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:54,485 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:54,486 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:54,487 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 10:13:54,559 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca7468f4/c8d2667a06ca4fdabaf5f5dc4eb3e3ed/FLAG69d306379 [2018-11-23 10:13:55,084 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:55,085 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 10:13:55,091 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca7468f4/c8d2667a06ca4fdabaf5f5dc4eb3e3ed/FLAG69d306379 [2018-11-23 10:13:55,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca7468f4/c8d2667a06ca4fdabaf5f5dc4eb3e3ed [2018-11-23 10:13:55,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:55,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:55,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:55,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:55,443 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:55,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef5bbb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55, skipping insertion in model container [2018-11-23 10:13:55,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:55,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:55,709 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:55,715 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:55,742 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:55,770 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:55,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55 WrapperNode [2018-11-23 10:13:55,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:55,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:55,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:55,772 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:55,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:55,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:55,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:55,797 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:55,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (1/1) ... [2018-11-23 10:13:55,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:55,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:55,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:55,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:55,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (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 10:13:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:55,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:55,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:55,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:55,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:55,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:55,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:56,484 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:56,484 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:13:56,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:56 BoogieIcfgContainer [2018-11-23 10:13:56,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:56,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:56,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:56,489 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:56,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:55" (1/3) ... [2018-11-23 10:13:56,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18080890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:56, skipping insertion in model container [2018-11-23 10:13:56,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:55" (2/3) ... [2018-11-23 10:13:56,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18080890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:56, skipping insertion in model container [2018-11-23 10:13:56,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:56" (3/3) ... [2018-11-23 10:13:56,493 INFO L112 eAbstractionObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2018-11-23 10:13:56,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:56,513 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:56,530 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:56,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:56,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:56,565 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:56,566 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:56,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:56,566 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:56,567 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:56,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:56,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 10:13:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:13:56,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:56,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:56,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:56,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash -423135907, now seen corresponding path program 1 times [2018-11-23 10:13:56,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:56,611 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 10:13:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:56,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:56,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 10:13:56,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 10:13:56,770 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 10:13:56,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #54#return; {28#true} is VALID [2018-11-23 10:13:56,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret3 := main(); {28#true} is VALID [2018-11-23 10:13:56,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {28#true} is VALID [2018-11-23 10:13:56,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 10:13:56,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0bv32; {29#false} is VALID [2018-11-23 10:13:56,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {29#false} is VALID [2018-11-23 10:13:56,778 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 10:13:56,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 10:13:56,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 10:13:56,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 10:13:56,782 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 10:13:56,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:13:56,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:56,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:56,792 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:13:56,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:56,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:56,931 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 10:13:56,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:56,945 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 10:13:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,283 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 10:13:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:57,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:13:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 10:13:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2018-11-23 10:13:57,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 51 transitions. [2018-11-23 10:13:57,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:57,465 INFO L225 Difference]: With dead ends: 42 [2018-11-23 10:13:57,466 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:57,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:57,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:57,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:57,530 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:57,530 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,534 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:57,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:57,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:57,535 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:57,535 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,539 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:57,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:57,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:57,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:57,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:57,544 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 10:13:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:57,544 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:57,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:13:57,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:57,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:57,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:57,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:57,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1453190697, now seen corresponding path program 1 times [2018-11-23 10:13:57,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:57,548 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 10:13:57,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:57,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:57,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 10:13:57,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {189#true} is VALID [2018-11-23 10:13:57,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 10:13:57,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #54#return; {189#true} is VALID [2018-11-23 10:13:57,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret3 := main(); {189#true} is VALID [2018-11-23 10:13:57,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {209#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:57,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {190#false} is VALID [2018-11-23 10:13:57,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#false} ~i~0 := 0bv32; {190#false} is VALID [2018-11-23 10:13:57,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {190#false} is VALID [2018-11-23 10:13:57,775 INFO L256 TraceCheckUtils]: 9: Hoare triple {190#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {190#false} is VALID [2018-11-23 10:13:57,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 10:13:57,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume 0bv32 == ~cond; {190#false} is VALID [2018-11-23 10:13:57,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 10:13:57,777 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 10:13:57,777 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:57,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:57,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:13:57,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:57,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:57,809 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 10:13:57,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:57,810 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 10:13:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:57,939 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 10:13:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:57,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:13:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:13:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:13:57,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 10:13:58,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:58,392 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:13:58,392 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:13:58,393 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 10:13:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:13:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 10:13:58,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:58,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2018-11-23 10:13:58,423 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2018-11-23 10:13:58,423 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2018-11-23 10:13:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:58,427 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:13:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:13:58,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:58,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:58,429 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2018-11-23 10:13:58,429 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2018-11-23 10:13:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:58,432 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:13:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:13:58,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:58,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:58,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:58,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:13:58,437 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 13 [2018-11-23 10:13:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:58,437 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:13:58,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:13:58,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:58,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:58,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:58,439 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:58,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash -769700427, now seen corresponding path program 1 times [2018-11-23 10:13:58,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:58,440 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 10:13:58,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:58,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:58,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 10:13:58,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 10:13:58,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 10:13:58,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #54#return; {373#true} is VALID [2018-11-23 10:13:58,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret3 := main(); {373#true} is VALID [2018-11-23 10:13:58,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {393#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:58,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {393#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {393#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:58,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {393#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {400#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:58,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {400#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 10:13:58,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 10:13:58,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {374#false} is VALID [2018-11-23 10:13:58,663 INFO L256 TraceCheckUtils]: 11: Hoare triple {374#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 10:13:58,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 10:13:58,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 10:13:58,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 10:13:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:58,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:58,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 10:13:58,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume 0bv32 == ~cond; {374#false} is VALID [2018-11-23 10:13:58,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 10:13:58,778 INFO L256 TraceCheckUtils]: 11: Hoare triple {374#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {374#false} is VALID [2018-11-23 10:13:58,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {374#false} is VALID [2018-11-23 10:13:58,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#false} ~i~0 := 0bv32; {374#false} is VALID [2018-11-23 10:13:58,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {440#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {374#false} is VALID [2018-11-23 10:13:58,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {444#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {440#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:58,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {444#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {444#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {444#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:58,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret3 := main(); {373#true} is VALID [2018-11-23 10:13:58,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #54#return; {373#true} is VALID [2018-11-23 10:13:58,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 10:13:58,807 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {373#true} is VALID [2018-11-23 10:13:58,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 10:13:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:58,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:58,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:58,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 10:13:58,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:58,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:58,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:58,894 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 10:13:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:59,511 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 10:13:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:59,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 10:13:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 10:13:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 10:13:59,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-23 10:13:59,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:59,651 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:13:59,651 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 10:13:59,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 10:13:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-23 10:13:59,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:59,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 36 states. [2018-11-23 10:13:59,684 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 36 states. [2018-11-23 10:13:59,685 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 36 states. [2018-11-23 10:13:59,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:59,689 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 10:13:59,690 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 10:13:59,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:59,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:59,691 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 43 states. [2018-11-23 10:13:59,691 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 43 states. [2018-11-23 10:13:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:59,695 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-23 10:13:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 10:13:59,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:59,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:59,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:59,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:13:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 10:13:59,700 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 15 [2018-11-23 10:13:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:59,700 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 10:13:59,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 10:13:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:59,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:59,701 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:59,702 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:59,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:59,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1688831055, now seen corresponding path program 2 times [2018-11-23 10:13:59,703 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:59,703 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 10:13:59,723 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:59,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:59,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:59,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:59,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {691#true} call ULTIMATE.init(); {691#true} is VALID [2018-11-23 10:13:59,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {691#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {691#true} is VALID [2018-11-23 10:13:59,897 INFO L273 TraceCheckUtils]: 2: Hoare triple {691#true} assume true; {691#true} is VALID [2018-11-23 10:13:59,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {691#true} {691#true} #54#return; {691#true} is VALID [2018-11-23 10:13:59,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {691#true} call #t~ret3 := main(); {691#true} is VALID [2018-11-23 10:13:59,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {691#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {711#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:59,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {711#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:59,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {711#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {718#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {718#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {718#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {718#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:59,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {725#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:13:59,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {725#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {732#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {732#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {732#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:59,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {732#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {739#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:13:59,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {739#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {692#false} is VALID [2018-11-23 10:13:59,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {692#false} ~i~0 := 0bv32; {692#false} is VALID [2018-11-23 10:13:59,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {692#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {692#false} is VALID [2018-11-23 10:13:59,910 INFO L256 TraceCheckUtils]: 17: Hoare triple {692#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {692#false} is VALID [2018-11-23 10:13:59,911 INFO L273 TraceCheckUtils]: 18: Hoare triple {692#false} ~cond := #in~cond; {692#false} is VALID [2018-11-23 10:13:59,911 INFO L273 TraceCheckUtils]: 19: Hoare triple {692#false} assume 0bv32 == ~cond; {692#false} is VALID [2018-11-23 10:13:59,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {692#false} assume !false; {692#false} is VALID [2018-11-23 10:13:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:13:59,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:14:00,201 INFO L273 TraceCheckUtils]: 20: Hoare triple {692#false} assume !false; {692#false} is VALID [2018-11-23 10:14:00,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {692#false} assume 0bv32 == ~cond; {692#false} is VALID [2018-11-23 10:14:00,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {692#false} ~cond := #in~cond; {692#false} is VALID [2018-11-23 10:14:00,202 INFO L256 TraceCheckUtils]: 17: Hoare triple {692#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {692#false} is VALID [2018-11-23 10:14:00,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {692#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {692#false} is VALID [2018-11-23 10:14:00,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {692#false} ~i~0 := 0bv32; {692#false} is VALID [2018-11-23 10:14:00,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {692#false} is VALID [2018-11-23 10:14:00,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {783#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {779#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:14:00,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {783#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {783#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {790#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {783#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {790#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {790#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {797#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {790#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {797#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {797#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {797#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {804#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {691#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {804#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:00,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {691#true} call #t~ret3 := main(); {691#true} is VALID [2018-11-23 10:14:00,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {691#true} {691#true} #54#return; {691#true} is VALID [2018-11-23 10:14:00,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {691#true} assume true; {691#true} is VALID [2018-11-23 10:14:00,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {691#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {691#true} is VALID [2018-11-23 10:14:00,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {691#true} call ULTIMATE.init(); {691#true} is VALID [2018-11-23 10:14:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:00,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:14:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:14:00,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:14:00,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:14:00,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:14:00,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:00,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:14:00,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:14:00,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:14:00,326 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 12 states. [2018-11-23 10:14:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:02,551 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-11-23 10:14:02,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:14:02,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:14:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:14:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2018-11-23 10:14:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:14:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2018-11-23 10:14:02,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 122 transitions. [2018-11-23 10:14:02,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:02,793 INFO L225 Difference]: With dead ends: 106 [2018-11-23 10:14:02,793 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 10:14:02,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:14:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 10:14:02,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2018-11-23 10:14:02,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:02,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 63 states. [2018-11-23 10:14:02,860 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 63 states. [2018-11-23 10:14:02,860 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 63 states. [2018-11-23 10:14:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:02,867 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 10:14:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-11-23 10:14:02,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:02,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:02,869 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 85 states. [2018-11-23 10:14:02,869 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 85 states. [2018-11-23 10:14:02,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:02,876 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2018-11-23 10:14:02,876 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-11-23 10:14:02,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:02,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:02,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:02,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 10:14:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-23 10:14:02,883 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 21 [2018-11-23 10:14:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:02,883 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-23 10:14:02,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:14:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-23 10:14:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 10:14:02,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:02,885 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:02,886 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:02,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash -59900157, now seen corresponding path program 3 times [2018-11-23 10:14:02,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:02,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:02,918 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:14:03,273 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:14:03,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:14:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:14:03,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:14:03,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {1247#true} call ULTIMATE.init(); {1247#true} is VALID [2018-11-23 10:14:03,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {1247#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1247#true} is VALID [2018-11-23 10:14:03,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {1247#true} assume true; {1247#true} is VALID [2018-11-23 10:14:03,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1247#true} {1247#true} #54#return; {1247#true} is VALID [2018-11-23 10:14:03,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {1247#true} call #t~ret3 := main(); {1247#true} is VALID [2018-11-23 10:14:03,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {1247#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1267#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:03,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {1267#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1267#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:03,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {1267#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1274#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1274#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1281#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:14:03,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1281#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:14:03,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {1281#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1288#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1288#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1295#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:14:03,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {1295#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1295#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:14:03,565 INFO L273 TraceCheckUtils]: 15: Hoare triple {1295#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1302#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {1302#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1302#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,566 INFO L273 TraceCheckUtils]: 17: Hoare triple {1302#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1309#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:03,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {1309#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1309#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:03,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {1309#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1316#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1316#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1323#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:03,594 INFO L273 TraceCheckUtils]: 22: Hoare triple {1323#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1323#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:03,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {1323#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1330#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {1330#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1330#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:03,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {1330#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1337#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:14:03,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {1337#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1248#false} is VALID [2018-11-23 10:14:03,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {1248#false} ~i~0 := 0bv32; {1248#false} is VALID [2018-11-23 10:14:03,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {1248#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1248#false} is VALID [2018-11-23 10:14:03,614 INFO L256 TraceCheckUtils]: 29: Hoare triple {1248#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {1248#false} is VALID [2018-11-23 10:14:03,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {1248#false} ~cond := #in~cond; {1248#false} is VALID [2018-11-23 10:14:03,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {1248#false} assume 0bv32 == ~cond; {1248#false} is VALID [2018-11-23 10:14:03,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2018-11-23 10:14:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:03,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:14:04,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {1248#false} assume !false; {1248#false} is VALID [2018-11-23 10:14:04,298 INFO L273 TraceCheckUtils]: 31: Hoare triple {1248#false} assume 0bv32 == ~cond; {1248#false} is VALID [2018-11-23 10:14:04,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {1248#false} ~cond := #in~cond; {1248#false} is VALID [2018-11-23 10:14:04,298 INFO L256 TraceCheckUtils]: 29: Hoare triple {1248#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {1248#false} is VALID [2018-11-23 10:14:04,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {1248#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1248#false} is VALID [2018-11-23 10:14:04,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {1248#false} ~i~0 := 0bv32; {1248#false} is VALID [2018-11-23 10:14:04,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {1377#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1248#false} is VALID [2018-11-23 10:14:04,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {1381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1377#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:14:04,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {1381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {1388#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {1388#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1388#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {1395#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1388#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {1395#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1395#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {1402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1395#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {1402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1409#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {1409#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1409#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1409#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {1423#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,335 INFO L273 TraceCheckUtils]: 12: Hoare triple {1423#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1423#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {1430#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1423#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {1430#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1430#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {1437#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1430#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {1437#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1437#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {1444#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1437#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {1444#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1444#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {1247#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1444#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:04,353 INFO L256 TraceCheckUtils]: 4: Hoare triple {1247#true} call #t~ret3 := main(); {1247#true} is VALID [2018-11-23 10:14:04,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1247#true} {1247#true} #54#return; {1247#true} is VALID [2018-11-23 10:14:04,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {1247#true} assume true; {1247#true} is VALID [2018-11-23 10:14:04,354 INFO L273 TraceCheckUtils]: 1: Hoare triple {1247#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1247#true} is VALID [2018-11-23 10:14:04,354 INFO L256 TraceCheckUtils]: 0: Hoare triple {1247#true} call ULTIMATE.init(); {1247#true} is VALID [2018-11-23 10:14:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:04,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:14:04,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:14:04,360 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 10:14:04,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:14:04,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:14:04,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:04,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:14:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:14:04,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:14:04,506 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 24 states. [2018-11-23 10:14:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:12,978 INFO L93 Difference]: Finished difference Result 205 states and 262 transitions. [2018-11-23 10:14:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:14:12,978 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 10:14:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2018-11-23 10:14:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2018-11-23 10:14:12,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 233 transitions. [2018-11-23 10:14:13,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:13,444 INFO L225 Difference]: With dead ends: 205 [2018-11-23 10:14:13,444 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 10:14:13,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:14:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 10:14:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 117. [2018-11-23 10:14:13,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:13,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 117 states. [2018-11-23 10:14:13,557 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 117 states. [2018-11-23 10:14:13,557 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 117 states. [2018-11-23 10:14:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:13,567 INFO L93 Difference]: Finished difference Result 169 states and 202 transitions. [2018-11-23 10:14:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-11-23 10:14:13,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:13,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:13,569 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 169 states. [2018-11-23 10:14:13,569 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 169 states. [2018-11-23 10:14:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:13,579 INFO L93 Difference]: Finished difference Result 169 states and 202 transitions. [2018-11-23 10:14:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2018-11-23 10:14:13,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:13,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:13,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:13,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 10:14:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-11-23 10:14:13,586 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 33 [2018-11-23 10:14:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:13,587 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-11-23 10:14:13,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:14:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-11-23 10:14:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 10:14:13,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:13,588 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:13,589 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:13,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1244091797, now seen corresponding path program 4 times [2018-11-23 10:14:13,590 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:13,590 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:13,616 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:14:13,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:14:13,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:14:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:14:13,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:14:14,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-23 10:14:14,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2286#true} is VALID [2018-11-23 10:14:14,267 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-23 10:14:14,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #54#return; {2286#true} is VALID [2018-11-23 10:14:14,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret3 := main(); {2286#true} is VALID [2018-11-23 10:14:14,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2306#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:14,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {2306#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2306#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:14:14,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {2306#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2313#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {2313#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2313#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {2313#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2320#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:14:14,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {2320#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2320#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:14:14,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {2320#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2327#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2327#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2327#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {2327#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2334#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:14:14,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {2334#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2334#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:14:14,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {2334#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2341#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {2341#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2341#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {2341#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2348#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:14,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {2348#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2348#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:14:14,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {2348#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2355#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {2355#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2355#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {2355#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2362#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:14,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {2362#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2362#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:14:14,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {2362#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2369#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {2369#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2369#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {2369#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2376#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:14:14,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {2376#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2376#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:14:14,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {2376#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2383#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {2383#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2383#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {2383#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2390#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:14:14,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {2390#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2390#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:14:14,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {2390#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2397#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {2397#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2397#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {2397#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2404#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:14:14,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {2404#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2404#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:14:14,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {2404#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2411#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,293 INFO L273 TraceCheckUtils]: 36: Hoare triple {2411#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2411#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,294 INFO L273 TraceCheckUtils]: 37: Hoare triple {2411#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2418#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:14:14,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {2418#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2418#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:14:14,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {2418#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2425#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {2425#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2425#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {2425#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2432#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:14:14,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {2432#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2432#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:14:14,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {2432#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2439#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,327 INFO L273 TraceCheckUtils]: 44: Hoare triple {2439#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2439#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {2439#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2446#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:14:14,351 INFO L273 TraceCheckUtils]: 46: Hoare triple {2446#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2446#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:14:14,352 INFO L273 TraceCheckUtils]: 47: Hoare triple {2446#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2453#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,352 INFO L273 TraceCheckUtils]: 48: Hoare triple {2453#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2453#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {2453#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2460#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:14:14,353 INFO L273 TraceCheckUtils]: 50: Hoare triple {2460#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2287#false} is VALID [2018-11-23 10:14:14,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {2287#false} ~i~0 := 0bv32; {2287#false} is VALID [2018-11-23 10:14:14,354 INFO L273 TraceCheckUtils]: 52: Hoare triple {2287#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2287#false} is VALID [2018-11-23 10:14:14,354 INFO L256 TraceCheckUtils]: 53: Hoare triple {2287#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {2287#false} is VALID [2018-11-23 10:14:14,354 INFO L273 TraceCheckUtils]: 54: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-23 10:14:14,354 INFO L273 TraceCheckUtils]: 55: Hoare triple {2287#false} assume 0bv32 == ~cond; {2287#false} is VALID [2018-11-23 10:14:14,355 INFO L273 TraceCheckUtils]: 56: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-23 10:14:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:14,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:14:16,505 INFO L273 TraceCheckUtils]: 56: Hoare triple {2287#false} assume !false; {2287#false} is VALID [2018-11-23 10:14:16,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {2287#false} assume 0bv32 == ~cond; {2287#false} is VALID [2018-11-23 10:14:16,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {2287#false} ~cond := #in~cond; {2287#false} is VALID [2018-11-23 10:14:16,505 INFO L256 TraceCheckUtils]: 53: Hoare triple {2287#false} call __VERIFIER_assert((if 10bv32 == #t~mem2 then 1bv32 else 0bv32)); {2287#false} is VALID [2018-11-23 10:14:16,506 INFO L273 TraceCheckUtils]: 52: Hoare triple {2287#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2287#false} is VALID [2018-11-23 10:14:16,506 INFO L273 TraceCheckUtils]: 51: Hoare triple {2287#false} ~i~0 := 0bv32; {2287#false} is VALID [2018-11-23 10:14:16,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {2500#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2287#false} is VALID [2018-11-23 10:14:16,507 INFO L273 TraceCheckUtils]: 49: Hoare triple {2504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2500#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:14:16,512 INFO L273 TraceCheckUtils]: 48: Hoare triple {2504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {2511#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,518 INFO L273 TraceCheckUtils]: 46: Hoare triple {2511#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2511#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,526 INFO L273 TraceCheckUtils]: 45: Hoare triple {2518#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2511#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,527 INFO L273 TraceCheckUtils]: 44: Hoare triple {2518#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2518#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {2525#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2518#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {2525#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2525#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {2532#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2525#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {2532#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2532#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {2539#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2532#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {2539#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2539#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {2546#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {2546#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2546#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {2553#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2546#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {2553#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2553#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {2560#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2553#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {2560#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2560#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {2567#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2560#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {2567#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2567#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,578 INFO L273 TraceCheckUtils]: 29: Hoare triple {2574#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2567#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {2574#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2574#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {2581#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2574#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {2581#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2581#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {2588#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2581#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {2588#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2588#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {2595#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2588#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,599 INFO L273 TraceCheckUtils]: 22: Hoare triple {2595#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2595#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {2602#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2595#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {2602#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2602#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {2609#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2602#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {2609#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2609#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2609#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {2623#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {2623#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2623#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {2630#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2623#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {2630#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2630#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {2637#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2630#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {2637#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2637#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {2644#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2637#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {2644#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2644#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2644#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(10bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2651#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,651 INFO L273 TraceCheckUtils]: 5: Hoare triple {2286#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2651#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:14:16,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {2286#true} call #t~ret3 := main(); {2286#true} is VALID [2018-11-23 10:14:16,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2286#true} {2286#true} #54#return; {2286#true} is VALID [2018-11-23 10:14:16,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {2286#true} assume true; {2286#true} is VALID [2018-11-23 10:14:16,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {2286#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2286#true} is VALID [2018-11-23 10:14:16,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {2286#true} call ULTIMATE.init(); {2286#true} is VALID [2018-11-23 10:14:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:14:16,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:14:16,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:14:16,659 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 10:14:16,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:14:16,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:14:16,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:16,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:14:16,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:14:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:14:16,935 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 48 states. [2018-11-23 10:14:21,824 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:14:22,306 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:14:22,876 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:14:23,431 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:14:23,982 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:14:24,546 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:14:25,106 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:14:25,701 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:14:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:57,181 INFO L93 Difference]: Finished difference Result 403 states and 520 transitions. [2018-11-23 10:14:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:14:57,181 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 10:14:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 455 transitions. [2018-11-23 10:14:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:14:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 455 transitions. [2018-11-23 10:14:57,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 455 transitions. [2018-11-23 10:14:58,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:58,204 INFO L225 Difference]: With dead ends: 403 [2018-11-23 10:14:58,204 INFO L226 Difference]: Without dead ends: 337 [2018-11-23 10:14:58,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:14:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-23 10:14:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 225. [2018-11-23 10:14:58,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:58,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand 225 states. [2018-11-23 10:14:58,578 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand 225 states. [2018-11-23 10:14:58,578 INFO L87 Difference]: Start difference. First operand 337 states. Second operand 225 states. [2018-11-23 10:14:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:58,597 INFO L93 Difference]: Finished difference Result 337 states and 406 transitions. [2018-11-23 10:14:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 406 transitions. [2018-11-23 10:14:58,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:58,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:58,598 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 337 states. [2018-11-23 10:14:58,598 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 337 states. [2018-11-23 10:14:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:58,619 INFO L93 Difference]: Finished difference Result 337 states and 406 transitions. [2018-11-23 10:14:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 406 transitions. [2018-11-23 10:14:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:58,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:58,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:58,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-23 10:14:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-11-23 10:14:58,633 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 57 [2018-11-23 10:14:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:58,634 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-11-23 10:14:58,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:14:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-11-23 10:14:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 10:14:58,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:58,637 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:58,638 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:58,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2139150651, now seen corresponding path program 5 times [2018-11-23 10:14:58,639 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:58,639 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:58,669 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1