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-examples/standard_seq_init_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:10:08,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:10:08,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:10:08,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:10:08,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:10:08,470 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:10:08,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:10:08,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:10:08,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:10:08,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:10:08,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:10:08,481 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:10:08,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:10:08,484 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:10:08,485 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:10:08,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:10:08,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:10:08,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:10:08,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:10:08,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:10:08,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:10:08,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:10:08,509 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:10:08,509 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:10:08,509 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:10:08,510 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:10:08,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:10:08,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:10:08,516 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:10:08,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:10:08,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:10:08,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:10:08,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:10:08,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:10:08,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:10:08,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:10:08,522 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:10:08,541 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:10:08,541 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:10:08,542 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:10:08,542 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:10:08,543 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:10:08,543 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:10:08,543 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:10:08,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:10:08,544 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:10:08,544 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:10:08,544 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:10:08,544 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:10:08,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:10:08,545 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:10:08,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:10:08,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:10:08,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:10:08,546 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:10:08,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:10:08,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:10:08,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:10:08,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:10:08,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:10:08,547 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:10:08,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:10:08,548 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:10:08,548 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:10:08,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:10:08,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:10:08,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:10:08,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:10:08,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:10:08,623 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:10:08,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_seq_init_true-unreach-call_ground.i [2018-11-23 10:10:08,687 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23830633c/7c9e9eab7a28458389ee13f1fd8089ee/FLAGfac717296 [2018-11-23 10:10:09,125 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:10:09,125 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_seq_init_true-unreach-call_ground.i [2018-11-23 10:10:09,131 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23830633c/7c9e9eab7a28458389ee13f1fd8089ee/FLAGfac717296 [2018-11-23 10:10:09,516 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23830633c/7c9e9eab7a28458389ee13f1fd8089ee [2018-11-23 10:10:09,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:10:09,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:10:09,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:10:09,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:10:09,534 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:10:09,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72cd070e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09, skipping insertion in model container [2018-11-23 10:10:09,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:10:09,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:10:09,847 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:10:09,855 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:10:09,889 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:10:09,924 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:10:09,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09 WrapperNode [2018-11-23 10:10:09,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:10:09,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:10:09,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:10:09,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:10:09,937 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:10:09" (1/1) ... [2018-11-23 10:10:09,949 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:10:09" (1/1) ... [2018-11-23 10:10:09,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:10:09,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:10:09,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:10:09,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:10:09,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:09,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (1/1) ... [2018-11-23 10:10:10,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:10:10,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:10:10,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:10:10,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:10:10,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (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:10:10,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:10:10,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:10:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:10:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:10:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:10:10,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:10:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:10:10,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:10:10,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:10:10,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:10:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:10:10,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:10:10,636 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:10:10,636 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:10:10,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:10 BoogieIcfgContainer [2018-11-23 10:10:10,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:10:10,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:10:10,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:10:10,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:10:10,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:10:09" (1/3) ... [2018-11-23 10:10:10,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dceb35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:10, skipping insertion in model container [2018-11-23 10:10:10,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:09" (2/3) ... [2018-11-23 10:10:10,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dceb35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:10, skipping insertion in model container [2018-11-23 10:10:10,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:10" (3/3) ... [2018-11-23 10:10:10,645 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_seq_init_true-unreach-call_ground.i [2018-11-23 10:10:10,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:10:10,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:10:10,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:10:10,716 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:10:10,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:10:10,717 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:10:10,717 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:10:10,718 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:10:10,718 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:10:10,718 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:10:10,719 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:10:10,719 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:10:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 10:10:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:10:10,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:10,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:10,747 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:10,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 10:10:10,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:10,758 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:10:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:10,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:10,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 10:10:10,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-23 10:10:10,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 10:10:10,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 10:10:10,923 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2018-11-23 10:10:10,923 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {26#true} is VALID [2018-11-23 10:10:10,924 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 10:10:10,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 1bv32; {27#false} is VALID [2018-11-23 10:10:10,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {27#false} is VALID [2018-11-23 10:10:10,925 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-23 10:10:10,925 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 10:10:10,925 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 10:10:10,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 10:10:10,928 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:10:10,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:10:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:10:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:10:10,942 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:10:10,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:10,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:10:11,061 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:10:11,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:10:11,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:10:11,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:10:11,072 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 10:10:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:11,387 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:10:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:10:11,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:10:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:10:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:10:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:10:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 10:10:11,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 10:10:11,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:11,560 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:10:11,560 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 10:10:11,564 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:10:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 10:10:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 10:10:11,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:11,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 10:10:11,612 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:10:11,612 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:10:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:11,616 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:10:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:10:11,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:11,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:11,617 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:10:11,617 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:10:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:11,621 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:10:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:10:11,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:11,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:11,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:11,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:10:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 10:10:11,627 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 10:10:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:11,628 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 10:10:11,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:10:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:10:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:10:11,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:11,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:11,630 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:11,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 10:10:11,631 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:11,631 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:10:11,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:11,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:11,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {178#true} call ULTIMATE.init(); {178#true} is VALID [2018-11-23 10:10:11,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {178#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {178#true} is VALID [2018-11-23 10:10:11,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#true} assume true; {178#true} is VALID [2018-11-23 10:10:11,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {178#true} {178#true} #48#return; {178#true} is VALID [2018-11-23 10:10:11,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {178#true} call #t~ret4 := main(); {178#true} is VALID [2018-11-23 10:10:11,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {178#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {198#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:11,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {198#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {179#false} is VALID [2018-11-23 10:10:11,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#false} havoc ~x~0;~x~0 := 1bv32; {179#false} is VALID [2018-11-23 10:10:11,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {179#false} is VALID [2018-11-23 10:10:11,856 INFO L256 TraceCheckUtils]: 9: Hoare triple {179#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {179#false} is VALID [2018-11-23 10:10:11,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {179#false} ~cond := #in~cond; {179#false} is VALID [2018-11-23 10:10:11,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {179#false} assume 0bv32 == ~cond; {179#false} is VALID [2018-11-23 10:10:11,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {179#false} assume !false; {179#false} is VALID [2018-11-23 10:10:11,858 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:10:11,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:10:11,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:10:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:10:11,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:10:11,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:11,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:10:11,907 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:10:11,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:10:11,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:10:11,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:10:11,909 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 10:10:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:12,006 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 10:10:12,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:10:12,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:10:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:10:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:10:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:10:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 10:10:12,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 10:10:12,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:12,085 INFO L225 Difference]: With dead ends: 30 [2018-11-23 10:10:12,085 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:10:12,087 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:10:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:10:12,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:10:12,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:12,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:12,176 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:12,176 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:12,178 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:10:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:10:12,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:12,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:12,181 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:12,182 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:10:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:12,185 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:10:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:10:12,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:12,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:12,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:12,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:10:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 10:10:12,191 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 10:10:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:12,191 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 10:10:12,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:10:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:10:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:10:12,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:12,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:12,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:12,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 10:10:12,198 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:12,199 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:10:12,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:10:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:12,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:12,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:10:12,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:10:12,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:10:12,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:10:12,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret4 := main(); {327#true} is VALID [2018-11-23 10:10:12,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {347#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:12,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {347#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {351#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:12,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:10:12,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 1bv32; {328#false} is VALID [2018-11-23 10:10:12,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {328#false} is VALID [2018-11-23 10:10:12,589 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:10:12,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:10:12,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:10:12,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:10:12,591 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:10:12,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:12,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {328#false} assume !false; {328#false} is VALID [2018-11-23 10:10:12,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#false} assume 0bv32 == ~cond; {328#false} is VALID [2018-11-23 10:10:12,859 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#false} ~cond := #in~cond; {328#false} is VALID [2018-11-23 10:10:12,860 INFO L256 TraceCheckUtils]: 10: Hoare triple {328#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {328#false} is VALID [2018-11-23 10:10:12,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {328#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {328#false} is VALID [2018-11-23 10:10:12,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#false} havoc ~x~0;~x~0 := 1bv32; {328#false} is VALID [2018-11-23 10:10:12,861 INFO L273 TraceCheckUtils]: 7: Hoare triple {391#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {328#false} is VALID [2018-11-23 10:10:12,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {391#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:12,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {395#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:12,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret4 := main(); {327#true} is VALID [2018-11-23 10:10:12,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #48#return; {327#true} is VALID [2018-11-23 10:10:12,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2018-11-23 10:10:12,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {327#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {327#true} is VALID [2018-11-23 10:10:12,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {327#true} is VALID [2018-11-23 10:10:12,890 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:10:12,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:12,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:10:12,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:10:12,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:12,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:10:12,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:12,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:10:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:10:12,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:10:12,972 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 10:10:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:13,284 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:10:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:10:13,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 10:10:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:10:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:10:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:10:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 10:10:13,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 10:10:13,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:13,351 INFO L225 Difference]: With dead ends: 33 [2018-11-23 10:10:13,351 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:10:13,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:10:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:10:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:10:13,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:13,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:10:13,440 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:10:13,440 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:10:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:13,442 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:10:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:10:13,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:13,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:13,443 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:10:13,443 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:10:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:13,445 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:10:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:10:13,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:13,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:13,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:13,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:10:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 10:10:13,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2018-11-23 10:10:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:13,449 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 10:10:13,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:10:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:10:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:10:13,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:13,450 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:13,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:13,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 2 times [2018-11-23 10:10:13,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:13,452 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:10:13,470 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:10:13,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:10:13,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:13,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:13,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:10:13,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:10:13,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:10:13,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:10:13,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret4 := main(); {544#true} is VALID [2018-11-23 10:10:13,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {564#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:13,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {564#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {568#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:10:13,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {572#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:13,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {572#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {576#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:10:13,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {580#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:13,729 INFO L273 TraceCheckUtils]: 10: Hoare triple {580#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:10:13,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 1bv32; {545#false} is VALID [2018-11-23 10:10:13,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {545#false} is VALID [2018-11-23 10:10:13,729 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:10:13,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:10:13,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:10:13,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:10:13,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:13,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:13,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {545#false} assume !false; {545#false} is VALID [2018-11-23 10:10:13,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#false} assume 0bv32 == ~cond; {545#false} is VALID [2018-11-23 10:10:13,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {545#false} ~cond := #in~cond; {545#false} is VALID [2018-11-23 10:10:13,942 INFO L256 TraceCheckUtils]: 13: Hoare triple {545#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {545#false} is VALID [2018-11-23 10:10:13,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {545#false} is VALID [2018-11-23 10:10:13,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {545#false} havoc ~x~0;~x~0 := 1bv32; {545#false} is VALID [2018-11-23 10:10:13,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {545#false} is VALID [2018-11-23 10:10:13,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {620#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:13,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {624#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:13,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {628#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:13,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {632#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:13,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {636#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:13,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {544#true} call #t~ret4 := main(); {544#true} is VALID [2018-11-23 10:10:13,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {544#true} {544#true} #48#return; {544#true} is VALID [2018-11-23 10:10:13,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {544#true} assume true; {544#true} is VALID [2018-11-23 10:10:13,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {544#true} is VALID [2018-11-23 10:10:13,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {544#true} call ULTIMATE.init(); {544#true} is VALID [2018-11-23 10:10:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:10:13,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:10:13,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:13,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:10:14,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:14,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:10:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:10:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:10:14,018 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-11-23 10:10:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:14,954 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 10:10:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:10:14,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-23 10:10:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:10:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:10:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:10:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2018-11-23 10:10:14,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2018-11-23 10:10:15,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:15,082 INFO L225 Difference]: With dead ends: 39 [2018-11-23 10:10:15,082 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:10:15,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:10:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:10:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 10:10:15,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:15,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 10:10:15,113 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:10:15,113 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:10:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:15,115 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:10:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:10:15,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:15,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:15,116 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 10:10:15,117 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 10:10:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:15,119 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 10:10:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:10:15,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:15,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:15,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:15,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:10:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 10:10:15,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2018-11-23 10:10:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:15,123 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 10:10:15,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:10:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 10:10:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:10:15,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:15,124 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:15,124 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:15,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 3 times [2018-11-23 10:10:15,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:15,126 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:10:15,146 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:10:15,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:10:15,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:15,908 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:10:15,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:10:15,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:10:15,909 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:10:15,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret4 := main(); {827#true} is VALID [2018-11-23 10:10:15,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {847#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {847#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {851#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {855#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {855#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {859#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {863#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {867#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:10:15,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {867#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {871#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {871#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {875#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {875#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {883#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:10:15,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {883#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {887#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:10:15,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 1bv32; {828#false} is VALID [2018-11-23 10:10:15,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {828#false} is VALID [2018-11-23 10:10:15,924 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:10:15,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:10:15,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:10:15,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:10:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:15,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:16,764 INFO L273 TraceCheckUtils]: 22: Hoare triple {828#false} assume !false; {828#false} is VALID [2018-11-23 10:10:16,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {828#false} assume 0bv32 == ~cond; {828#false} is VALID [2018-11-23 10:10:16,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2018-11-23 10:10:16,765 INFO L256 TraceCheckUtils]: 19: Hoare triple {828#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {828#false} is VALID [2018-11-23 10:10:16,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {828#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {828#false} is VALID [2018-11-23 10:10:16,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {828#false} havoc ~x~0;~x~0 := 1bv32; {828#false} is VALID [2018-11-23 10:10:16,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {828#false} is VALID [2018-11-23 10:10:16,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32)) (not (bvslt main_~i~0 (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {927#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:16,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {935#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {931#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32)) (not (bvslt main_~i~0 (_ bv100000 32))))} is VALID [2018-11-23 10:10:16,787 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {935#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:10:16,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {943#(or (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {939#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:10:16,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {947#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {943#(or (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:10:16,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {951#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {947#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:10:16,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {955#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {951#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:10:16,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(or (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {955#(or (not (bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:10:16,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(or (not (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {959#(or (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:10:16,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {967#(or (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {963#(or (not (bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32)))} is VALID [2018-11-23 10:10:16,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {827#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {967#(or (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))))} is VALID [2018-11-23 10:10:16,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret4 := main(); {827#true} is VALID [2018-11-23 10:10:16,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #48#return; {827#true} is VALID [2018-11-23 10:10:16,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2018-11-23 10:10:16,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {827#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {827#true} is VALID [2018-11-23 10:10:16,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2018-11-23 10:10:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:16,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:16,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:10:16,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:10:16,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:16,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:10:16,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:16,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:10:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:10:16,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:10:16,961 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 24 states. [2018-11-23 10:10:18,594 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-23 10:10:18,836 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:10:19,062 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 7 [2018-11-23 10:10:19,805 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 7 [2018-11-23 10:10:20,838 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 10:10:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:21,745 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 10:10:21,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:10:21,745 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-11-23 10:10:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2018-11-23 10:10:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:10:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2018-11-23 10:10:21,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2018-11-23 10:10:21,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:21,997 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:10:21,998 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:10:21,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 10:10:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:10:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 10:10:22,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:22,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 10:10:22,064 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:10:22,064 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:10:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:22,067 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:10:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:10:22,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:22,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:22,068 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:10:22,068 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:10:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:22,070 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 10:10:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:10:22,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:22,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:22,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:22,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:10:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 10:10:22,074 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 23 [2018-11-23 10:10:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:22,074 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 10:10:22,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:10:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 10:10:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:10:22,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:22,076 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:22,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:22,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 4 times [2018-11-23 10:10:22,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:22,078 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:10:22,097 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:10:22,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:10:22,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:22,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:23,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {1244#true} call ULTIMATE.init(); {1244#true} is VALID [2018-11-23 10:10:23,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {1244#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1244#true} is VALID [2018-11-23 10:10:23,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {1244#true} assume true; {1244#true} is VALID [2018-11-23 10:10:23,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1244#true} {1244#true} #48#return; {1244#true} is VALID [2018-11-23 10:10:23,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {1244#true} call #t~ret4 := main(); {1244#true} is VALID [2018-11-23 10:10:23,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {1244#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {1264#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {1264#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1268#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1272#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1272#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1276#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1276#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1280#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1284#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:10:23,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {1284#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1292#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:10:23,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {1292#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1296#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {1296#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1300#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {1300#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1304#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 10:10:23,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1308#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,245 INFO L273 TraceCheckUtils]: 17: Hoare triple {1308#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1312#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1312#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1316#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {1316#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1320#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:10:23,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {1320#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1324#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {1324#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1328#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:10:23,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {1328#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1332#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {1332#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1336#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {1336#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1340#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:10:23,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {1340#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1344#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,257 INFO L273 TraceCheckUtils]: 26: Hoare triple {1344#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1348#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {1348#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1352#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:23,259 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1245#false} is VALID [2018-11-23 10:10:23,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {1245#false} havoc ~x~0;~x~0 := 1bv32; {1245#false} is VALID [2018-11-23 10:10:23,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {1245#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {1245#false} is VALID [2018-11-23 10:10:23,259 INFO L256 TraceCheckUtils]: 31: Hoare triple {1245#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {1245#false} is VALID [2018-11-23 10:10:23,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {1245#false} ~cond := #in~cond; {1245#false} is VALID [2018-11-23 10:10:23,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {1245#false} assume 0bv32 == ~cond; {1245#false} is VALID [2018-11-23 10:10:23,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {1245#false} assume !false; {1245#false} is VALID [2018-11-23 10:10:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:23,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:25,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {1245#false} assume !false; {1245#false} is VALID [2018-11-23 10:10:25,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {1245#false} assume 0bv32 == ~cond; {1245#false} is VALID [2018-11-23 10:10:25,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {1245#false} ~cond := #in~cond; {1245#false} is VALID [2018-11-23 10:10:25,116 INFO L256 TraceCheckUtils]: 31: Hoare triple {1245#false} call __VERIFIER_assert((if ~bvsge32(#t~mem2, #t~mem3) then 1bv32 else 0bv32)); {1245#false} is VALID [2018-11-23 10:10:25,117 INFO L273 TraceCheckUtils]: 30: Hoare triple {1245#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~x~0, 1bv32))), 4bv32); {1245#false} is VALID [2018-11-23 10:10:25,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {1245#false} havoc ~x~0;~x~0 := 1bv32; {1245#false} is VALID [2018-11-23 10:10:25,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {1392#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1245#false} is VALID [2018-11-23 10:10:25,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {1396#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1392#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:25,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {1400#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1396#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {1404#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1400#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {1408#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1404#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,145 INFO L273 TraceCheckUtils]: 23: Hoare triple {1412#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1408#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1412#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {1420#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1416#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,168 INFO L273 TraceCheckUtils]: 20: Hoare triple {1424#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1420#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {1428#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1424#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {1432#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1428#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {1436#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1432#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {1440#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1436#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {1444#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1440#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {1448#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1444#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {1452#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1448#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1452#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {1460#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1456#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {1464#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1460#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1468#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1464#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {1472#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1468#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {1476#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1472#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {1480#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), 4bv32);call write~intINTTYPE4(~bvadd32(1bv32, #t~mem0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem0;~i~0 := ~bvadd32(1bv32, ~i~0); {1476#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1244#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;~i~0 := 1bv32;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32); {1480#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:25,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1244#true} call #t~ret4 := main(); {1244#true} is VALID [2018-11-23 10:10:25,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1244#true} {1244#true} #48#return; {1244#true} is VALID [2018-11-23 10:10:25,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {1244#true} assume true; {1244#true} is VALID [2018-11-23 10:10:25,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {1244#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1244#true} is VALID [2018-11-23 10:10:25,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {1244#true} call ULTIMATE.init(); {1244#true} is VALID [2018-11-23 10:10:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:25,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:25,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:10:25,267 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:10:25,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:25,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:10:25,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:25,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:10:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:10:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:10:25,472 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 48 states. [2018-11-23 10:10:30,584 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:10:31,064 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:10:31,551 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:10:32,115 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:10:32,680 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:10:33,239 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:10:33,805 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:10:34,399 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:10:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:40,545 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2018-11-23 10:10:40,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:10:40,546 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 35 [2018-11-23 10:10:40,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:40,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:10:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 100 transitions. [2018-11-23 10:10:40,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 100 transitions. [2018-11-23 10:10:40,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:40,835 INFO L225 Difference]: With dead ends: 75 [2018-11-23 10:10:40,836 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 10:10:40,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 23 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:10:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 10:10:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 10:10:41,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:41,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-23 10:10:41,082 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:10:41,082 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:10:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:41,085 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:10:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:10:41,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:41,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:41,086 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-23 10:10:41,087 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-23 10:10:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:41,089 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 10:10:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:10:41,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:41,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:41,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:41,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 10:10:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-23 10:10:41,093 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 35 [2018-11-23 10:10:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:41,094 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-23 10:10:41,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:10:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-23 10:10:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 10:10:41,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:41,096 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:41,096 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1216454706, now seen corresponding path program 5 times [2018-11-23 10:10:41,097 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:41,097 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:10:41,119 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1