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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:43:55,135 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:43:55,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:43:55,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:43:55,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:43:55,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:43:55,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:43:55,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:43:55,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:43:55,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:43:55,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:43:55,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:43:55,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:43:55,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:43:55,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:43:55,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:43:55,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:43:55,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:43:55,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:43:55,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:43:55,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:43:55,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:43:55,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:43:55,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:43:55,182 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:43:55,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:43:55,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:43:55,184 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:43:55,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:43:55,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:43:55,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:43:55,189 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:43:55,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:43:55,190 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:43:55,191 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:43:55,191 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:43:55,192 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:43:55,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:43:55,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:43:55,226 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:43:55,226 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:43:55,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:43:55,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:43:55,227 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:43:55,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:43:55,228 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:43:55,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:43:55,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:43:55,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:43:55,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:43:55,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:43:55,229 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:43:55,229 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:43:55,230 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:43:55,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:43:55,230 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:43:55,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:43:55,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:43:55,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:43:55,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:43:55,231 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:43:55,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:43:55,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:43:55,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:43:55,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:43:55,232 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:43:55,232 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:43:55,232 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:43:55,233 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:43:55,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:43:55,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:43:55,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:43:55,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:43:55,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:43:55,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:43:55,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i [2018-11-14 17:43:55,359 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70712e00/9561a31a691f4aedb8ac04019e44f510/FLAG6691a79e0 [2018-11-14 17:43:55,882 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:43:55,883 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_true-unreach-call_ground.i [2018-11-14 17:43:55,890 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70712e00/9561a31a691f4aedb8ac04019e44f510/FLAG6691a79e0 [2018-11-14 17:43:55,907 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70712e00/9561a31a691f4aedb8ac04019e44f510 [2018-11-14 17:43:55,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:43:55,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:43:55,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:43:55,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:43:55,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:43:55,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad3d09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55, skipping insertion in model container [2018-11-14 17:43:55,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:43:55,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:43:56,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:43:56,183 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:43:56,212 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:43:56,239 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:43:56,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56 WrapperNode [2018-11-14 17:43:56,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:43:56,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:43:56,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:43:56,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:43:56,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (1/1) ... [2018-11-14 17:43:56,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:43:56,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:43:56,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:43:56,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:43:56,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (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 17:43:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:43:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:43:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:43:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:43:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:43:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:43:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:43:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:43:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:43:56,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:43:56,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:43:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:43:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:43:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:43:56,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:43:57,129 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:43:57,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:43:57 BoogieIcfgContainer [2018-11-14 17:43:57,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:43:57,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:43:57,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:43:57,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:43:57,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:43:55" (1/3) ... [2018-11-14 17:43:57,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7258c5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:43:57, skipping insertion in model container [2018-11-14 17:43:57,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:56" (2/3) ... [2018-11-14 17:43:57,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7258c5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:43:57, skipping insertion in model container [2018-11-14 17:43:57,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:43:57" (3/3) ... [2018-11-14 17:43:57,138 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy1_true-unreach-call_ground.i [2018-11-14 17:43:57,148 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:43:57,158 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:43:57,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:43:57,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:43:57,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:43:57,212 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:43:57,212 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:43:57,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:43:57,213 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:43:57,213 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:43:57,213 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:43:57,214 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:43:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 17:43:57,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:43:57,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:57,246 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:43:57,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-14 17:43:57,260 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:57,261 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 17:43:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:57,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:57,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 17:43:57,516 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 17:43:57,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 17:43:57,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #66#return; {33#true} is VALID [2018-11-14 17:43:57,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2018-11-14 17:43:57,518 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 17:43:57,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 17:43:57,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0bv32; {34#false} is VALID [2018-11-14 17:43:57,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-14 17:43:57,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} havoc ~x~0;~x~0 := 0bv32; {34#false} is VALID [2018-11-14 17:43:57,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 17:43:57,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {34#false} is VALID [2018-11-14 17:43:57,521 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-14 17:43:57,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 17:43:57,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume ~cond == 0bv32; {34#false} is VALID [2018-11-14 17:43:57,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 17:43:57,525 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 17:43:57,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:43:57,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:43:57,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:43:57,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:43:57,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:57,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:43:57,688 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 17:43:57,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:43:57,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:43:57,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:43:57,702 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 17:43:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:57,845 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-14 17:43:57,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:43:57,845 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:43:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:43:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 17:43:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:43:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 17:43:57,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-14 17:43:58,164 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 17:43:58,178 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:43:58,178 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 17:43:58,183 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 17:43:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 17:43:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 17:43:58,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:43:58,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 17:43:58,247 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:43:58,247 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:43:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,251 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 17:43:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:43:58,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:58,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:58,252 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 17:43:58,253 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 17:43:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,257 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 17:43:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:43:58,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:58,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:58,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:43:58,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:43:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:43:58,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-14 17:43:58,262 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-14 17:43:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:43:58,263 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-14 17:43:58,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:43:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:43:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:43:58,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:58,265 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 17:43:58,265 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:58,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-14 17:43:58,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:58,267 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 17:43:58,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:58,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:58,668 INFO L256 TraceCheckUtils]: 0: Hoare triple {230#true} call ULTIMATE.init(); {230#true} is VALID [2018-11-14 17:43:58,669 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 17:43:58,669 INFO L273 TraceCheckUtils]: 2: Hoare triple {230#true} assume true; {230#true} is VALID [2018-11-14 17:43:58,669 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {230#true} {230#true} #66#return; {230#true} is VALID [2018-11-14 17:43:58,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {230#true} call #t~ret7 := main(); {230#true} is VALID [2018-11-14 17:43:58,673 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 17:43:58,677 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 17:43:58,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {250#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {231#false} is VALID [2018-11-14 17:43:58,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {231#false} havoc ~i~0;~i~0 := 0bv32; {231#false} is VALID [2018-11-14 17:43:58,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {231#false} assume true; {231#false} is VALID [2018-11-14 17:43:58,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {231#false} assume !~bvslt32(~i~0, 100000bv32); {231#false} is VALID [2018-11-14 17:43:58,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {231#false} havoc ~x~0;~x~0 := 0bv32; {231#false} is VALID [2018-11-14 17:43:58,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {231#false} assume true; {231#false} is VALID [2018-11-14 17:43:58,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {231#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {231#false} is VALID [2018-11-14 17:43:58,680 INFO L256 TraceCheckUtils]: 14: Hoare triple {231#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {231#false} is VALID [2018-11-14 17:43:58,680 INFO L273 TraceCheckUtils]: 15: Hoare triple {231#false} ~cond := #in~cond; {231#false} is VALID [2018-11-14 17:43:58,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {231#false} assume ~cond == 0bv32; {231#false} is VALID [2018-11-14 17:43:58,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {231#false} assume !false; {231#false} is VALID [2018-11-14 17:43:58,684 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 17:43:58,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:43:58,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:43:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:43:58,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:43:58,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:58,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:43:58,747 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 17:43:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:43:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:43:58,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:43:58,748 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-14 17:43:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,212 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 17:43:59,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:43:59,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:43:59,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 17:43:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-14 17:43:59,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-14 17:43:59,347 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 17:43:59,349 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:43:59,349 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:43:59,350 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:43:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:43:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-14 17:43:59,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:43:59,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-14 17:43:59,371 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-14 17:43:59,371 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-14 17:43:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,374 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 17:43:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 17:43:59,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:59,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:59,375 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-14 17:43:59,375 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-14 17:43:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,378 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-14 17:43:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-14 17:43:59,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:59,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:59,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:43:59,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:43:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:43:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:43:59,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-14 17:43:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:43:59,382 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:43:59,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:43:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:43:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:43:59,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:59,384 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 17:43:59,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:59,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash -714418193, now seen corresponding path program 1 times [2018-11-14 17:43:59,385 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:59,385 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 17:43:59,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:59,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:59,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-14 17:43:59,531 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 17:43:59,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-14 17:43:59,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #66#return; {437#true} is VALID [2018-11-14 17:43:59,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret7 := main(); {437#true} is VALID [2018-11-14 17:43:59,533 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 17:43:59,533 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 17:43:59,534 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; {457#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:43:59,535 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 17:43:59,535 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 17:43:59,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {438#false} is VALID [2018-11-14 17:43:59,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} havoc ~i~0;~i~0 := 0bv32; {438#false} is VALID [2018-11-14 17:43:59,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 17:43:59,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~i~0, 100000bv32); {438#false} is VALID [2018-11-14 17:43:59,539 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#false} havoc ~x~0;~x~0 := 0bv32; {438#false} is VALID [2018-11-14 17:43:59,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 17:43:59,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {438#false} is VALID [2018-11-14 17:43:59,540 INFO L256 TraceCheckUtils]: 17: Hoare triple {438#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-14 17:43:59,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-14 17:43:59,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {438#false} assume ~cond == 0bv32; {438#false} is VALID [2018-11-14 17:43:59,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-14 17:43:59,542 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 17:43:59,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:43:59,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-14 17:43:59,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {438#false} assume ~cond == 0bv32; {438#false} is VALID [2018-11-14 17:43:59,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2018-11-14 17:43:59,640 INFO L256 TraceCheckUtils]: 17: Hoare triple {438#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {438#false} is VALID [2018-11-14 17:43:59,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {438#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {438#false} is VALID [2018-11-14 17:43:59,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 17:43:59,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {438#false} havoc ~x~0;~x~0 := 0bv32; {438#false} is VALID [2018-11-14 17:43:59,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {438#false} assume !~bvslt32(~i~0, 100000bv32); {438#false} is VALID [2018-11-14 17:43:59,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {438#false} assume true; {438#false} is VALID [2018-11-14 17:43:59,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#false} havoc ~i~0;~i~0 := 0bv32; {438#false} is VALID [2018-11-14 17:43:59,644 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 17:43:59,645 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 17:43:59,646 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 17:43:59,646 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; {541#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:43:59,648 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 17:43:59,651 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 17:43:59,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret7 := main(); {437#true} is VALID [2018-11-14 17:43:59,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #66#return; {437#true} is VALID [2018-11-14 17:43:59,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-14 17:43:59,652 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 17:43:59,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-14 17:43:59,654 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 17:43:59,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:43:59,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:43:59,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:43:59,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:59,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:43:59,793 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 17:43:59,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:43:59,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:43:59,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:43:59,795 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 17:44:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,188 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-14 17:44:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:44:00,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:44:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:44:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:44:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:44:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2018-11-14 17:44:00,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2018-11-14 17:44:00,311 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 17:44:00,313 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:44:00,314 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:44:00,314 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 17:44:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:44:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 17:44:00,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:00,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 17:44:00,333 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:44:00,333 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:44:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,337 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:44:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:44:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,338 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:44:00,338 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:44:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,341 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:44:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:44:00,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:00,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:44:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-14 17:44:00,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2018-11-14 17:44:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:00,347 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-14 17:44:00,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:44:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:44:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:44:00,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:00,348 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 17:44:00,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:00,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:00,349 INFO L82 PathProgramCache]: Analyzing trace with hash -615702966, now seen corresponding path program 2 times [2018-11-14 17:44:00,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:00,350 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 17:44:00,371 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:44:00,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:44:00,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:00,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:00,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2018-11-14 17:44:00,518 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 17:44:00,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #66#return; {760#true} is VALID [2018-11-14 17:44:00,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret7 := main(); {760#true} is VALID [2018-11-14 17:44:00,520 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 17:44:00,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,520 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; {760#true} is VALID [2018-11-14 17:44:00,521 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 17:44:00,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,521 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; {760#true} is VALID [2018-11-14 17:44:00,521 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 17:44:00,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,522 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; {760#true} is VALID [2018-11-14 17:44:00,522 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 17:44:00,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,522 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; {760#true} is VALID [2018-11-14 17:44:00,523 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 17:44:00,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {760#true} assume true; {760#true} is VALID [2018-11-14 17:44:00,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {760#true} assume !~bvslt32(~a~0, 100000bv32); {760#true} is VALID [2018-11-14 17:44:00,524 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 17:44:00,524 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 17:44:00,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {761#false} is VALID [2018-11-14 17:44:00,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {761#false} havoc ~x~0;~x~0 := 0bv32; {761#false} is VALID [2018-11-14 17:44:00,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {761#false} assume true; {761#false} is VALID [2018-11-14 17:44:00,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {761#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {761#false} is VALID [2018-11-14 17:44:00,526 INFO L256 TraceCheckUtils]: 26: Hoare triple {761#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {761#false} is VALID [2018-11-14 17:44:00,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2018-11-14 17:44:00,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {761#false} assume ~cond == 0bv32; {761#false} is VALID [2018-11-14 17:44:00,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {761#false} assume !false; {761#false} is VALID [2018-11-14 17:44:00,529 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 17:44:00,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:44:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:44:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:44:00,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 17:44:00,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:00,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:44:00,585 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 17:44:00,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:44:00,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:44:00,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:44:00,586 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 3 states. [2018-11-14 17:44:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,674 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-11-14 17:44:00,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:44:00,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-14 17:44:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:44:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 17:44:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:44:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-14 17:44:00,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-14 17:44:00,765 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 17:44:00,767 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:44:00,767 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:44:00,768 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 17:44:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:44:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:44:00,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:00,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:44:00,785 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:44:00,785 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:44:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,789 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:44:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:44:00,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,790 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:44:00,790 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:44:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,793 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 17:44:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 17:44:00,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:00,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:44:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-14 17:44:00,797 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2018-11-14 17:44:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:00,797 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-14 17:44:00,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:44:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-14 17:44:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:44:00,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:00,799 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 17:44:00,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:00,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -182024532, now seen corresponding path program 1 times [2018-11-14 17:44:00,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:00,800 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 17:44:00,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:44:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:00,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:01,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 17:44:01,067 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 17:44:01,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 17:44:01,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #66#return; {1050#true} is VALID [2018-11-14 17:44:01,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret7 := main(); {1050#true} is VALID [2018-11-14 17:44:01,069 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 17:44:01,070 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 17:44:01,070 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; {1070#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:44:01,072 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 17:44:01,074 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 17:44:01,074 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; {1080#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 17:44:01,076 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 17:44:01,076 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 17:44:01,079 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; {1090#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 17:44:01,079 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 17:44:01,093 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 17:44:01,094 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; {1100#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 17:44:01,095 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 17:44:01,097 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 17:44:01,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {1110#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1051#false} is VALID [2018-11-14 17:44:01,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {1051#false} havoc ~i~0;~i~0 := 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {1051#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1051#false} is VALID [2018-11-14 17:44:01,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {1051#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1051#false} is VALID [2018-11-14 17:44:01,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {1051#false} assume !~bvslt32(~i~0, 100000bv32); {1051#false} is VALID [2018-11-14 17:44:01,102 INFO L273 TraceCheckUtils]: 26: Hoare triple {1051#false} havoc ~x~0;~x~0 := 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {1051#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1051#false} is VALID [2018-11-14 17:44:01,103 INFO L256 TraceCheckUtils]: 29: Hoare triple {1051#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {1051#false} is VALID [2018-11-14 17:44:01,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2018-11-14 17:44:01,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {1051#false} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,104 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 17:44:01,106 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 17:44:01,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:01,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 17:44:01,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {1051#false} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} ~cond := #in~cond; {1051#false} is VALID [2018-11-14 17:44:01,413 INFO L256 TraceCheckUtils]: 29: Hoare triple {1051#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {1051#false} is VALID [2018-11-14 17:44:01,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {1051#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1051#false} is VALID [2018-11-14 17:44:01,414 INFO L273 TraceCheckUtils]: 27: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {1051#false} havoc ~x~0;~x~0 := 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {1051#false} assume !~bvslt32(~i~0, 100000bv32); {1051#false} is VALID [2018-11-14 17:44:01,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {1051#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1051#false} is VALID [2018-11-14 17:44:01,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {1051#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1051#false} is VALID [2018-11-14 17:44:01,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {1051#false} assume true; {1051#false} is VALID [2018-11-14 17:44:01,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {1051#false} havoc ~i~0;~i~0 := 0bv32; {1051#false} is VALID [2018-11-14 17:44:01,416 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 17:44:01,417 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 17:44:01,418 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 17:44:01,419 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; {1202#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:01,419 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 17:44:01,425 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 17:44:01,426 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; {1212#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:01,433 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 17:44:01,438 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 17:44:01,438 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; {1222#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:01,439 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 17:44:01,443 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 17:44:01,444 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; {1232#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:01,444 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 17:44:01,445 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 17:44:01,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret7 := main(); {1050#true} is VALID [2018-11-14 17:44:01,446 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #66#return; {1050#true} is VALID [2018-11-14 17:44:01,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 17:44:01,446 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 17:44:01,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 17:44:01,449 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 17:44:01,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:01,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:44:01,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 17:44:01,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:01,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:44:01,543 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 17:44:01,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:44:01,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:44:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:44:01,544 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 12 states. [2018-11-14 17:44:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,435 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-14 17:44:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:44:02,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-14 17:44:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:44:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 17:44:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:44:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 17:44:02,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2018-11-14 17:44:02,571 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 17:44:02,573 INFO L225 Difference]: With dead ends: 74 [2018-11-14 17:44:02,573 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:44:02,574 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 17:44:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:44:02,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-14 17:44:02,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:02,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-14 17:44:02,619 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 17:44:02,620 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 17:44:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,622 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 17:44:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 17:44:02,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:02,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:02,624 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 17:44:02,624 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 17:44:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,627 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 17:44:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 17:44:02,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:02,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:02,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:44:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-14 17:44:02,632 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 33 [2018-11-14 17:44:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:02,632 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-14 17:44:02,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:44:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-14 17:44:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 17:44:02,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:02,634 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 17:44:02,635 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:02,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:02,635 INFO L82 PathProgramCache]: Analyzing trace with hash 307358988, now seen corresponding path program 2 times [2018-11-14 17:44:02,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:02,636 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 17:44:02,654 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:44:02,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:44:02,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:02,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:02,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2018-11-14 17:44:02,973 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 17:44:02,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2018-11-14 17:44:02,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #66#return; {1554#true} is VALID [2018-11-14 17:44:02,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret7 := main(); {1554#true} is VALID [2018-11-14 17:44:02,975 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 17:44:02,975 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 17:44:02,976 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; {1574#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:44:02,977 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 17:44:02,977 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 17:44:02,978 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; {1584#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 17:44:02,979 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 17:44:02,980 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 17:44:02,980 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; {1594#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 17:44:02,981 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 17:44:02,982 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 17:44:02,983 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; {1604#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 17:44:02,984 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 17:44:02,984 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 17:44:02,985 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; {1614#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:44:02,987 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 17:44:02,988 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 17:44:02,988 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; {1624#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 17:44:02,989 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 17:44:02,990 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 17:44:02,991 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; {1634#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 17:44:02,992 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 17:44:02,992 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 17:44:02,993 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; {1644#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 17:44:03,004 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 17:44:03,005 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 17:44:03,005 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; {1654#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 17:44:03,011 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 17:44:03,013 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 17:44:03,013 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; {1664#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 17:44:03,014 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 17:44:03,014 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 17:44:03,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {1674#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1555#false} is VALID [2018-11-14 17:44:03,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {1555#false} havoc ~i~0;~i~0 := 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,016 INFO L273 TraceCheckUtils]: 39: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,016 INFO L273 TraceCheckUtils]: 40: Hoare triple {1555#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1555#false} is VALID [2018-11-14 17:44:03,017 INFO L273 TraceCheckUtils]: 41: Hoare triple {1555#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1555#false} is VALID [2018-11-14 17:44:03,017 INFO L273 TraceCheckUtils]: 42: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,017 INFO L273 TraceCheckUtils]: 43: Hoare triple {1555#false} assume !~bvslt32(~i~0, 100000bv32); {1555#false} is VALID [2018-11-14 17:44:03,018 INFO L273 TraceCheckUtils]: 44: Hoare triple {1555#false} havoc ~x~0;~x~0 := 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,018 INFO L273 TraceCheckUtils]: 45: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,019 INFO L273 TraceCheckUtils]: 46: Hoare triple {1555#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1555#false} is VALID [2018-11-14 17:44:03,019 INFO L256 TraceCheckUtils]: 47: Hoare triple {1555#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {1555#false} is VALID [2018-11-14 17:44:03,019 INFO L273 TraceCheckUtils]: 48: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2018-11-14 17:44:03,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {1555#false} assume ~cond == 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2018-11-14 17:44:03,024 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 17:44:03,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:03,735 INFO L273 TraceCheckUtils]: 50: Hoare triple {1555#false} assume !false; {1555#false} is VALID [2018-11-14 17:44:03,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {1555#false} assume ~cond == 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {1555#false} ~cond := #in~cond; {1555#false} is VALID [2018-11-14 17:44:03,737 INFO L256 TraceCheckUtils]: 47: Hoare triple {1555#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {1555#false} is VALID [2018-11-14 17:44:03,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {1555#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1555#false} is VALID [2018-11-14 17:44:03,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {1555#false} havoc ~x~0;~x~0 := 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {1555#false} assume !~bvslt32(~i~0, 100000bv32); {1555#false} is VALID [2018-11-14 17:44:03,738 INFO L273 TraceCheckUtils]: 42: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {1555#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1555#false} is VALID [2018-11-14 17:44:03,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {1555#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1555#false} is VALID [2018-11-14 17:44:03,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {1555#false} assume true; {1555#false} is VALID [2018-11-14 17:44:03,739 INFO L273 TraceCheckUtils]: 38: Hoare triple {1555#false} havoc ~i~0;~i~0 := 0bv32; {1555#false} is VALID [2018-11-14 17:44:03,739 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 17:44:03,740 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 17:44:03,741 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 17:44:03,741 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; {1766#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,742 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 17:44:03,746 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 17:44:03,747 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; {1776#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,747 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 17:44:03,752 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 17:44:03,752 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; {1786#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,753 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 17:44:03,757 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 17:44:03,758 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; {1796#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,760 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 17:44:03,767 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 17:44:03,767 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; {1806#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,768 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 17:44:03,774 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 17:44:03,777 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; {1816#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,781 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 17:44:03,788 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 17:44:03,788 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; {1826#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,788 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 17:44:03,795 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 17:44:03,796 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; {1836#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,796 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 17:44:03,800 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 17:44:03,801 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; {1846#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,801 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 17:44:03,807 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 17:44:03,807 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; {1856#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:03,808 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 17:44:03,808 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 17:44:03,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {1554#true} call #t~ret7 := main(); {1554#true} is VALID [2018-11-14 17:44:03,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1554#true} {1554#true} #66#return; {1554#true} is VALID [2018-11-14 17:44:03,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {1554#true} assume true; {1554#true} is VALID [2018-11-14 17:44:03,809 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 17:44:03,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {1554#true} call ULTIMATE.init(); {1554#true} is VALID [2018-11-14 17:44:03,813 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 17:44:03,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:03,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:44:03,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-14 17:44:03,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:03,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:44:03,982 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 17:44:03,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:44:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:44:03,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:44:03,983 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 24 states. [2018-11-14 17:44:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:07,517 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-11-14 17:44:07,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:44:07,517 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-11-14 17:44:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:44:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 121 transitions. [2018-11-14 17:44:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:44:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 121 transitions. [2018-11-14 17:44:07,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 121 transitions. [2018-11-14 17:44:07,805 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 17:44:07,808 INFO L225 Difference]: With dead ends: 110 [2018-11-14 17:44:07,809 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 17:44:07,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:44:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 17:44:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 17:44:07,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:07,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 17:44:07,879 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 17:44:07,879 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 17:44:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:07,882 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 17:44:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 17:44:07,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:07,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:07,884 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 17:44:07,884 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 17:44:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:07,888 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 17:44:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 17:44:07,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:07,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:07,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:07,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:44:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-14 17:44:07,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 51 [2018-11-14 17:44:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:07,893 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-14 17:44:07,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:44:07,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-14 17:44:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 17:44:07,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:07,896 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 17:44:07,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:07,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:07,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1099681332, now seen corresponding path program 3 times [2018-11-14 17:44:07,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:07,898 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 17:44:07,929 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:44:07,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:44:07,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:08,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:08,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2018-11-14 17:44:08,086 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 17:44:08,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2358#true} {2358#true} #66#return; {2358#true} is VALID [2018-11-14 17:44:08,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {2358#true} call #t~ret7 := main(); {2358#true} is VALID [2018-11-14 17:44:08,087 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 17:44:08,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,088 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; {2358#true} is VALID [2018-11-14 17:44:08,088 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 17:44:08,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,089 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; {2358#true} is VALID [2018-11-14 17:44:08,089 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 17:44:08,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,089 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; {2358#true} is VALID [2018-11-14 17:44:08,089 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 17:44:08,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,089 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; {2358#true} is VALID [2018-11-14 17:44:08,090 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 17:44:08,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,090 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; {2358#true} is VALID [2018-11-14 17:44:08,090 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 17:44:08,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,091 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; {2358#true} is VALID [2018-11-14 17:44:08,091 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 17:44:08,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,091 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; {2358#true} is VALID [2018-11-14 17:44:08,091 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 17:44:08,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,092 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; {2358#true} is VALID [2018-11-14 17:44:08,092 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 17:44:08,092 INFO L273 TraceCheckUtils]: 30: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,092 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; {2358#true} is VALID [2018-11-14 17:44:08,092 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 17:44:08,093 INFO L273 TraceCheckUtils]: 33: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,093 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; {2358#true} is VALID [2018-11-14 17:44:08,093 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 17:44:08,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,093 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; {2358#true} is VALID [2018-11-14 17:44:08,093 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 17:44:08,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,094 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; {2358#true} is VALID [2018-11-14 17:44:08,094 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 17:44:08,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,094 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; {2358#true} is VALID [2018-11-14 17:44:08,094 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 17:44:08,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,095 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; {2358#true} is VALID [2018-11-14 17:44:08,095 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 17:44:08,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,095 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; {2358#true} is VALID [2018-11-14 17:44:08,095 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 17:44:08,095 INFO L273 TraceCheckUtils]: 51: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,096 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; {2358#true} is VALID [2018-11-14 17:44:08,096 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 17:44:08,096 INFO L273 TraceCheckUtils]: 54: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,096 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; {2358#true} is VALID [2018-11-14 17:44:08,096 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 17:44:08,096 INFO L273 TraceCheckUtils]: 57: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,097 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; {2358#true} is VALID [2018-11-14 17:44:08,097 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 17:44:08,097 INFO L273 TraceCheckUtils]: 60: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,097 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; {2358#true} is VALID [2018-11-14 17:44:08,097 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 17:44:08,097 INFO L273 TraceCheckUtils]: 63: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,097 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; {2358#true} is VALID [2018-11-14 17:44:08,098 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 17:44:08,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,098 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; {2358#true} is VALID [2018-11-14 17:44:08,098 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 17:44:08,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,098 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; {2358#true} is VALID [2018-11-14 17:44:08,099 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 17:44:08,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {2358#true} assume !~bvslt32(~a~0, 100000bv32); {2358#true} is VALID [2018-11-14 17:44:08,106 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 17:44:08,112 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 17:44:08,114 INFO L273 TraceCheckUtils]: 76: Hoare triple {2585#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2585#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:08,115 INFO L273 TraceCheckUtils]: 77: Hoare triple {2585#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2595#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:08,120 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 17:44:08,122 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 17:44:08,122 INFO L273 TraceCheckUtils]: 80: Hoare triple {2359#false} havoc ~x~0;~x~0 := 0bv32; {2359#false} is VALID [2018-11-14 17:44:08,122 INFO L273 TraceCheckUtils]: 81: Hoare triple {2359#false} assume true; {2359#false} is VALID [2018-11-14 17:44:08,122 INFO L273 TraceCheckUtils]: 82: Hoare triple {2359#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2359#false} is VALID [2018-11-14 17:44:08,122 INFO L256 TraceCheckUtils]: 83: Hoare triple {2359#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {2359#false} is VALID [2018-11-14 17:44:08,122 INFO L273 TraceCheckUtils]: 84: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2018-11-14 17:44:08,123 INFO L273 TraceCheckUtils]: 85: Hoare triple {2359#false} assume ~cond == 0bv32; {2359#false} is VALID [2018-11-14 17:44:08,123 INFO L273 TraceCheckUtils]: 86: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2018-11-14 17:44:08,129 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 17:44:08,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:08,261 INFO L273 TraceCheckUtils]: 86: Hoare triple {2359#false} assume !false; {2359#false} is VALID [2018-11-14 17:44:08,262 INFO L273 TraceCheckUtils]: 85: Hoare triple {2359#false} assume ~cond == 0bv32; {2359#false} is VALID [2018-11-14 17:44:08,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {2359#false} ~cond := #in~cond; {2359#false} is VALID [2018-11-14 17:44:08,262 INFO L256 TraceCheckUtils]: 83: Hoare triple {2359#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {2359#false} is VALID [2018-11-14 17:44:08,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {2359#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2359#false} is VALID [2018-11-14 17:44:08,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {2359#false} assume true; {2359#false} is VALID [2018-11-14 17:44:08,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {2359#false} havoc ~x~0;~x~0 := 0bv32; {2359#false} is VALID [2018-11-14 17:44:08,263 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 17:44:08,264 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 17:44:08,264 INFO L273 TraceCheckUtils]: 77: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2644#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:08,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:08,265 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 17:44:08,266 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 17:44:08,266 INFO L273 TraceCheckUtils]: 73: Hoare triple {2358#true} assume !~bvslt32(~a~0, 100000bv32); {2358#true} is VALID [2018-11-14 17:44:08,266 INFO L273 TraceCheckUtils]: 72: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,266 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 17:44:08,266 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; {2358#true} is VALID [2018-11-14 17:44:08,267 INFO L273 TraceCheckUtils]: 69: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,267 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 17:44:08,267 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; {2358#true} is VALID [2018-11-14 17:44:08,268 INFO L273 TraceCheckUtils]: 66: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,268 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 17:44:08,268 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; {2358#true} is VALID [2018-11-14 17:44:08,268 INFO L273 TraceCheckUtils]: 63: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,269 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 17:44:08,269 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; {2358#true} is VALID [2018-11-14 17:44:08,269 INFO L273 TraceCheckUtils]: 60: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,269 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 17:44:08,270 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; {2358#true} is VALID [2018-11-14 17:44:08,270 INFO L273 TraceCheckUtils]: 57: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,270 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 17:44:08,270 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; {2358#true} is VALID [2018-11-14 17:44:08,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,271 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 17:44:08,271 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; {2358#true} is VALID [2018-11-14 17:44:08,271 INFO L273 TraceCheckUtils]: 51: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,271 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 17:44:08,271 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; {2358#true} is VALID [2018-11-14 17:44:08,272 INFO L273 TraceCheckUtils]: 48: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,272 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 17:44:08,272 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; {2358#true} is VALID [2018-11-14 17:44:08,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,272 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 17:44:08,273 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; {2358#true} is VALID [2018-11-14 17:44:08,273 INFO L273 TraceCheckUtils]: 42: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,273 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 17:44:08,273 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; {2358#true} is VALID [2018-11-14 17:44:08,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,273 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 17:44:08,274 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; {2358#true} is VALID [2018-11-14 17:44:08,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,274 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 17:44:08,274 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; {2358#true} is VALID [2018-11-14 17:44:08,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,275 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 17:44:08,275 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; {2358#true} is VALID [2018-11-14 17:44:08,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,275 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 17:44:08,275 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; {2358#true} is VALID [2018-11-14 17:44:08,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,276 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 17:44:08,276 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; {2358#true} is VALID [2018-11-14 17:44:08,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,276 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 17:44:08,276 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; {2358#true} is VALID [2018-11-14 17:44:08,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,277 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 17:44:08,277 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; {2358#true} is VALID [2018-11-14 17:44:08,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,277 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 17:44:08,277 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; {2358#true} is VALID [2018-11-14 17:44:08,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,278 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 17:44:08,278 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; {2358#true} is VALID [2018-11-14 17:44:08,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,278 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 17:44:08,279 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; {2358#true} is VALID [2018-11-14 17:44:08,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,279 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 17:44:08,279 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; {2358#true} is VALID [2018-11-14 17:44:08,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,279 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 17:44:08,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {2358#true} call #t~ret7 := main(); {2358#true} is VALID [2018-11-14 17:44:08,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2358#true} {2358#true} #66#return; {2358#true} is VALID [2018-11-14 17:44:08,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {2358#true} assume true; {2358#true} is VALID [2018-11-14 17:44:08,280 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 17:44:08,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {2358#true} call ULTIMATE.init(); {2358#true} is VALID [2018-11-14 17:44:08,285 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 17:44:08,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:08,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:44:08,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-14 17:44:08,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:08,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:44:08,334 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 17:44:08,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:44:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:44:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:44:08,335 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 6 states. [2018-11-14 17:44:08,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:08,675 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 17:44:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:44:08,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-11-14 17:44:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:44:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-14 17:44:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:44:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-14 17:44:08,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-14 17:44:08,752 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 17:44:08,755 INFO L225 Difference]: With dead ends: 113 [2018-11-14 17:44:08,756 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 17:44:08,756 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 17:44:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 17:44:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-11-14 17:44:08,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:08,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2018-11-14 17:44:08,810 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 17:44:08,810 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 17:44:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:08,813 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-14 17:44:08,813 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 17:44:08,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:08,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:08,814 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2018-11-14 17:44:08,814 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2018-11-14 17:44:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:08,818 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-14 17:44:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 17:44:08,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:08,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:08,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:08,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:44:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-14 17:44:08,822 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 87 [2018-11-14 17:44:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:08,822 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-14 17:44:08,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:44:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-11-14 17:44:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-14 17:44:08,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:08,824 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 17:44:08,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:08,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1529315158, now seen corresponding path program 4 times [2018-11-14 17:44:08,825 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:08,825 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 17:44:08,842 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:44:08,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:44:08,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:08,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:09,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {3376#true} call ULTIMATE.init(); {3376#true} is VALID [2018-11-14 17:44:09,424 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 17:44:09,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {3376#true} assume true; {3376#true} is VALID [2018-11-14 17:44:09,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3376#true} {3376#true} #66#return; {3376#true} is VALID [2018-11-14 17:44:09,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {3376#true} call #t~ret7 := main(); {3376#true} is VALID [2018-11-14 17:44:09,425 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 17:44:09,425 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 17:44:09,426 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; {3396#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:44:09,426 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 17:44:09,426 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 17:44:09,427 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; {3406#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 17:44:09,427 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 17:44:09,427 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 17:44:09,428 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; {3416#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 17:44:09,428 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 17:44:09,429 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 17:44:09,429 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; {3426#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 17:44:09,430 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 17:44:09,431 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 17:44:09,431 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; {3436#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:44:09,432 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 17:44:09,432 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 17:44:09,450 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; {3446#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 17:44:09,463 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 17:44:09,472 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 17:44:09,483 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; {3456#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 17:44:09,484 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 17:44:09,484 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 17:44:09,484 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; {3466#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 17:44:09,485 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 17:44:09,485 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 17:44:09,485 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; {3476#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 17:44:09,486 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 17:44:09,486 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 17:44:09,487 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; {3486#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 17:44:09,487 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 17:44:09,488 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 17:44:09,488 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; {3496#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 17:44:09,489 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 17:44:09,490 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 17:44:09,490 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; {3506#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 17:44:09,491 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 17:44:09,492 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 17:44:09,492 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; {3516#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 17:44:09,493 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 17:44:09,493 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 17:44:09,494 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; {3526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 17:44:09,495 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 17:44:09,495 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 17:44:09,496 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; {3536#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 17:44:09,496 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 17:44:09,497 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 17:44:09,497 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; {3546#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 17:44:09,498 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 17:44:09,498 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 17:44:09,499 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; {3556#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 17:44:09,500 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 17:44:09,500 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 17:44:09,501 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; {3566#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 17:44:09,511 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 17:44:09,512 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 17:44:09,512 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; {3576#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 17:44:09,516 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 17:44:09,517 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 17:44:09,525 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; {3586#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 17:44:09,530 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 17:44:09,532 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 17:44:09,532 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; {3596#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 17:44:09,533 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 17:44:09,533 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 17:44:09,533 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; {3606#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 17:44:09,534 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 17:44:09,534 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 17:44:09,534 INFO L273 TraceCheckUtils]: 73: Hoare triple {3616#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {3377#false} is VALID [2018-11-14 17:44:09,535 INFO L273 TraceCheckUtils]: 74: Hoare triple {3377#false} havoc ~i~0;~i~0 := 0bv32; {3377#false} is VALID [2018-11-14 17:44:09,535 INFO L273 TraceCheckUtils]: 75: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,535 INFO L273 TraceCheckUtils]: 76: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:09,535 INFO L273 TraceCheckUtils]: 77: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:09,535 INFO L273 TraceCheckUtils]: 78: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,536 INFO L273 TraceCheckUtils]: 79: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:09,536 INFO L273 TraceCheckUtils]: 80: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:09,536 INFO L273 TraceCheckUtils]: 81: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,536 INFO L273 TraceCheckUtils]: 82: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:09,536 INFO L273 TraceCheckUtils]: 83: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 84: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 85: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 86: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 87: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 88: Hoare triple {3377#false} assume !~bvslt32(~i~0, 100000bv32); {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 89: Hoare triple {3377#false} havoc ~x~0;~x~0 := 0bv32; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 90: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:09,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {3377#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3377#false} is VALID [2018-11-14 17:44:09,538 INFO L256 TraceCheckUtils]: 92: Hoare triple {3377#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {3377#false} is VALID [2018-11-14 17:44:09,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {3377#false} ~cond := #in~cond; {3377#false} is VALID [2018-11-14 17:44:09,538 INFO L273 TraceCheckUtils]: 94: Hoare triple {3377#false} assume ~cond == 0bv32; {3377#false} is VALID [2018-11-14 17:44:09,538 INFO L273 TraceCheckUtils]: 95: Hoare triple {3377#false} assume !false; {3377#false} is VALID [2018-11-14 17:44:09,544 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 17:44:09,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:11,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {3377#false} assume !false; {3377#false} is VALID [2018-11-14 17:44:11,761 INFO L273 TraceCheckUtils]: 94: Hoare triple {3377#false} assume ~cond == 0bv32; {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 93: Hoare triple {3377#false} ~cond := #in~cond; {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L256 TraceCheckUtils]: 92: Hoare triple {3377#false} call __VERIFIER_assert((if #t~mem5 == #t~mem6 then 1bv32 else 0bv32)); {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 91: Hoare triple {3377#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 90: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {3377#false} havoc ~x~0;~x~0 := 0bv32; {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {3377#false} assume !~bvslt32(~i~0, 100000bv32); {3377#false} is VALID [2018-11-14 17:44:11,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 86: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 85: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 84: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 83: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 82: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:11,763 INFO L273 TraceCheckUtils]: 81: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 80: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 79: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 78: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 77: Hoare triple {3377#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 76: Hoare triple {3377#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 75: Hoare triple {3377#false} assume true; {3377#false} is VALID [2018-11-14 17:44:11,764 INFO L273 TraceCheckUtils]: 74: Hoare triple {3377#false} havoc ~i~0;~i~0 := 0bv32; {3377#false} is VALID [2018-11-14 17:44:11,765 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 17:44:11,765 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 17:44:11,766 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 17:44:11,767 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; {3762#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,767 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 17:44:11,774 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 17:44:11,774 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; {3772#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,774 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 17:44:11,780 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 17:44:11,781 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; {3782#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,781 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 17:44:11,787 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 17:44:11,787 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; {3792#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,787 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 17:44:11,792 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 17:44:11,793 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; {3802#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,793 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 17:44:11,799 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 17:44:11,800 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; {3812#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,800 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 17:44:11,807 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 17:44:11,807 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; {3822#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,808 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 17:44:11,813 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 17:44:11,814 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; {3832#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,814 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 17:44:11,818 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 17:44:11,818 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; {3842#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,819 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 17:44:11,825 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 17:44:11,826 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; {3852#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,826 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 17:44:11,833 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 17:44:11,833 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; {3862#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,834 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 17:44:11,840 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 17:44:11,841 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; {3872#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,841 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 17:44:11,850 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 17:44:11,850 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; {3882#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,850 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 17:44:11,858 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 17:44:11,858 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; {3892#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,858 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 17:44:11,864 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 17:44:11,864 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; {3902#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,865 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 17:44:11,871 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 17:44:11,872 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; {3912#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,872 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 17:44:11,877 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 17:44:11,878 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; {3922#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,878 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 17:44:11,884 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 17:44:11,884 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; {3932#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,885 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 17:44:11,892 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 17:44:11,893 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; {3942#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,893 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 17:44:11,902 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 17:44:11,903 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; {3952#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,903 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 17:44:11,912 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 17:44:11,913 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; {3962#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,913 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 17:44:11,919 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 17:44:11,919 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; {3972#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:11,920 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 17:44:11,920 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 17:44:11,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {3376#true} call #t~ret7 := main(); {3376#true} is VALID [2018-11-14 17:44:11,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3376#true} {3376#true} #66#return; {3376#true} is VALID [2018-11-14 17:44:11,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {3376#true} assume true; {3376#true} is VALID [2018-11-14 17:44:11,921 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 17:44:11,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {3376#true} call ULTIMATE.init(); {3376#true} is VALID [2018-11-14 17:44:11,936 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 17:44:11,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:11,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:44:11,939 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-11-14 17:44:11,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:11,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:44:12,432 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 17:44:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:44:12,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:44:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:44:12,433 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 48 states. [2018-11-14 17:44:17,579 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:44:18,042 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:44:18,543 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 17:44:19,082 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:44:19,642 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:44:20,207 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:44:20,796 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 17:44:21,390 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 17:44:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:28,597 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-14 17:44:28,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:44:28,598 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-11-14 17:44:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:44:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 205 transitions. [2018-11-14 17:44:28,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:44:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 205 transitions. [2018-11-14 17:44:28,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 205 transitions. [2018-11-14 17:44:28,963 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 17:44:28,966 INFO L225 Difference]: With dead ends: 200 [2018-11-14 17:44:28,966 INFO L226 Difference]: Without dead ends: 173 [2018-11-14 17:44:28,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:44:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-14 17:44:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-11-14 17:44:29,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:29,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 173 states. [2018-11-14 17:44:29,034 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2018-11-14 17:44:29,034 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2018-11-14 17:44:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:29,039 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-11-14 17:44:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 17:44:29,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:29,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:29,039 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 173 states. [2018-11-14 17:44:29,040 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 173 states. [2018-11-14 17:44:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:29,045 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-11-14 17:44:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 17:44:29,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:29,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:29,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:29,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 17:44:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-11-14 17:44:29,051 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 96 [2018-11-14 17:44:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:29,052 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-11-14 17:44:29,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:44:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-11-14 17:44:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-14 17:44:29,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:29,054 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 17:44:29,055 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:29,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:29,055 INFO L82 PathProgramCache]: Analyzing trace with hash 882689834, now seen corresponding path program 5 times [2018-11-14 17:44:29,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:29,056 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 17:44:29,080 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1