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_copy1_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:49:17,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:49:17,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:49:17,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:49:17,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:49:17,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:49:17,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:49:17,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:49:17,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:49:17,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:49:17,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:49:17,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:49:17,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:49:17,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:49:17,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:49:17,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:49:17,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:49:17,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:49:17,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:49:17,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:49:17,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:49:17,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:49:17,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:49:17,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:49:17,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:49:17,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:49:17,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:49:17,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:49:17,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:49:17,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:49:17,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:49:17,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:49:17,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:49:17,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:49:17,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:49:17,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:49:17,082 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-14 15:49:17,098 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:49:17,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:49:17,099 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:49:17,099 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:49:17,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:49:17,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:49:17,100 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:49:17,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:49:17,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:49:17,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:49:17,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:49:17,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:49:17,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:49:17,102 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:49:17,102 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:49:17,102 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:49:17,103 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:49:17,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:49:17,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:49:17,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:49:17,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:49:17,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:49:17,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:49:17,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:49:17,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:49:17,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:49:17,105 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:49:17,105 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:49:17,105 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:49:17,105 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:49:17,105 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:49:17,106 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:49:17,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:49:17,178 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:49:17,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:49:17,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:49:17,184 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:49:17,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-14 15:49:17,266 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb7a7a1/88f4f42082684b56916adcce51197f9f/FLAGf4487389f [2018-11-14 15:49:17,791 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:49:17,791 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_false-unreach-call_ground.i [2018-11-14 15:49:17,797 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb7a7a1/88f4f42082684b56916adcce51197f9f/FLAGf4487389f [2018-11-14 15:49:17,811 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82cb7a7a1/88f4f42082684b56916adcce51197f9f [2018-11-14 15:49:17,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:49:17,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:49:17,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:49:17,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:49:17,828 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:49:17,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:49:17" (1/1) ... [2018-11-14 15:49:17,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2da8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:17, skipping insertion in model container [2018-11-14 15:49:17,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:49:17" (1/1) ... [2018-11-14 15:49:17,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:49:17,867 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:49:18,077 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:49:18,083 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:49:18,111 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:49:18,136 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:49:18,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18 WrapperNode [2018-11-14 15:49:18,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:49:18,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:49:18,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:49:18,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:49:18,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:49:18,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:49:18,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:49:18,192 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:49:18,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (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-14 15:49:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:49:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:49:18,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:49:18,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 15:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:49:18,957 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:49:18,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:49:18 BoogieIcfgContainer [2018-11-14 15:49:18,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:49:18,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:49:18,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:49:18,963 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:49:18,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:49:17" (1/3) ... [2018-11-14 15:49:18,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58df7afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:49:18, skipping insertion in model container [2018-11-14 15:49:18,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (2/3) ... [2018-11-14 15:49:18,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58df7afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:49:18, skipping insertion in model container [2018-11-14 15:49:18,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:49:18" (3/3) ... [2018-11-14 15:49:18,967 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_false-unreach-call_ground.i [2018-11-14 15:49:18,977 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:49:18,985 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:49:19,006 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:49:19,043 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:49:19,044 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:49:19,044 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:49:19,044 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:49:19,044 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:49:19,044 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:49:19,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:49:19,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:49:19,045 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:49:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 15:49:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 15:49:19,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:19,075 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:19,078 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:19,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:19,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-14 15:49:19,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:19,090 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-14 15:49:19,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:19,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:19,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 15:49:19,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-14 15:49:19,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 15:49:19,333 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #66#return; {33#true} is VALID [2018-11-14 15:49:19,333 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret8 := main(); {33#true} is VALID [2018-11-14 15:49:19,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {33#true} is VALID [2018-11-14 15:49:19,335 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 15:49:19,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0bv32; {34#false} is VALID [2018-11-14 15:49:19,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-14 15:49:19,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} havoc ~x~0;~x~0 := 0bv32; {34#false} is VALID [2018-11-14 15:49:19,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 15:49:19,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {34#false} is VALID [2018-11-14 15:49:19,336 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-14 15:49:19,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 15:49:19,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume ~cond == 0bv32; {34#false} is VALID [2018-11-14 15:49:19,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 15:49:19,340 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-14 15:49:19,341 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:49:19,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:49:19,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:19,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:49:19,578 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-14 15:49:19,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:49:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:49:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:49:19,598 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 15:49:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:19,834 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-14 15:49:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:49:19,834 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:49:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:49:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 15:49:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:49:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 15:49:19,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-14 15:49:20,118 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-14 15:49:20,130 INFO L225 Difference]: With dead ends: 51 [2018-11-14 15:49:20,130 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 15:49:20,134 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-14 15:49:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 15:49:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 15:49:20,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:20,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 15:49:20,198 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 15:49:20,199 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 15:49:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:20,203 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 15:49:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 15:49:20,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:20,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:20,204 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 15:49:20,204 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 15:49:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:20,209 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 15:49:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 15:49:20,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:20,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:20,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:20,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 15:49:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-14 15:49:20,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-14 15:49:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:20,219 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-14 15:49:20,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:49:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 15:49:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 15:49:20,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:20,221 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-14 15:49:20,221 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:20,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-14 15:49:20,223 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:20,223 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-14 15:49:20,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:20,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:20,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2018-11-14 15:49:20,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {230#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {230#true} is VALID [2018-11-14 15:49:20,352 INFO L273 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2018-11-14 15:49:20,352 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #66#return; {230#true} is VALID [2018-11-14 15:49:20,352 INFO L256 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret8 := main(); {230#true} is VALID [2018-11-14 15:49:20,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {230#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {250#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:20,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {250#(= main_~a~0 (_ bv0 32))} assume true; {250#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:20,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {250#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {231#false} is VALID [2018-11-14 15:49:20,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {231#false} havoc ~i~0;~i~0 := 0bv32; {231#false} is VALID [2018-11-14 15:49:20,361 INFO L273 TraceCheckUtils]: 9: Hoare triple {231#false} assume true; {231#false} is VALID [2018-11-14 15:49:20,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {231#false} assume !~bvslt32(~i~0, 100000bv32); {231#false} is VALID [2018-11-14 15:49:20,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#false} havoc ~x~0;~x~0 := 0bv32; {231#false} is VALID [2018-11-14 15:49:20,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#false} assume true; {231#false} is VALID [2018-11-14 15:49:20,362 INFO L273 TraceCheckUtils]: 13: Hoare triple {231#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {231#false} is VALID [2018-11-14 15:49:20,363 INFO L256 TraceCheckUtils]: 14: Hoare triple {231#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {231#false} is VALID [2018-11-14 15:49:20,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {231#false} ~cond := #in~cond; {231#false} is VALID [2018-11-14 15:49:20,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {231#false} assume ~cond == 0bv32; {231#false} is VALID [2018-11-14 15:49:20,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {231#false} assume !false; {231#false} is VALID [2018-11-14 15:49:20,369 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-14 15:49:20,369 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:20,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:49:20,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 15:49:20,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:20,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:49:20,431 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-14 15:49:20,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:49:20,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:49:20,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:49:20,433 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-14 15:49:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:20,871 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 15:49:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:49:20,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 15:49:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 15:49:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 15:49:20,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-14 15:49:21,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:21,035 INFO L225 Difference]: With dead ends: 44 [2018-11-14 15:49:21,035 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 15:49:21,036 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-14 15:49:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 15:49:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-14 15:49:21,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:21,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-14 15:49:21,054 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-14 15:49:21,054 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-14 15:49:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,057 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 15:49:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 15:49:21,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:21,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:21,058 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-14 15:49:21,059 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-14 15:49:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,061 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 15:49:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 15:49:21,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:21,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:21,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:21,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 15:49:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 15:49:21,067 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-14 15:49:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:21,067 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 15:49:21,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:49:21,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 15:49:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 15:49:21,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:21,071 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:21,071 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:21,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:21,071 INFO L82 PathProgramCache]: Analyzing trace with hash -714418193, now seen corresponding path program 1 times [2018-11-14 15:49:21,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:21,073 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-14 15:49:21,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:21,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:21,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-14 15:49:21,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {437#true} is VALID [2018-11-14 15:49:21,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-14 15:49:21,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #66#return; {437#true} is VALID [2018-11-14 15:49:21,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret8 := main(); {437#true} is VALID [2018-11-14 15:49:21,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {457#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:21,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#(= main_~a~0 (_ bv0 32))} assume true; {457#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:21,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {457#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:21,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {467#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:21,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {467#(= (_ bv1 32) main_~a~0)} assume true; {467#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:21,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {438#false} is VALID [2018-11-14 15:49:21,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} havoc ~i~0;~i~0 := 0bv32; {438#false} is VALID [2018-11-14 15:49:21,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 15:49:21,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~i~0, 100000bv32); {438#false} is VALID [2018-11-14 15:49:21,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#false} havoc ~x~0;~x~0 := 0bv32; {438#false} is VALID [2018-11-14 15:49:21,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 15:49:21,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {438#false} is VALID [2018-11-14 15:49:21,294 INFO L256 TraceCheckUtils]: 17: Hoare triple {438#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-14 15:49:21,295 INFO L273 TraceCheckUtils]: 18: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-14 15:49:21,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {438#false} assume ~cond == 0bv32; {438#false} is VALID [2018-11-14 15:49:21,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-14 15:49:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:21,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:21,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-14 15:49:21,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {438#false} assume ~cond == 0bv32; {438#false} is VALID [2018-11-14 15:49:21,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-14 15:49:21,394 INFO L256 TraceCheckUtils]: 17: Hoare triple {438#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-14 15:49:21,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {438#false} is VALID [2018-11-14 15:49:21,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 15:49:21,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#false} havoc ~x~0;~x~0 := 0bv32; {438#false} is VALID [2018-11-14 15:49:21,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~i~0, 100000bv32); {438#false} is VALID [2018-11-14 15:49:21,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 15:49:21,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} havoc ~i~0;~i~0 := 0bv32; {438#false} is VALID [2018-11-14 15:49:21,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {534#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {438#false} is VALID [2018-11-14 15:49:21,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(bvslt main_~a~0 (_ bv100000 32))} assume true; {534#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:21,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {534#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:21,400 INFO L273 TraceCheckUtils]: 7: Hoare triple {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:21,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:21,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:21,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret8 := main(); {437#true} is VALID [2018-11-14 15:49:21,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #66#return; {437#true} is VALID [2018-11-14 15:49:21,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-14 15:49:21,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {437#true} is VALID [2018-11-14 15:49:21,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-14 15:49:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:21,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:21,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:49:21,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 15:49:21,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:21,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:49:21,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:21,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:49:21,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:49:21,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:49:21,573 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 15:49:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,963 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-14 15:49:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:49:21,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 15:49:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:49:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 15:49:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:49:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 15:49:21,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 15:49:22,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:22,149 INFO L225 Difference]: With dead ends: 52 [2018-11-14 15:49:22,149 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 15:49:22,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:49:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 15:49:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 15:49:22,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:22,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 15:49:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 15:49:22,237 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 15:49:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,240 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 15:49:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 15:49:22,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,242 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 15:49:22,242 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 15:49:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,245 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 15:49:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 15:49:22,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:22,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 15:49:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 15:49:22,249 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2018-11-14 15:49:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:22,250 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 15:49:22,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:49:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 15:49:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 15:49:22,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:22,251 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:22,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:22,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash -615702966, now seen corresponding path program 2 times [2018-11-14 15:49:22,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:22,253 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-14 15:49:22,271 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:49:22,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 15:49:22,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:22,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:22,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 15:49:22,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {760#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {760#true} is VALID [2018-11-14 15:49:22,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #66#return; {760#true} is VALID [2018-11-14 15:49:22,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret8 := main(); {760#true} is VALID [2018-11-14 15:49:22,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {760#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {760#true} is VALID [2018-11-14 15:49:22,408 INFO L273 TraceCheckUtils]: 6: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {760#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {760#true} is VALID [2018-11-14 15:49:22,408 INFO L273 TraceCheckUtils]: 8: Hoare triple {760#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {760#true} is VALID [2018-11-14 15:49:22,409 INFO L273 TraceCheckUtils]: 9: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,409 INFO L273 TraceCheckUtils]: 10: Hoare triple {760#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {760#true} is VALID [2018-11-14 15:49:22,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {760#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {760#true} is VALID [2018-11-14 15:49:22,409 INFO L273 TraceCheckUtils]: 12: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {760#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {760#true} is VALID [2018-11-14 15:49:22,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {760#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {760#true} is VALID [2018-11-14 15:49:22,410 INFO L273 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,410 INFO L273 TraceCheckUtils]: 16: Hoare triple {760#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {760#true} is VALID [2018-11-14 15:49:22,411 INFO L273 TraceCheckUtils]: 17: Hoare triple {760#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {760#true} is VALID [2018-11-14 15:49:22,411 INFO L273 TraceCheckUtils]: 18: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 15:49:22,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {760#true} assume !~bvslt32(~a~0, 100000bv32); {760#true} is VALID [2018-11-14 15:49:22,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {760#true} havoc ~i~0;~i~0 := 0bv32; {825#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:22,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {825#(= main_~i~0 (_ bv0 32))} assume true; {825#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:22,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {761#false} is VALID [2018-11-14 15:49:22,418 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} havoc ~x~0;~x~0 := 0bv32; {761#false} is VALID [2018-11-14 15:49:22,418 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 15:49:22,418 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {761#false} is VALID [2018-11-14 15:49:22,418 INFO L256 TraceCheckUtils]: 26: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {761#false} is VALID [2018-11-14 15:49:22,419 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 15:49:22,419 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume ~cond == 0bv32; {761#false} is VALID [2018-11-14 15:49:22,420 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 15:49:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 15:49:22,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:22,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:49:22,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 15:49:22,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:22,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:49:22,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:22,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:49:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:49:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:49:22,468 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 3 states. [2018-11-14 15:49:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,563 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-14 15:49:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:49:22,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 15:49:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 15:49:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 15:49:22,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 15:49:22,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:22,687 INFO L225 Difference]: With dead ends: 51 [2018-11-14 15:49:22,687 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 15:49:22,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-14 15:49:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 15:49:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 15:49:22,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:22,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 15:49:22,703 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 15:49:22,704 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 15:49:22,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,706 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 15:49:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 15:49:22,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,708 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 15:49:22,708 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 15:49:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,710 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 15:49:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 15:49:22,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:22,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 15:49:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 15:49:22,714 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2018-11-14 15:49:22,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:22,715 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 15:49:22,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:49:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 15:49:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 15:49:22,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:22,716 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:22,717 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:22,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:22,717 INFO L82 PathProgramCache]: Analyzing trace with hash -182024532, now seen corresponding path program 1 times [2018-11-14 15:49:22,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:22,717 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-14 15:49:22,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 15:49:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:22,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:22,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 15:49:22,934 INFO L273 TraceCheckUtils]: 1: Hoare triple {1050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1050#true} is VALID [2018-11-14 15:49:22,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 15:49:22,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #66#return; {1050#true} is VALID [2018-11-14 15:49:22,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret8 := main(); {1050#true} is VALID [2018-11-14 15:49:22,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {1050#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1070#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:22,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {1070#(= main_~a~0 (_ bv0 32))} assume true; {1070#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:22,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {1070#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1070#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:22,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {1070#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1080#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:22,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {1080#(= (_ bv1 32) main_~a~0)} assume true; {1080#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:22,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {1080#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1080#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:22,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {1080#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1090#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:22,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#(= (_ bv2 32) main_~a~0)} assume true; {1090#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:22,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1090#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:22,943 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1100#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:22,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#(= (_ bv3 32) main_~a~0)} assume true; {1100#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:22,961 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1100#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:22,961 INFO L273 TraceCheckUtils]: 17: Hoare triple {1100#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1110#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:22,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {1110#(= (_ bv4 32) main_~a~0)} assume true; {1110#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:22,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1110#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1051#false} is VALID [2018-11-14 15:49:22,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {1051#false} havoc ~i~0;~i~0 := 0bv32; {1051#false} is VALID [2018-11-14 15:49:22,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:22,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {1051#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1051#false} is VALID [2018-11-14 15:49:22,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {1051#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1051#false} is VALID [2018-11-14 15:49:22,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:22,967 INFO L273 TraceCheckUtils]: 25: Hoare triple {1051#false} assume !~bvslt32(~i~0, 100000bv32); {1051#false} is VALID [2018-11-14 15:49:22,968 INFO L273 TraceCheckUtils]: 26: Hoare triple {1051#false} havoc ~x~0;~x~0 := 0bv32; {1051#false} is VALID [2018-11-14 15:49:22,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:22,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {1051#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1051#false} is VALID [2018-11-14 15:49:22,969 INFO L256 TraceCheckUtils]: 29: Hoare triple {1051#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1051#false} is VALID [2018-11-14 15:49:22,969 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2018-11-14 15:49:22,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {1051#false} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 15:49:22,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 15:49:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 15:49:22,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:23,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 15:49:23,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {1051#false} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 15:49:23,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2018-11-14 15:49:23,181 INFO L256 TraceCheckUtils]: 29: Hoare triple {1051#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1051#false} is VALID [2018-11-14 15:49:23,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {1051#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1051#false} is VALID [2018-11-14 15:49:23,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:23,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {1051#false} havoc ~x~0;~x~0 := 0bv32; {1051#false} is VALID [2018-11-14 15:49:23,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {1051#false} assume !~bvslt32(~i~0, 100000bv32); {1051#false} is VALID [2018-11-14 15:49:23,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:23,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {1051#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1051#false} is VALID [2018-11-14 15:49:23,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {1051#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1051#false} is VALID [2018-11-14 15:49:23,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 15:49:23,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {1051#false} havoc ~i~0;~i~0 := 0bv32; {1051#false} is VALID [2018-11-14 15:49:23,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {1195#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1051#false} is VALID [2018-11-14 15:49:23,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {1195#(bvslt main_~a~0 (_ bv100000 32))} assume true; {1195#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:23,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1195#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:23,185 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {1050#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:23,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret8 := main(); {1050#true} is VALID [2018-11-14 15:49:23,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #66#return; {1050#true} is VALID [2018-11-14 15:49:23,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 15:49:23,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {1050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1050#true} is VALID [2018-11-14 15:49:23,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 15:49:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 15:49:23,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:23,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:49:23,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 15:49:23,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:23,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:49:23,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:23,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:49:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:49:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:49:23,317 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 12 states. [2018-11-14 15:49:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:24,400 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 15:49:24,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:49:24,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 15:49:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:49:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 15:49:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:49:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 15:49:24,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2018-11-14 15:49:24,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:24,546 INFO L225 Difference]: With dead ends: 74 [2018-11-14 15:49:24,547 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 15:49:24,547 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 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-14 15:49:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 15:49:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-14 15:49:24,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:24,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-14 15:49:24,590 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 15:49:24,590 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 15:49:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:24,594 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 15:49:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 15:49:24,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:24,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:24,595 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 15:49:24,595 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 15:49:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:24,598 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 15:49:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 15:49:24,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:24,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:24,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:24,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 15:49:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-14 15:49:24,603 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 33 [2018-11-14 15:49:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:24,603 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-14 15:49:24,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:49:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 15:49:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 15:49:24,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:24,606 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:24,606 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:24,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash 307358988, now seen corresponding path program 2 times [2018-11-14 15:49:24,607 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:24,607 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-14 15:49:24,624 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:49:24,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:49:24,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:24,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:25,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2018-11-14 15:49:25,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {1554#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1554#true} is VALID [2018-11-14 15:49:25,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2018-11-14 15:49:25,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #66#return; {1554#true} is VALID [2018-11-14 15:49:25,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret8 := main(); {1554#true} is VALID [2018-11-14 15:49:25,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1574#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:25,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {1574#(= main_~a~0 (_ bv0 32))} assume true; {1574#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:25,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1574#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1574#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:25,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {1574#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1584#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:25,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {1584#(= (_ bv1 32) main_~a~0)} assume true; {1584#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:25,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {1584#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1584#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:25,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {1584#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1594#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:25,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {1594#(= (_ bv2 32) main_~a~0)} assume true; {1594#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:25,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {1594#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1594#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:25,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {1594#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1604#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:25,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {1604#(= (_ bv3 32) main_~a~0)} assume true; {1604#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:25,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {1604#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1604#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:25,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {1604#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1614#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:25,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {1614#(= (_ bv4 32) main_~a~0)} assume true; {1614#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:25,148 INFO L273 TraceCheckUtils]: 19: Hoare triple {1614#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1614#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:25,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {1614#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1624#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:25,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {1624#(= (_ bv5 32) main_~a~0)} assume true; {1624#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:25,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {1624#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1624#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:25,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {1624#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1634#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:25,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {1634#(= (_ bv6 32) main_~a~0)} assume true; {1634#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:25,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {1634#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1634#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:25,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {1634#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1644#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:25,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {1644#(= (_ bv7 32) main_~a~0)} assume true; {1644#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:25,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {1644#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1644#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:25,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {1644#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1654#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:25,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {1654#(= (_ bv8 32) main_~a~0)} assume true; {1654#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:25,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {1654#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1654#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:25,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {1654#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1664#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:25,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {1664#(= (_ bv9 32) main_~a~0)} assume true; {1664#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:25,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {1664#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1664#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:25,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {1664#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1674#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:49:25,177 INFO L273 TraceCheckUtils]: 36: Hoare triple {1674#(= (_ bv10 32) main_~a~0)} assume true; {1674#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:49:25,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {1674#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1555#false} is VALID [2018-11-14 15:49:25,177 INFO L273 TraceCheckUtils]: 38: Hoare triple {1555#false} havoc ~i~0;~i~0 := 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {1555#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1555#false} is VALID [2018-11-14 15:49:25,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {1555#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1555#false} is VALID [2018-11-14 15:49:25,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {1555#false} assume !~bvslt32(~i~0, 100000bv32); {1555#false} is VALID [2018-11-14 15:49:25,179 INFO L273 TraceCheckUtils]: 44: Hoare triple {1555#false} havoc ~x~0;~x~0 := 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,180 INFO L273 TraceCheckUtils]: 45: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,180 INFO L273 TraceCheckUtils]: 46: Hoare triple {1555#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1555#false} is VALID [2018-11-14 15:49:25,181 INFO L256 TraceCheckUtils]: 47: Hoare triple {1555#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1555#false} is VALID [2018-11-14 15:49:25,181 INFO L273 TraceCheckUtils]: 48: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2018-11-14 15:49:25,181 INFO L273 TraceCheckUtils]: 49: Hoare triple {1555#false} assume ~cond == 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,181 INFO L273 TraceCheckUtils]: 50: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2018-11-14 15:49:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 15:49:25,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:25,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2018-11-14 15:49:25,918 INFO L273 TraceCheckUtils]: 49: Hoare triple {1555#false} assume ~cond == 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2018-11-14 15:49:25,919 INFO L256 TraceCheckUtils]: 47: Hoare triple {1555#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {1555#false} is VALID [2018-11-14 15:49:25,920 INFO L273 TraceCheckUtils]: 46: Hoare triple {1555#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1555#false} is VALID [2018-11-14 15:49:25,920 INFO L273 TraceCheckUtils]: 45: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,920 INFO L273 TraceCheckUtils]: 44: Hoare triple {1555#false} havoc ~x~0;~x~0 := 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,920 INFO L273 TraceCheckUtils]: 43: Hoare triple {1555#false} assume !~bvslt32(~i~0, 100000bv32); {1555#false} is VALID [2018-11-14 15:49:25,920 INFO L273 TraceCheckUtils]: 42: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,921 INFO L273 TraceCheckUtils]: 41: Hoare triple {1555#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1555#false} is VALID [2018-11-14 15:49:25,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {1555#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1555#false} is VALID [2018-11-14 15:49:25,921 INFO L273 TraceCheckUtils]: 39: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 15:49:25,921 INFO L273 TraceCheckUtils]: 38: Hoare triple {1555#false} havoc ~i~0;~i~0 := 0bv32; {1555#false} is VALID [2018-11-14 15:49:25,922 INFO L273 TraceCheckUtils]: 37: Hoare triple {1759#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1555#false} is VALID [2018-11-14 15:49:25,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {1759#(bvslt main_~a~0 (_ bv100000 32))} assume true; {1759#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:25,923 INFO L273 TraceCheckUtils]: 35: Hoare triple {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1759#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:25,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,932 INFO L273 TraceCheckUtils]: 32: Hoare triple {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,932 INFO L273 TraceCheckUtils]: 31: Hoare triple {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,952 INFO L273 TraceCheckUtils]: 21: Hoare triple {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,962 INFO L273 TraceCheckUtils]: 18: Hoare triple {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:25,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret8 := main(); {1554#true} is VALID [2018-11-14 15:49:25,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #66#return; {1554#true} is VALID [2018-11-14 15:49:25,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2018-11-14 15:49:25,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {1554#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1554#true} is VALID [2018-11-14 15:49:25,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2018-11-14 15:49:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 15:49:26,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:26,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:49:26,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-14 15:49:26,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:26,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:49:26,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:26,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:49:26,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:49:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:49:26,226 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 24 states. [2018-11-14 15:49:28,759 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 7 [2018-11-14 15:49:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:30,647 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-11-14 15:49:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:49:30,647 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-14 15:49:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:30,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:49:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 121 transitions. [2018-11-14 15:49:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:49:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 121 transitions. [2018-11-14 15:49:30,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 121 transitions. [2018-11-14 15:49:30,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:30,942 INFO L225 Difference]: With dead ends: 110 [2018-11-14 15:49:30,942 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 15:49:30,943 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 15:49:30,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 15:49:30,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 15:49:30,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:30,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 15:49:30,990 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 15:49:30,990 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 15:49:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:30,994 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 15:49:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 15:49:30,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:30,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:30,996 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 15:49:30,996 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 15:49:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:31,000 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 15:49:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 15:49:31,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:31,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:31,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:31,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 15:49:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-14 15:49:31,005 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 51 [2018-11-14 15:49:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:31,005 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-14 15:49:31,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:49:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 15:49:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 15:49:31,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:31,009 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:31,009 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:31,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1099681332, now seen corresponding path program 3 times [2018-11-14 15:49:31,010 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:31,010 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-14 15:49:31,041 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:49:31,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 15:49:31,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:31,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:31,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2018-11-14 15:49:31,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {2358#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2358#true} is VALID [2018-11-14 15:49:31,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2358#true} {2358#true} #66#return; {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {2358#true} call #t~ret8 := main(); {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {2358#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,225 INFO L273 TraceCheckUtils]: 9: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 11: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 15: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,229 INFO L273 TraceCheckUtils]: 28: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,229 INFO L273 TraceCheckUtils]: 30: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 32: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,230 INFO L273 TraceCheckUtils]: 36: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 37: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 38: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 39: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 41: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 43: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,232 INFO L273 TraceCheckUtils]: 49: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 52: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 54: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 55: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,233 INFO L273 TraceCheckUtils]: 56: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,234 INFO L273 TraceCheckUtils]: 57: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,234 INFO L273 TraceCheckUtils]: 58: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,234 INFO L273 TraceCheckUtils]: 59: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,234 INFO L273 TraceCheckUtils]: 60: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,234 INFO L273 TraceCheckUtils]: 61: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 64: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 65: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 66: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,235 INFO L273 TraceCheckUtils]: 67: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 72: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,236 INFO L273 TraceCheckUtils]: 73: Hoare triple {2358#true} assume !~bvslt32(~a~0, 100000bv32); {2358#true} is VALID [2018-11-14 15:49:31,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {2358#true} havoc ~i~0;~i~0 := 0bv32; {2585#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:31,245 INFO L273 TraceCheckUtils]: 75: Hoare triple {2585#(= main_~i~0 (_ bv0 32))} assume true; {2585#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:31,250 INFO L273 TraceCheckUtils]: 76: Hoare triple {2585#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2585#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:31,250 INFO L273 TraceCheckUtils]: 77: Hoare triple {2585#(= main_~i~0 (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2595#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:31,253 INFO L273 TraceCheckUtils]: 78: Hoare triple {2595#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2595#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:31,253 INFO L273 TraceCheckUtils]: 79: Hoare triple {2595#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2359#false} is VALID [2018-11-14 15:49:31,253 INFO L273 TraceCheckUtils]: 80: Hoare triple {2359#false} havoc ~x~0;~x~0 := 0bv32; {2359#false} is VALID [2018-11-14 15:49:31,253 INFO L273 TraceCheckUtils]: 81: Hoare triple {2359#false} assume true; {2359#false} is VALID [2018-11-14 15:49:31,254 INFO L273 TraceCheckUtils]: 82: Hoare triple {2359#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2359#false} is VALID [2018-11-14 15:49:31,254 INFO L256 TraceCheckUtils]: 83: Hoare triple {2359#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {2359#false} is VALID [2018-11-14 15:49:31,254 INFO L273 TraceCheckUtils]: 84: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2018-11-14 15:49:31,254 INFO L273 TraceCheckUtils]: 85: Hoare triple {2359#false} assume ~cond == 0bv32; {2359#false} is VALID [2018-11-14 15:49:31,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2018-11-14 15:49:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 15:49:31,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:31,383 INFO L273 TraceCheckUtils]: 86: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2018-11-14 15:49:31,383 INFO L273 TraceCheckUtils]: 85: Hoare triple {2359#false} assume ~cond == 0bv32; {2359#false} is VALID [2018-11-14 15:49:31,383 INFO L273 TraceCheckUtils]: 84: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2018-11-14 15:49:31,383 INFO L256 TraceCheckUtils]: 83: Hoare triple {2359#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {2359#false} is VALID [2018-11-14 15:49:31,384 INFO L273 TraceCheckUtils]: 82: Hoare triple {2359#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2359#false} is VALID [2018-11-14 15:49:31,384 INFO L273 TraceCheckUtils]: 81: Hoare triple {2359#false} assume true; {2359#false} is VALID [2018-11-14 15:49:31,384 INFO L273 TraceCheckUtils]: 80: Hoare triple {2359#false} havoc ~x~0;~x~0 := 0bv32; {2359#false} is VALID [2018-11-14 15:49:31,384 INFO L273 TraceCheckUtils]: 79: Hoare triple {2644#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2359#false} is VALID [2018-11-14 15:49:31,384 INFO L273 TraceCheckUtils]: 78: Hoare triple {2644#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2644#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:31,385 INFO L273 TraceCheckUtils]: 77: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2644#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:31,385 INFO L273 TraceCheckUtils]: 76: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:31,386 INFO L273 TraceCheckUtils]: 75: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:31,386 INFO L273 TraceCheckUtils]: 74: Hoare triple {2358#true} havoc ~i~0;~i~0 := 0bv32; {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:31,386 INFO L273 TraceCheckUtils]: 73: Hoare triple {2358#true} assume !~bvslt32(~a~0, 100000bv32); {2358#true} is VALID [2018-11-14 15:49:31,386 INFO L273 TraceCheckUtils]: 72: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,386 INFO L273 TraceCheckUtils]: 71: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,387 INFO L273 TraceCheckUtils]: 70: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,387 INFO L273 TraceCheckUtils]: 69: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,387 INFO L273 TraceCheckUtils]: 68: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,387 INFO L273 TraceCheckUtils]: 67: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,387 INFO L273 TraceCheckUtils]: 66: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,388 INFO L273 TraceCheckUtils]: 65: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,388 INFO L273 TraceCheckUtils]: 63: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,388 INFO L273 TraceCheckUtils]: 62: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,389 INFO L273 TraceCheckUtils]: 61: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,389 INFO L273 TraceCheckUtils]: 59: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,389 INFO L273 TraceCheckUtils]: 58: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,390 INFO L273 TraceCheckUtils]: 57: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,390 INFO L273 TraceCheckUtils]: 56: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 53: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 52: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 51: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 50: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 49: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,391 INFO L273 TraceCheckUtils]: 48: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,393 INFO L273 TraceCheckUtils]: 39: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,394 INFO L273 TraceCheckUtils]: 37: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 32: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 31: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,397 INFO L273 TraceCheckUtils]: 19: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 16: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {2358#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2358#true} is VALID [2018-11-14 15:49:31,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {2358#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2358#true} is VALID [2018-11-14 15:49:31,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {2358#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2358#true} is VALID [2018-11-14 15:49:31,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {2358#true} call #t~ret8 := main(); {2358#true} is VALID [2018-11-14 15:49:31,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2358#true} {2358#true} #66#return; {2358#true} is VALID [2018-11-14 15:49:31,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 15:49:31,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {2358#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2358#true} is VALID [2018-11-14 15:49:31,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2018-11-14 15:49:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 15:49:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:31,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:49:31,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-14 15:49:31,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:31,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:49:31,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:31,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:49:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:49:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:49:31,450 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 6 states. [2018-11-14 15:49:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:31,746 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 15:49:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:49:31,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-14 15:49:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:49:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-14 15:49:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:49:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-14 15:49:31,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-14 15:49:31,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:31,832 INFO L225 Difference]: With dead ends: 113 [2018-11-14 15:49:31,832 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 15:49:31,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:49:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 15:49:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-14 15:49:31,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:31,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-14 15:49:31,866 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 15:49:31,866 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 15:49:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:31,868 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-14 15:49:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 15:49:31,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:31,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:31,869 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 15:49:31,869 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 15:49:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:31,874 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-14 15:49:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 15:49:31,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:31,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:31,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:31,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 15:49:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-14 15:49:31,878 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 87 [2018-11-14 15:49:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:31,878 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-14 15:49:31,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:49:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 15:49:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 15:49:31,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:31,880 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:31,880 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:31,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1529315158, now seen corresponding path program 4 times [2018-11-14 15:49:31,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:31,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:31,903 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:49:32,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:49:32,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:32,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:32,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {3376#true} call ULTIMATE.init(); {3376#true} is VALID [2018-11-14 15:49:32,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {3376#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3376#true} is VALID [2018-11-14 15:49:32,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {3376#true} assume true; {3376#true} is VALID [2018-11-14 15:49:32,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3376#true} {3376#true} #66#return; {3376#true} is VALID [2018-11-14 15:49:32,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {3376#true} call #t~ret8 := main(); {3376#true} is VALID [2018-11-14 15:49:32,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {3376#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3396#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:32,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {3396#(= main_~a~0 (_ bv0 32))} assume true; {3396#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:32,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {3396#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3396#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:49:32,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {3396#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:32,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {3406#(= (_ bv1 32) main_~a~0)} assume true; {3406#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:32,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {3406#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3406#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:49:32,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {3406#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3416#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:32,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {3416#(= (_ bv2 32) main_~a~0)} assume true; {3416#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:32,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {3416#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3416#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:49:32,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {3416#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3426#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:32,530 INFO L273 TraceCheckUtils]: 15: Hoare triple {3426#(= (_ bv3 32) main_~a~0)} assume true; {3426#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:32,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {3426#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3426#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:49:32,532 INFO L273 TraceCheckUtils]: 17: Hoare triple {3426#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3436#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:32,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {3436#(= (_ bv4 32) main_~a~0)} assume true; {3436#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:32,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {3436#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3436#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:49:32,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {3436#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3446#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:32,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {3446#(= (_ bv5 32) main_~a~0)} assume true; {3446#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:32,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {3446#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3446#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:49:32,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {3446#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3456#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:32,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {3456#(= (_ bv6 32) main_~a~0)} assume true; {3456#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:32,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {3456#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3456#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:49:32,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {3456#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3466#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:32,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {3466#(= (_ bv7 32) main_~a~0)} assume true; {3466#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:32,538 INFO L273 TraceCheckUtils]: 28: Hoare triple {3466#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3466#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:49:32,539 INFO L273 TraceCheckUtils]: 29: Hoare triple {3466#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3476#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:32,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {3476#(= (_ bv8 32) main_~a~0)} assume true; {3476#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:32,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {3476#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3476#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:49:32,540 INFO L273 TraceCheckUtils]: 32: Hoare triple {3476#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3486#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:32,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {3486#(= (_ bv9 32) main_~a~0)} assume true; {3486#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:32,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {3486#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3486#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:49:32,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {3486#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3496#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:49:32,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {3496#(= (_ bv10 32) main_~a~0)} assume true; {3496#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:49:32,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {3496#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3496#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:49:32,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {3496#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3506#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:49:32,544 INFO L273 TraceCheckUtils]: 39: Hoare triple {3506#(= (_ bv11 32) main_~a~0)} assume true; {3506#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:49:32,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {3506#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3506#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:49:32,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {3506#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3516#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:49:32,546 INFO L273 TraceCheckUtils]: 42: Hoare triple {3516#(= (_ bv12 32) main_~a~0)} assume true; {3516#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:49:32,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {3516#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3516#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:49:32,558 INFO L273 TraceCheckUtils]: 44: Hoare triple {3516#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:49:32,558 INFO L273 TraceCheckUtils]: 45: Hoare triple {3526#(= (_ bv13 32) main_~a~0)} assume true; {3526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:49:32,559 INFO L273 TraceCheckUtils]: 46: Hoare triple {3526#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:49:32,559 INFO L273 TraceCheckUtils]: 47: Hoare triple {3526#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3536#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:49:32,560 INFO L273 TraceCheckUtils]: 48: Hoare triple {3536#(= (_ bv14 32) main_~a~0)} assume true; {3536#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:49:32,560 INFO L273 TraceCheckUtils]: 49: Hoare triple {3536#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3536#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:49:32,560 INFO L273 TraceCheckUtils]: 50: Hoare triple {3536#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3546#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:49:32,561 INFO L273 TraceCheckUtils]: 51: Hoare triple {3546#(= (_ bv15 32) main_~a~0)} assume true; {3546#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:49:32,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {3546#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3546#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:49:32,562 INFO L273 TraceCheckUtils]: 53: Hoare triple {3546#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3556#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:49:32,562 INFO L273 TraceCheckUtils]: 54: Hoare triple {3556#(= (_ bv16 32) main_~a~0)} assume true; {3556#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:49:32,563 INFO L273 TraceCheckUtils]: 55: Hoare triple {3556#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3556#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:49:32,563 INFO L273 TraceCheckUtils]: 56: Hoare triple {3556#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3566#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:49:32,564 INFO L273 TraceCheckUtils]: 57: Hoare triple {3566#(= (_ bv17 32) main_~a~0)} assume true; {3566#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:49:32,564 INFO L273 TraceCheckUtils]: 58: Hoare triple {3566#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3566#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:49:32,565 INFO L273 TraceCheckUtils]: 59: Hoare triple {3566#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3576#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:49:32,566 INFO L273 TraceCheckUtils]: 60: Hoare triple {3576#(= (_ bv18 32) main_~a~0)} assume true; {3576#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:49:32,566 INFO L273 TraceCheckUtils]: 61: Hoare triple {3576#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3576#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:49:32,567 INFO L273 TraceCheckUtils]: 62: Hoare triple {3576#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3586#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:49:32,567 INFO L273 TraceCheckUtils]: 63: Hoare triple {3586#(= (_ bv19 32) main_~a~0)} assume true; {3586#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:49:32,582 INFO L273 TraceCheckUtils]: 64: Hoare triple {3586#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3586#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:49:32,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {3586#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3596#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:49:32,584 INFO L273 TraceCheckUtils]: 66: Hoare triple {3596#(= (_ bv20 32) main_~a~0)} assume true; {3596#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:49:32,584 INFO L273 TraceCheckUtils]: 67: Hoare triple {3596#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3596#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:49:32,594 INFO L273 TraceCheckUtils]: 68: Hoare triple {3596#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3606#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:49:32,594 INFO L273 TraceCheckUtils]: 69: Hoare triple {3606#(= (_ bv21 32) main_~a~0)} assume true; {3606#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:49:32,595 INFO L273 TraceCheckUtils]: 70: Hoare triple {3606#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3606#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:49:32,595 INFO L273 TraceCheckUtils]: 71: Hoare triple {3606#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3616#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-14 15:49:32,595 INFO L273 TraceCheckUtils]: 72: Hoare triple {3616#(= (_ bv22 32) main_~a~0)} assume true; {3616#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 73: Hoare triple {3616#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 74: Hoare triple {3377#false} havoc ~i~0;~i~0 := 0bv32; {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 75: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 76: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 77: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,596 INFO L273 TraceCheckUtils]: 79: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 80: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 81: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 82: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 83: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 84: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 85: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 86: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:32,597 INFO L273 TraceCheckUtils]: 87: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 88: Hoare triple {3377#false} assume !~bvslt32(~i~0, 100000bv32); {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 89: Hoare triple {3377#false} havoc ~x~0;~x~0 := 0bv32; {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 90: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {3377#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L256 TraceCheckUtils]: 92: Hoare triple {3377#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 93: Hoare triple {3377#false} ~cond := #in~cond; {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 94: Hoare triple {3377#false} assume ~cond == 0bv32; {3377#false} is VALID [2018-11-14 15:49:32,598 INFO L273 TraceCheckUtils]: 95: Hoare triple {3377#false} assume !false; {3377#false} is VALID [2018-11-14 15:49:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 15:49:32,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:34,724 INFO L273 TraceCheckUtils]: 95: Hoare triple {3377#false} assume !false; {3377#false} is VALID [2018-11-14 15:49:34,724 INFO L273 TraceCheckUtils]: 94: Hoare triple {3377#false} assume ~cond == 0bv32; {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 93: Hoare triple {3377#false} ~cond := #in~cond; {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L256 TraceCheckUtils]: 92: Hoare triple {3377#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1bv32 else 0bv32)); {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 91: Hoare triple {3377#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 90: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 89: Hoare triple {3377#false} havoc ~x~0;~x~0 := 0bv32; {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 88: Hoare triple {3377#false} assume !~bvslt32(~i~0, 100000bv32); {3377#false} is VALID [2018-11-14 15:49:34,725 INFO L273 TraceCheckUtils]: 87: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 86: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 85: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 84: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 83: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 82: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 81: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 80: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:34,726 INFO L273 TraceCheckUtils]: 79: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:34,727 INFO L273 TraceCheckUtils]: 78: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,727 INFO L273 TraceCheckUtils]: 77: Hoare triple {3377#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3377#false} is VALID [2018-11-14 15:49:34,727 INFO L273 TraceCheckUtils]: 76: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3377#false} is VALID [2018-11-14 15:49:34,727 INFO L273 TraceCheckUtils]: 75: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 15:49:34,727 INFO L273 TraceCheckUtils]: 74: Hoare triple {3377#false} havoc ~i~0;~i~0 := 0bv32; {3377#false} is VALID [2018-11-14 15:49:34,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {3755#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {3377#false} is VALID [2018-11-14 15:49:34,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {3755#(bvslt main_~a~0 (_ bv100000 32))} assume true; {3755#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:34,736 INFO L273 TraceCheckUtils]: 71: Hoare triple {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3755#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:34,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,737 INFO L273 TraceCheckUtils]: 69: Hoare triple {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,745 INFO L273 TraceCheckUtils]: 65: Hoare triple {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,746 INFO L273 TraceCheckUtils]: 64: Hoare triple {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,746 INFO L273 TraceCheckUtils]: 63: Hoare triple {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,750 INFO L273 TraceCheckUtils]: 62: Hoare triple {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,750 INFO L273 TraceCheckUtils]: 61: Hoare triple {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,765 INFO L273 TraceCheckUtils]: 56: Hoare triple {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,766 INFO L273 TraceCheckUtils]: 55: Hoare triple {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,772 INFO L273 TraceCheckUtils]: 53: Hoare triple {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,785 INFO L273 TraceCheckUtils]: 45: Hoare triple {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume true; {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,808 INFO L273 TraceCheckUtils]: 38: Hoare triple {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,808 INFO L273 TraceCheckUtils]: 37: Hoare triple {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume true; {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume true; {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,819 INFO L273 TraceCheckUtils]: 32: Hoare triple {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume true; {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume true; {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume true; {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume true; {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume true; {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume true; {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume true; {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume true; {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume true; {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {3376#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:34,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {3376#true} call #t~ret8 := main(); {3376#true} is VALID [2018-11-14 15:49:34,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3376#true} {3376#true} #66#return; {3376#true} is VALID [2018-11-14 15:49:34,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {3376#true} assume true; {3376#true} is VALID [2018-11-14 15:49:34,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {3376#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3376#true} is VALID [2018-11-14 15:49:34,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {3376#true} call ULTIMATE.init(); {3376#true} is VALID [2018-11-14 15:49:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 15:49:34,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:34,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:49:34,887 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-11-14 15:49:34,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:34,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:49:35,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:35,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:49:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:49:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:49:35,329 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 48 states. [2018-11-14 15:49:43,696 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:49:44,173 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:49:44,672 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:49:45,234 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:49:45,822 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:49:46,409 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:49:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:54,747 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-14 15:49:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:49:54,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-11-14 15:49:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:49:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 205 transitions. [2018-11-14 15:49:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:49:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 205 transitions. [2018-11-14 15:49:54,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 205 transitions. [2018-11-14 15:49:55,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:55,130 INFO L225 Difference]: With dead ends: 200 [2018-11-14 15:49:55,130 INFO L226 Difference]: Without dead ends: 173 [2018-11-14 15:49:55,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:49:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-14 15:49:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-11-14 15:49:55,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:55,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 173 states. [2018-11-14 15:49:55,187 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2018-11-14 15:49:55,187 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2018-11-14 15:49:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:55,192 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-11-14 15:49:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 15:49:55,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:55,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:55,193 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2018-11-14 15:49:55,193 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2018-11-14 15:49:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:55,198 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-11-14 15:49:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 15:49:55,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:55,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:55,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:55,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 15:49:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-11-14 15:49:55,205 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 96 [2018-11-14 15:49:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:55,205 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-11-14 15:49:55,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:49:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 15:49:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-14 15:49:55,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:55,208 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:55,208 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:55,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 882689834, now seen corresponding path program 5 times [2018-11-14 15:49:55,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:55,209 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:55,237 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1