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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 20:49:58,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 20:49:58,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 20:49:58,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 20:49:58,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 20:49:58,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 20:49:58,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 20:49:58,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 20:49:58,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 20:49:58,183 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 20:49:58,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 20:49:58,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 20:49:58,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 20:49:58,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 20:49:58,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 20:49:58,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 20:49:58,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 20:49:58,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 20:49:58,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 20:49:58,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 20:49:58,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 20:49:58,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 20:49:58,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 20:49:58,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 20:49:58,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 20:49:58,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 20:49:58,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 20:49:58,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 20:49:58,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 20:49:58,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 20:49:58,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 20:49:58,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 20:49:58,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 20:49:58,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 20:49:58,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 20:49:58,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 20:49:58,211 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-18 20:49:58,236 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 20:49:58,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 20:49:58,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 20:49:58,238 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 20:49:58,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 20:49:58,239 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 20:49:58,239 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 20:49:58,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 20:49:58,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 20:49:58,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 20:49:58,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 20:49:58,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 20:49:58,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 20:49:58,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 20:49:58,242 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 20:49:58,242 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 20:49:58,242 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 20:49:58,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 20:49:58,242 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 20:49:58,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 20:49:58,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 20:49:58,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 20:49:58,244 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 20:49:58,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 20:49:58,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 20:49:58,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 20:49:58,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 20:49:58,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 20:49:58,245 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 20:49:58,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 20:49:58,245 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 20:49:58,246 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 20:49:58,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 20:49:58,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 20:49:58,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 20:49:58,313 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 20:49:58,315 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 20:49:58,316 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 20:49:58,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-18 20:49:58,372 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18322a56b/42dba1cfe0f14f948855a28849ead123/FLAGd913f9011 [2018-11-18 20:49:58,846 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 20:49:58,848 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_01_true-unreach-call.i [2018-11-18 20:49:58,856 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18322a56b/42dba1cfe0f14f948855a28849ead123/FLAGd913f9011 [2018-11-18 20:49:59,178 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18322a56b/42dba1cfe0f14f948855a28849ead123 [2018-11-18 20:49:59,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 20:49:59,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 20:49:59,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 20:49:59,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 20:49:59,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 20:49:59,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f325e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59, skipping insertion in model container [2018-11-18 20:49:59,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 20:49:59,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 20:49:59,528 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:49:59,534 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 20:49:59,570 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:49:59,595 INFO L195 MainTranslator]: Completed translation [2018-11-18 20:49:59,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59 WrapperNode [2018-11-18 20:49:59,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 20:49:59,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 20:49:59,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 20:49:59,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 20:49:59,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (1/1) ... [2018-11-18 20:49:59,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 20:49:59,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 20:49:59,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 20:49:59,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 20:49:59,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (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-18 20:49:59,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 20:49:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 20:49:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 20:49:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 20:49:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 20:49:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 20:49:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 20:49:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 20:49:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 20:49:59,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 20:50:00,400 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 20:50:00,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:50:00 BoogieIcfgContainer [2018-11-18 20:50:00,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 20:50:00,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 20:50:00,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 20:50:00,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 20:50:00,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:49:59" (1/3) ... [2018-11-18 20:50:00,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1762d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:50:00, skipping insertion in model container [2018-11-18 20:50:00,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:59" (2/3) ... [2018-11-18 20:50:00,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1762d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:50:00, skipping insertion in model container [2018-11-18 20:50:00,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:50:00" (3/3) ... [2018-11-18 20:50:00,410 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_01_true-unreach-call.i [2018-11-18 20:50:00,420 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 20:50:00,429 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 20:50:00,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 20:50:00,482 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 20:50:00,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 20:50:00,483 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 20:50:00,483 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 20:50:00,483 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 20:50:00,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 20:50:00,484 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 20:50:00,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 20:50:00,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 20:50:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-18 20:50:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 20:50:00,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:00,512 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:00,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:00,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:00,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-18 20:50:00,527 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:00,528 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-18 20:50:00,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:50:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:00,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:00,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-18 20:50:00,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-18 20:50:00,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-18 20:50:00,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-18 20:50:00,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-18 20:50:00,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {30#true} is VALID [2018-11-18 20:50:00,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-18 20:50:00,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-18 20:50:00,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-18 20:50:00,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0bv32;~j~0 := 0bv32; {31#false} is VALID [2018-11-18 20:50:00,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-18 20:50:00,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {31#false} is VALID [2018-11-18 20:50:00,725 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-18 20:50:00,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-18 20:50:00,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-18 20:50:00,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-18 20:50:00,729 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-18 20:50:00,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:50:00,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:50:00,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 20:50:00,742 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 20:50:00,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:00,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 20:50:00,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:00,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 20:50:00,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 20:50:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 20:50:00,979 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-18 20:50:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:01,230 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-18 20:50:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 20:50:01,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 20:50:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:50:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:50:01,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-18 20:50:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:50:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-18 20:50:01,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-18 20:50:01,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:01,474 INFO L225 Difference]: With dead ends: 46 [2018-11-18 20:50:01,474 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 20:50:01,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-18 20:50:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 20:50:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 20:50:01,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:50:01,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 20:50:01,541 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 20:50:01,542 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 20:50:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:01,545 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 20:50:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 20:50:01,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:01,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:01,547 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 20:50:01,547 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 20:50:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:01,551 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-18 20:50:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 20:50:01,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:01,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:01,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:50:01,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:50:01,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 20:50:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-18 20:50:01,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-18 20:50:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:50:01,557 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-18 20:50:01,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 20:50:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-18 20:50:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 20:50:01,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:01,559 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:01,560 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:01,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:01,560 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-18 20:50:01,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:01,561 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-18 20:50:01,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:50:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:01,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:01,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-18 20:50:01,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {213#true} is VALID [2018-11-18 20:50:01,728 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-18 20:50:01,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #63#return; {213#true} is VALID [2018-11-18 20:50:01,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret4 := main(); {213#true} is VALID [2018-11-18 20:50:01,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:01,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume true; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:01,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {214#false} is VALID [2018-11-18 20:50:01,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#false} ~i~0 := 0bv32; {214#false} is VALID [2018-11-18 20:50:01,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-18 20:50:01,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} assume !~bvslt32(~i~0, 10000bv32); {214#false} is VALID [2018-11-18 20:50:01,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} ~i~0 := 0bv32;~j~0 := 0bv32; {214#false} is VALID [2018-11-18 20:50:01,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-18 20:50:01,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {214#false} is VALID [2018-11-18 20:50:01,767 INFO L256 TraceCheckUtils]: 14: Hoare triple {214#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-18 20:50:01,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-18 20:50:01,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {214#false} assume 0bv32 == ~cond; {214#false} is VALID [2018-11-18 20:50:01,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-18 20:50:01,770 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-18 20:50:01,770 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:50:01,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:50:01,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 20:50:01,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 20:50:01,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:01,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 20:50:01,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:01,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 20:50:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 20:50:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 20:50:01,820 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-18 20:50:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:02,293 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-18 20:50:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 20:50:02,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 20:50:02,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:50:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:50:02,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-18 20:50:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:50:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-18 20:50:02,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-18 20:50:02,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:02,536 INFO L225 Difference]: With dead ends: 44 [2018-11-18 20:50:02,536 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 20:50:02,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-18 20:50:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 20:50:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-18 20:50:02,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:50:02,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-18 20:50:02,556 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-18 20:50:02,556 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-18 20:50:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:02,561 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 20:50:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 20:50:02,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:02,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:02,563 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-18 20:50:02,563 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-18 20:50:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:02,566 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 20:50:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 20:50:02,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:02,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:02,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:50:02,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:50:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 20:50:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 20:50:02,570 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2018-11-18 20:50:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:50:02,571 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 20:50:02,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 20:50:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 20:50:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 20:50:02,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:02,572 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:02,572 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:02,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1402898029, now seen corresponding path program 1 times [2018-11-18 20:50:02,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:02,574 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-18 20:50:02,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:50:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:02,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:02,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2018-11-18 20:50:02,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {427#true} is VALID [2018-11-18 20:50:02,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2018-11-18 20:50:02,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #63#return; {427#true} is VALID [2018-11-18 20:50:02,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret4 := main(); {427#true} is VALID [2018-11-18 20:50:02,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {427#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {447#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:02,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(= main_~i~0 (_ bv0 32))} assume true; {447#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:02,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {447#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:02,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:02,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {454#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {428#false} is VALID [2018-11-18 20:50:02,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#false} ~i~0 := 0bv32; {428#false} is VALID [2018-11-18 20:50:02,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {428#false} is VALID [2018-11-18 20:50:02,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {428#false} assume !~bvslt32(~i~0, 10000bv32); {428#false} is VALID [2018-11-18 20:50:02,810 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#false} ~i~0 := 0bv32;~j~0 := 0bv32; {428#false} is VALID [2018-11-18 20:50:02,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {428#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {428#false} is VALID [2018-11-18 20:50:02,811 INFO L256 TraceCheckUtils]: 18: Hoare triple {428#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {428#false} is VALID [2018-11-18 20:50:02,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2018-11-18 20:50:02,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {428#false} assume 0bv32 == ~cond; {428#false} is VALID [2018-11-18 20:50:02,812 INFO L273 TraceCheckUtils]: 21: Hoare triple {428#false} assume !false; {428#false} is VALID [2018-11-18 20:50:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 20:50:02,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:50:02,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {428#false} assume !false; {428#false} is VALID [2018-11-18 20:50:02,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {428#false} assume 0bv32 == ~cond; {428#false} is VALID [2018-11-18 20:50:02,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {428#false} ~cond := #in~cond; {428#false} is VALID [2018-11-18 20:50:02,929 INFO L256 TraceCheckUtils]: 18: Hoare triple {428#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {428#false} is VALID [2018-11-18 20:50:02,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {428#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {428#false} is VALID [2018-11-18 20:50:02,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,930 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#false} ~i~0 := 0bv32;~j~0 := 0bv32; {428#false} is VALID [2018-11-18 20:50:02,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {428#false} assume !~bvslt32(~i~0, 10000bv32); {428#false} is VALID [2018-11-18 20:50:02,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {428#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {428#false} is VALID [2018-11-18 20:50:02,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {428#false} assume true; {428#false} is VALID [2018-11-18 20:50:02,932 INFO L273 TraceCheckUtils]: 10: Hoare triple {428#false} ~i~0 := 0bv32; {428#false} is VALID [2018-11-18 20:50:02,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {533#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {428#false} is VALID [2018-11-18 20:50:02,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {533#(bvslt main_~i~0 (_ bv10000 32))} assume true; {533#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:02,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {533#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:02,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {540#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {540#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:02,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {427#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {540#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:02,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {427#true} call #t~ret4 := main(); {427#true} is VALID [2018-11-18 20:50:02,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} #63#return; {427#true} is VALID [2018-11-18 20:50:02,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {427#true} assume true; {427#true} is VALID [2018-11-18 20:50:02,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {427#true} is VALID [2018-11-18 20:50:02,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {427#true} call ULTIMATE.init(); {427#true} is VALID [2018-11-18 20:50:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 20:50:02,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:50:02,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 20:50:02,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-18 20:50:02,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:02,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 20:50:03,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:03,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 20:50:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 20:50:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 20:50:03,015 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-18 20:50:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:03,688 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-11-18 20:50:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 20:50:03,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-18 20:50:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:50:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:50:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-18 20:50:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:50:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-18 20:50:03,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2018-11-18 20:50:03,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:03,867 INFO L225 Difference]: With dead ends: 68 [2018-11-18 20:50:03,867 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 20:50:03,868 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 20:50:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 20:50:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 38. [2018-11-18 20:50:03,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:50:03,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 38 states. [2018-11-18 20:50:03,904 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 38 states. [2018-11-18 20:50:03,904 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 38 states. [2018-11-18 20:50:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:03,909 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-18 20:50:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 20:50:03,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:03,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:03,911 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 52 states. [2018-11-18 20:50:03,911 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 52 states. [2018-11-18 20:50:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:03,916 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-18 20:50:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-18 20:50:03,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:03,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:03,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:50:03,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:50:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 20:50:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-18 20:50:03,920 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2018-11-18 20:50:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:50:03,920 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-18 20:50:03,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 20:50:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-18 20:50:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 20:50:03,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:03,922 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:03,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:03,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2119100883, now seen corresponding path program 2 times [2018-11-18 20:50:03,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:03,924 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-18 20:50:03,942 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 20:50:04,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 20:50:04,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:50:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:04,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:04,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2018-11-18 20:50:04,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {822#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {822#true} is VALID [2018-11-18 20:50:04,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-18 20:50:04,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #63#return; {822#true} is VALID [2018-11-18 20:50:04,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret4 := main(); {822#true} is VALID [2018-11-18 20:50:04,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {842#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:04,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {842#(= main_~i~0 (_ bv0 32))} assume true; {842#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:04,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {842#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {849#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {849#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {849#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {849#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {856#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {856#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {856#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {856#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {863#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {863#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:04,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {863#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {870#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:50:04,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(= (_ bv4 32) main_~i~0)} assume true; {870#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:50:04,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {870#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 10000bv32); {823#false} is VALID [2018-11-18 20:50:04,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#false} ~i~0 := 0bv32; {823#false} is VALID [2018-11-18 20:50:04,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,212 INFO L273 TraceCheckUtils]: 20: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#false} assume !~bvslt32(~i~0, 10000bv32); {823#false} is VALID [2018-11-18 20:50:04,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {823#false} ~i~0 := 0bv32;~j~0 := 0bv32; {823#false} is VALID [2018-11-18 20:50:04,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {823#false} is VALID [2018-11-18 20:50:04,215 INFO L256 TraceCheckUtils]: 30: Hoare triple {823#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {823#false} is VALID [2018-11-18 20:50:04,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2018-11-18 20:50:04,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {823#false} assume 0bv32 == ~cond; {823#false} is VALID [2018-11-18 20:50:04,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {823#false} assume !false; {823#false} is VALID [2018-11-18 20:50:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 20:50:04,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:50:04,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {823#false} assume !false; {823#false} is VALID [2018-11-18 20:50:04,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {823#false} assume 0bv32 == ~cond; {823#false} is VALID [2018-11-18 20:50:04,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {823#false} ~cond := #in~cond; {823#false} is VALID [2018-11-18 20:50:04,404 INFO L256 TraceCheckUtils]: 30: Hoare triple {823#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {823#false} is VALID [2018-11-18 20:50:04,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {823#false} is VALID [2018-11-18 20:50:04,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {823#false} ~i~0 := 0bv32;~j~0 := 0bv32; {823#false} is VALID [2018-11-18 20:50:04,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {823#false} assume !~bvslt32(~i~0, 10000bv32); {823#false} is VALID [2018-11-18 20:50:04,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,407 INFO L273 TraceCheckUtils]: 19: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,407 INFO L273 TraceCheckUtils]: 18: Hoare triple {823#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {823#false} is VALID [2018-11-18 20:50:04,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {823#false} assume true; {823#false} is VALID [2018-11-18 20:50:04,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {823#false} ~i~0 := 0bv32; {823#false} is VALID [2018-11-18 20:50:04,420 INFO L273 TraceCheckUtils]: 15: Hoare triple {985#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {823#false} is VALID [2018-11-18 20:50:04,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {985#(bvslt main_~i~0 (_ bv10000 32))} assume true; {985#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:04,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {992#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {985#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:04,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {992#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {992#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {999#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {992#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {999#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {999#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {1006#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {999#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {1006#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {1006#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {1013#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1006#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {1013#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {1013#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1013#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:04,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret4 := main(); {822#true} is VALID [2018-11-18 20:50:04,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #63#return; {822#true} is VALID [2018-11-18 20:50:04,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2018-11-18 20:50:04,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {822#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {822#true} is VALID [2018-11-18 20:50:04,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {822#true} is VALID [2018-11-18 20:50:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 20:50:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:50:04,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 20:50:04,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-18 20:50:04,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:04,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 20:50:04,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:04,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 20:50:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 20:50:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-18 20:50:04,649 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 12 states. [2018-11-18 20:50:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:07,298 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2018-11-18 20:50:07,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 20:50:07,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-18 20:50:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:50:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:50:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2018-11-18 20:50:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:50:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2018-11-18 20:50:07,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2018-11-18 20:50:07,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:07,688 INFO L225 Difference]: With dead ends: 122 [2018-11-18 20:50:07,689 INFO L226 Difference]: Without dead ends: 100 [2018-11-18 20:50:07,689 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-18 20:50:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-18 20:50:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 62. [2018-11-18 20:50:07,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:50:07,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 62 states. [2018-11-18 20:50:07,765 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 62 states. [2018-11-18 20:50:07,766 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 62 states. [2018-11-18 20:50:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:07,776 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-18 20:50:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-18 20:50:07,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:07,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:07,779 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 100 states. [2018-11-18 20:50:07,779 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 100 states. [2018-11-18 20:50:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:07,795 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-11-18 20:50:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-18 20:50:07,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:07,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:07,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:50:07,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:50:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 20:50:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-18 20:50:07,806 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2018-11-18 20:50:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:50:07,806 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-18 20:50:07,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 20:50:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-18 20:50:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 20:50:07,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:07,810 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:07,810 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:07,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -501025619, now seen corresponding path program 3 times [2018-11-18 20:50:07,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:07,811 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-18 20:50:07,840 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 20:50:09,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 20:50:09,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:50:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:09,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:09,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2018-11-18 20:50:09,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {1514#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1514#true} is VALID [2018-11-18 20:50:09,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #63#return; {1514#true} is VALID [2018-11-18 20:50:09,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret4 := main(); {1514#true} is VALID [2018-11-18 20:50:09,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {1514#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1514#true} is VALID [2018-11-18 20:50:09,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,953 INFO L273 TraceCheckUtils]: 16: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,954 INFO L273 TraceCheckUtils]: 18: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:09,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:09,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {1514#true} assume !~bvslt32(~i~0, 10000bv32); {1514#true} is VALID [2018-11-18 20:50:09,956 INFO L273 TraceCheckUtils]: 28: Hoare triple {1514#true} ~i~0 := 0bv32; {1603#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:09,956 INFO L273 TraceCheckUtils]: 29: Hoare triple {1603#(= main_~i~0 (_ bv0 32))} assume true; {1603#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:09,957 INFO L273 TraceCheckUtils]: 30: Hoare triple {1603#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1610#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,958 INFO L273 TraceCheckUtils]: 31: Hoare triple {1610#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1610#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,958 INFO L273 TraceCheckUtils]: 32: Hoare triple {1610#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1617#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:50:09,959 INFO L273 TraceCheckUtils]: 33: Hoare triple {1617#(= (_ bv2 32) main_~i~0)} assume true; {1617#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:50:09,959 INFO L273 TraceCheckUtils]: 34: Hoare triple {1617#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1624#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,960 INFO L273 TraceCheckUtils]: 35: Hoare triple {1624#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1624#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,961 INFO L273 TraceCheckUtils]: 36: Hoare triple {1624#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1631#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,962 INFO L273 TraceCheckUtils]: 37: Hoare triple {1631#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1631#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {1631#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1638#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {1638#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1638#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {1638#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1645#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {1645#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {1645#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {1645#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1652#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,972 INFO L273 TraceCheckUtils]: 43: Hoare triple {1652#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1652#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {1652#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1659#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:50:09,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {1659#(= (_ bv8 32) main_~i~0)} assume true; {1659#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:50:09,980 INFO L273 TraceCheckUtils]: 46: Hoare triple {1659#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1666#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {1666#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1666#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,981 INFO L273 TraceCheckUtils]: 48: Hoare triple {1666#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1673#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {1673#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {1673#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:09,982 INFO L273 TraceCheckUtils]: 50: Hoare triple {1673#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {1515#false} is VALID [2018-11-18 20:50:09,982 INFO L273 TraceCheckUtils]: 51: Hoare triple {1515#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1515#false} is VALID [2018-11-18 20:50:09,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {1515#false} assume true; {1515#false} is VALID [2018-11-18 20:50:09,982 INFO L273 TraceCheckUtils]: 53: Hoare triple {1515#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {1515#false} is VALID [2018-11-18 20:50:09,983 INFO L256 TraceCheckUtils]: 54: Hoare triple {1515#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1515#false} is VALID [2018-11-18 20:50:09,983 INFO L273 TraceCheckUtils]: 55: Hoare triple {1515#false} ~cond := #in~cond; {1515#false} is VALID [2018-11-18 20:50:09,983 INFO L273 TraceCheckUtils]: 56: Hoare triple {1515#false} assume 0bv32 == ~cond; {1515#false} is VALID [2018-11-18 20:50:09,983 INFO L273 TraceCheckUtils]: 57: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2018-11-18 20:50:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 20:50:09,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:50:10,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2018-11-18 20:50:10,540 INFO L273 TraceCheckUtils]: 56: Hoare triple {1515#false} assume 0bv32 == ~cond; {1515#false} is VALID [2018-11-18 20:50:10,540 INFO L273 TraceCheckUtils]: 55: Hoare triple {1515#false} ~cond := #in~cond; {1515#false} is VALID [2018-11-18 20:50:10,540 INFO L256 TraceCheckUtils]: 54: Hoare triple {1515#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1515#false} is VALID [2018-11-18 20:50:10,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {1515#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {1515#false} is VALID [2018-11-18 20:50:10,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {1515#false} assume true; {1515#false} is VALID [2018-11-18 20:50:10,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {1515#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1515#false} is VALID [2018-11-18 20:50:10,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {1722#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1515#false} is VALID [2018-11-18 20:50:10,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {1722#(bvslt main_~i~0 (_ bv10000 32))} assume true; {1722#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:10,545 INFO L273 TraceCheckUtils]: 48: Hoare triple {1729#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1722#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:10,545 INFO L273 TraceCheckUtils]: 47: Hoare triple {1729#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {1729#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {1736#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1729#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {1736#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {1736#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,559 INFO L273 TraceCheckUtils]: 44: Hoare triple {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1736#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,560 INFO L273 TraceCheckUtils]: 43: Hoare triple {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,565 INFO L273 TraceCheckUtils]: 42: Hoare triple {1750#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1743#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {1750#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {1750#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,572 INFO L273 TraceCheckUtils]: 40: Hoare triple {1757#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1750#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,572 INFO L273 TraceCheckUtils]: 39: Hoare triple {1757#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume true; {1757#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {1764#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1757#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {1764#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume true; {1764#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1764#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume true; {1771#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {1778#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1771#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,592 INFO L273 TraceCheckUtils]: 33: Hoare triple {1778#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume true; {1778#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,602 INFO L273 TraceCheckUtils]: 32: Hoare triple {1785#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1778#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {1785#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume true; {1785#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {1792#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1785#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {1792#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume true; {1792#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {1514#true} ~i~0 := 0bv32; {1792#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:10,610 INFO L273 TraceCheckUtils]: 27: Hoare triple {1514#true} assume !~bvslt32(~i~0, 10000bv32); {1514#true} is VALID [2018-11-18 20:50:10,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,611 INFO L273 TraceCheckUtils]: 24: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {1514#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1514#true} is VALID [2018-11-18 20:50:10,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {1514#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1514#true} is VALID [2018-11-18 20:50:10,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret4 := main(); {1514#true} is VALID [2018-11-18 20:50:10,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #63#return; {1514#true} is VALID [2018-11-18 20:50:10,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2018-11-18 20:50:10,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {1514#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1514#true} is VALID [2018-11-18 20:50:10,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2018-11-18 20:50:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 20:50:10,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:50:10,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 20:50:10,625 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-11-18 20:50:10,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:10,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 20:50:10,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:10,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 20:50:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 20:50:10,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-18 20:50:10,911 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 24 states. [2018-11-18 20:50:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:21,076 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2018-11-18 20:50:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 20:50:21,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-11-18 20:50:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:50:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:50:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 258 transitions. [2018-11-18 20:50:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:50:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 258 transitions. [2018-11-18 20:50:21,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 258 transitions. [2018-11-18 20:50:21,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:21,683 INFO L225 Difference]: With dead ends: 230 [2018-11-18 20:50:21,684 INFO L226 Difference]: Without dead ends: 196 [2018-11-18 20:50:21,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 20:50:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-11-18 20:50:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 110. [2018-11-18 20:50:21,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:50:21,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 110 states. [2018-11-18 20:50:21,798 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 110 states. [2018-11-18 20:50:21,798 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 110 states. [2018-11-18 20:50:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:21,809 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-11-18 20:50:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2018-11-18 20:50:21,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:21,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:21,811 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 196 states. [2018-11-18 20:50:21,811 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 196 states. [2018-11-18 20:50:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:50:21,822 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-11-18 20:50:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 219 transitions. [2018-11-18 20:50:21,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:50:21,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:50:21,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:50:21,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:50:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 20:50:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-11-18 20:50:21,828 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 58 [2018-11-18 20:50:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:50:21,828 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-11-18 20:50:21,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 20:50:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-18 20:50:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 20:50:21,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:50:21,832 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:50:21,832 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:50:21,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:50:21,832 INFO L82 PathProgramCache]: Analyzing trace with hash 577678765, now seen corresponding path program 4 times [2018-11-18 20:50:21,833 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:50:21,833 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-18 20:50:21,860 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 20:50:22,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 20:50:22,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:50:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:50:22,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:50:23,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-18 20:50:23,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2810#true} is VALID [2018-11-18 20:50:23,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-18 20:50:23,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #63#return; {2810#true} is VALID [2018-11-18 20:50:23,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret4 := main(); {2810#true} is VALID [2018-11-18 20:50:23,137 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2830#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:23,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {2830#(= main_~i~0 (_ bv0 32))} assume true; {2830#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:50:23,138 INFO L273 TraceCheckUtils]: 7: Hoare triple {2830#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2837#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {2837#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2837#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {2837#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2844#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {2844#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2844#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,140 INFO L273 TraceCheckUtils]: 11: Hoare triple {2844#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2851#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {2851#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2851#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,141 INFO L273 TraceCheckUtils]: 13: Hoare triple {2851#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2858#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:50:23,142 INFO L273 TraceCheckUtils]: 14: Hoare triple {2858#(= (_ bv4 32) main_~i~0)} assume true; {2858#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:50:23,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {2858#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2865#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {2865#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2865#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {2865#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2872#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:50:23,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {2872#(= (_ bv6 32) main_~i~0)} assume true; {2872#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:50:23,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {2872#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2879#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {2879#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2879#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {2879#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2886#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {2886#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2886#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {2886#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2893#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-18 20:50:23,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {2893#(= (_ bv9 32) main_~i~0)} assume true; {2893#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-18 20:50:23,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {2893#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2900#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {2900#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2900#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,156 INFO L273 TraceCheckUtils]: 27: Hoare triple {2900#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2907#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-18 20:50:23,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {2907#(= (_ bv11 32) main_~i~0)} assume true; {2907#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-18 20:50:23,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {2907#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2914#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {2914#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {2914#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {2914#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2921#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {2921#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {2921#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {2921#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2928#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:50:23,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {2928#(= (_ bv14 32) main_~i~0)} assume true; {2928#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:50:23,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {2928#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2935#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {2935#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {2935#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {2935#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2942#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {2942#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {2942#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {2942#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2949#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-18 20:50:23,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {2949#(= (_ bv17 32) main_~i~0)} assume true; {2949#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-18 20:50:23,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {2949#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2956#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {2956#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {2956#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {2956#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2963#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-18 20:50:23,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {2963#(= (_ bv19 32) main_~i~0)} assume true; {2963#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-18 20:50:23,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {2963#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2970#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {2970#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {2970#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,173 INFO L273 TraceCheckUtils]: 47: Hoare triple {2970#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2977#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,173 INFO L273 TraceCheckUtils]: 48: Hoare triple {2977#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {2977#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {2977#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2984#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {2984#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {2984#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-18 20:50:23,174 INFO L273 TraceCheckUtils]: 51: Hoare triple {2984#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {2811#false} ~i~0 := 0bv32; {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 53: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 54: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 57: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,175 INFO L273 TraceCheckUtils]: 58: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 59: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 60: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 62: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 63: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 64: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,176 INFO L273 TraceCheckUtils]: 65: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,177 INFO L273 TraceCheckUtils]: 66: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,177 INFO L273 TraceCheckUtils]: 67: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,177 INFO L273 TraceCheckUtils]: 68: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,177 INFO L273 TraceCheckUtils]: 69: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,177 INFO L273 TraceCheckUtils]: 70: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,178 INFO L273 TraceCheckUtils]: 71: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,178 INFO L273 TraceCheckUtils]: 72: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,178 INFO L273 TraceCheckUtils]: 73: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,178 INFO L273 TraceCheckUtils]: 74: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 75: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 76: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 77: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 78: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 79: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,179 INFO L273 TraceCheckUtils]: 80: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 81: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 82: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 83: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 84: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 85: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 86: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,180 INFO L273 TraceCheckUtils]: 87: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 88: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 89: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 90: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 91: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 92: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,181 INFO L273 TraceCheckUtils]: 93: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,182 INFO L273 TraceCheckUtils]: 94: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,182 INFO L273 TraceCheckUtils]: 95: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,182 INFO L273 TraceCheckUtils]: 96: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:23,182 INFO L273 TraceCheckUtils]: 97: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,182 INFO L273 TraceCheckUtils]: 98: Hoare triple {2811#false} assume !~bvslt32(~i~0, 10000bv32); {2811#false} is VALID [2018-11-18 20:50:23,183 INFO L273 TraceCheckUtils]: 99: Hoare triple {2811#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2811#false} is VALID [2018-11-18 20:50:23,183 INFO L273 TraceCheckUtils]: 100: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:23,183 INFO L273 TraceCheckUtils]: 101: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {2811#false} is VALID [2018-11-18 20:50:23,183 INFO L256 TraceCheckUtils]: 102: Hoare triple {2811#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2811#false} is VALID [2018-11-18 20:50:23,183 INFO L273 TraceCheckUtils]: 103: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-18 20:50:23,184 INFO L273 TraceCheckUtils]: 104: Hoare triple {2811#false} assume 0bv32 == ~cond; {2811#false} is VALID [2018-11-18 20:50:23,184 INFO L273 TraceCheckUtils]: 105: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-18 20:50:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 20:50:23,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:50:24,995 INFO L273 TraceCheckUtils]: 105: Hoare triple {2811#false} assume !false; {2811#false} is VALID [2018-11-18 20:50:24,996 INFO L273 TraceCheckUtils]: 104: Hoare triple {2811#false} assume 0bv32 == ~cond; {2811#false} is VALID [2018-11-18 20:50:24,996 INFO L273 TraceCheckUtils]: 103: Hoare triple {2811#false} ~cond := #in~cond; {2811#false} is VALID [2018-11-18 20:50:24,996 INFO L256 TraceCheckUtils]: 102: Hoare triple {2811#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2811#false} is VALID [2018-11-18 20:50:24,996 INFO L273 TraceCheckUtils]: 101: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32); {2811#false} is VALID [2018-11-18 20:50:24,997 INFO L273 TraceCheckUtils]: 100: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,997 INFO L273 TraceCheckUtils]: 99: Hoare triple {2811#false} ~i~0 := 0bv32;~j~0 := 0bv32; {2811#false} is VALID [2018-11-18 20:50:24,997 INFO L273 TraceCheckUtils]: 98: Hoare triple {2811#false} assume !~bvslt32(~i~0, 10000bv32); {2811#false} is VALID [2018-11-18 20:50:24,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 95: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 94: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 93: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 92: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 91: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,998 INFO L273 TraceCheckUtils]: 90: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,999 INFO L273 TraceCheckUtils]: 89: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,999 INFO L273 TraceCheckUtils]: 88: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,999 INFO L273 TraceCheckUtils]: 87: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:24,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:24,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,000 INFO L273 TraceCheckUtils]: 84: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,000 INFO L273 TraceCheckUtils]: 83: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,001 INFO L273 TraceCheckUtils]: 79: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,001 INFO L273 TraceCheckUtils]: 78: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,001 INFO L273 TraceCheckUtils]: 77: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,002 INFO L273 TraceCheckUtils]: 74: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,002 INFO L273 TraceCheckUtils]: 73: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,002 INFO L273 TraceCheckUtils]: 70: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,003 INFO L273 TraceCheckUtils]: 68: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,004 INFO L273 TraceCheckUtils]: 64: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,004 INFO L273 TraceCheckUtils]: 63: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,004 INFO L273 TraceCheckUtils]: 61: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,004 INFO L273 TraceCheckUtils]: 60: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 59: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 58: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 57: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 56: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 55: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {2811#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2811#false} is VALID [2018-11-18 20:50:25,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {2811#false} assume true; {2811#false} is VALID [2018-11-18 20:50:25,006 INFO L273 TraceCheckUtils]: 52: Hoare triple {2811#false} ~i~0 := 0bv32; {2811#false} is VALID [2018-11-18 20:50:25,012 INFO L273 TraceCheckUtils]: 51: Hoare triple {3315#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {2811#false} is VALID [2018-11-18 20:50:25,013 INFO L273 TraceCheckUtils]: 50: Hoare triple {3315#(bvslt main_~i~0 (_ bv10000 32))} assume true; {3315#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:25,014 INFO L273 TraceCheckUtils]: 49: Hoare triple {3322#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3315#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-18 20:50:25,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {3322#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {3322#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,020 INFO L273 TraceCheckUtils]: 47: Hoare triple {3329#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3322#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {3329#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {3329#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {3336#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3329#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,026 INFO L273 TraceCheckUtils]: 44: Hoare triple {3336#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {3336#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,030 INFO L273 TraceCheckUtils]: 43: Hoare triple {3343#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3336#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,031 INFO L273 TraceCheckUtils]: 42: Hoare triple {3343#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {3343#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {3350#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3343#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,035 INFO L273 TraceCheckUtils]: 40: Hoare triple {3350#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume true; {3350#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {3357#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3350#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,041 INFO L273 TraceCheckUtils]: 38: Hoare triple {3357#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume true; {3357#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {3364#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3357#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,045 INFO L273 TraceCheckUtils]: 36: Hoare triple {3364#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume true; {3364#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {3371#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3364#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,052 INFO L273 TraceCheckUtils]: 34: Hoare triple {3371#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume true; {3371#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {3378#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3371#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,057 INFO L273 TraceCheckUtils]: 32: Hoare triple {3378#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume true; {3378#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {3385#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3378#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {3385#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume true; {3385#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {3392#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3385#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {3392#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume true; {3392#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {3399#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3392#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {3399#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume true; {3399#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3399#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {3406#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume true; {3406#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {3413#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3406#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {3413#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume true; {3413#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {3420#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3413#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {3420#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume true; {3420#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {3427#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3420#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {3427#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume true; {3427#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {3434#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3427#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {3434#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume true; {3434#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {3441#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3434#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {3441#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume true; {3441#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {3448#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3441#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {3448#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume true; {3448#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {3455#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3448#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {3455#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume true; {3455#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {3462#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3455#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {3462#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume true; {3462#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {3469#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3462#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {3469#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume true; {3469#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {2810#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3469#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-18 20:50:25,132 INFO L256 TraceCheckUtils]: 4: Hoare triple {2810#true} call #t~ret4 := main(); {2810#true} is VALID [2018-11-18 20:50:25,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2810#true} {2810#true} #63#return; {2810#true} is VALID [2018-11-18 20:50:25,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {2810#true} assume true; {2810#true} is VALID [2018-11-18 20:50:25,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {2810#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2810#true} is VALID [2018-11-18 20:50:25,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {2810#true} call ULTIMATE.init(); {2810#true} is VALID [2018-11-18 20:50:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-18 20:50:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:50:25,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-18 20:50:25,147 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-11-18 20:50:25,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:50:25,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-18 20:50:25,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:50:25,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 20:50:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 20:50:25,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 20:50:25,370 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 48 states. [2018-11-18 20:50:29,861 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-18 20:50:30,389 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-18 20:50:30,934 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-18 20:50:31,480 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-18 20:50:32,043 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-18 20:50:32,595 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-18 20:51:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:51:13,323 INFO L93 Difference]: Finished difference Result 446 states and 542 transitions. [2018-11-18 20:51:13,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 20:51:13,323 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 106 [2018-11-18 20:51:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:51:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:51:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 498 transitions. [2018-11-18 20:51:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:51:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 498 transitions. [2018-11-18 20:51:13,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 498 transitions. [2018-11-18 20:51:14,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:51:14,561 INFO L225 Difference]: With dead ends: 446 [2018-11-18 20:51:14,562 INFO L226 Difference]: Without dead ends: 388 [2018-11-18 20:51:14,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 165 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-18 20:51:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-18 20:51:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 206. [2018-11-18 20:51:14,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:51:14,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 388 states. Second operand 206 states. [2018-11-18 20:51:14,729 INFO L74 IsIncluded]: Start isIncluded. First operand 388 states. Second operand 206 states. [2018-11-18 20:51:14,729 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 206 states. [2018-11-18 20:51:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:51:14,751 INFO L93 Difference]: Finished difference Result 388 states and 435 transitions. [2018-11-18 20:51:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 435 transitions. [2018-11-18 20:51:14,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:51:14,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:51:14,754 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 388 states. [2018-11-18 20:51:14,754 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 388 states. [2018-11-18 20:51:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:51:14,774 INFO L93 Difference]: Finished difference Result 388 states and 435 transitions. [2018-11-18 20:51:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 435 transitions. [2018-11-18 20:51:14,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:51:14,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:51:14,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:51:14,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:51:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-18 20:51:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-11-18 20:51:14,784 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 106 [2018-11-18 20:51:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:51:14,785 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-11-18 20:51:14,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 20:51:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-11-18 20:51:14,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 20:51:14,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:51:14,788 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:51:14,788 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:51:14,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:51:14,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1674448813, now seen corresponding path program 5 times [2018-11-18 20:51:14,790 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:51:14,790 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-18 20:51:14,820 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1