java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:05:24,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:05:24,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:05:24,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:05:24,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:05:24,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:05:24,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:05:24,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:05:24,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:05:24,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:05:24,315 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:05:24,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:05:24,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:05:24,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:05:24,323 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:05:24,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:05:24,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:05:24,334 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:05:24,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:05:24,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:05:24,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:05:24,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:05:24,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:05:24,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:05:24,347 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:05:24,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:05:24,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:05:24,350 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:05:24,351 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:05:24,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:05:24,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:05:24,354 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:05:24,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:05:24,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:05:24,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:05:24,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:05:24,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:05:24,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:05:24,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:05:24,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:05:24,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:05:24,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:05:24,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:05:24,391 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:05:24,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:05:24,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:05:24,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:05:24,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:05:24,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:05:24,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:05:24,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:05:24,392 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:05:24,393 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:05:24,394 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:05:24,394 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:05:24,394 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:05:24,395 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:05:24,395 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:05:24,395 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:05:24,395 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:05:24,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:05:24,396 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:05:24,396 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:05:24,396 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:05:24,396 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:05:24,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:05:24,397 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:05:24,397 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:05:24,397 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:05:24,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:05:24,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:05:24,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:05:24,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:05:24,482 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:05:24,483 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-14 16:05:24,548 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ac25951/8f613af0f7324e309455919189169b7d/FLAG8b3a9c8a5 [2018-11-14 16:05:25,020 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:05:25,020 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly1_true-unreach-call.i [2018-11-14 16:05:25,026 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ac25951/8f613af0f7324e309455919189169b7d/FLAG8b3a9c8a5 [2018-11-14 16:05:25,043 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2ac25951/8f613af0f7324e309455919189169b7d [2018-11-14 16:05:25,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:05:25,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:05:25,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:05:25,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:05:25,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:05:25,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25, skipping insertion in model container [2018-11-14 16:05:25,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:05:25,106 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:05:25,351 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:05:25,360 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:05:25,390 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:05:25,430 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:05:25,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25 WrapperNode [2018-11-14 16:05:25,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:05:25,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:05:25,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:05:25,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:05:25,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,463 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (1/1) ... [2018-11-14 16:05:25,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:05:25,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:05:25,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:05:25,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:05:25,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (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 16:05:25,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:05:25,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:05:25,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:05:25,665 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:05:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:05:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:05:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:05:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:05:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:05:25,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:05:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-11-14 16:05:26,316 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:05:26,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:05:26 BoogieIcfgContainer [2018-11-14 16:05:26,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:05:26,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:05:26,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:05:26,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:05:26,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:05:25" (1/3) ... [2018-11-14 16:05:26,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f28a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:05:26, skipping insertion in model container [2018-11-14 16:05:26,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:05:25" (2/3) ... [2018-11-14 16:05:26,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f28a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:05:26, skipping insertion in model container [2018-11-14 16:05:26,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:05:26" (3/3) ... [2018-11-14 16:05:26,325 INFO L112 eAbstractionObserver]: Analyzing ICFG poly1_true-unreach-call.i [2018-11-14 16:05:26,335 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:05:26,343 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:05:26,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:05:26,394 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:05:26,395 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:05:26,395 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:05:26,395 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:05:26,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:05:26,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:05:26,396 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:05:26,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:05:26,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:05:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-14 16:05:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:05:26,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:26,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:26,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:26,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1097786377, now seen corresponding path program 1 times [2018-11-14 16:05:26,437 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:26,438 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 16:05:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:26,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:26,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-14 16:05:26,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {31#true} is VALID [2018-11-14 16:05:26,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-14 16:05:26,609 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #58#return; {31#true} is VALID [2018-11-14 16:05:26,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-14 16:05:26,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2018-11-14 16:05:26,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {31#true} is VALID [2018-11-14 16:05:26,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-14 16:05:26,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {32#false} is VALID [2018-11-14 16:05:26,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume true; {32#false} is VALID [2018-11-14 16:05:26,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {32#false} is VALID [2018-11-14 16:05:26,613 INFO L256 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-14 16:05:26,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-14 16:05:26,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume ~cond == 0bv32; {32#false} is VALID [2018-11-14 16:05:26,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-14 16:05:26,617 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 16:05:26,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:05:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:05:26,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:05:26,625 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:05:26,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:26,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:05:26,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:26,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:05:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:05:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:05:26,811 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-14 16:05:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,306 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 16:05:27,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:05:27,307 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:05:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:05:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-14 16:05:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:05:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-14 16:05:27,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-14 16:05:27,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:27,738 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:05:27,738 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:05:27,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 16:05:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:05:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:05:27,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:27,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:05:27,797 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:05:27,797 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:05:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,801 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 16:05:27,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:05:27,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:27,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:27,803 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:05:27,803 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:05:27,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:27,808 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 16:05:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:05:27,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:27,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:27,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:27,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:05:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-14 16:05:27,812 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-14 16:05:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:27,813 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-14 16:05:27,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:05:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 16:05:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:05:27,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:27,814 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:27,814 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:27,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1066530449, now seen corresponding path program 1 times [2018-11-14 16:05:27,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:27,815 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 16:05:27,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:27,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:28,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2018-11-14 16:05:28,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {208#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {208#true} is VALID [2018-11-14 16:05:28,086 INFO L273 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-14 16:05:28,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #58#return; {208#true} is VALID [2018-11-14 16:05:28,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret5 := main(); {208#true} is VALID [2018-11-14 16:05:28,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {208#true} is VALID [2018-11-14 16:05:28,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {231#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:28,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {231#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:28,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {231#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {209#false} is VALID [2018-11-14 16:05:28,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {209#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {209#false} is VALID [2018-11-14 16:05:28,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {209#false} assume true; {209#false} is VALID [2018-11-14 16:05:28,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {209#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {209#false} is VALID [2018-11-14 16:05:28,093 INFO L256 TraceCheckUtils]: 12: Hoare triple {209#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {209#false} is VALID [2018-11-14 16:05:28,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {209#false} ~cond := #in~cond; {209#false} is VALID [2018-11-14 16:05:28,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {209#false} assume ~cond == 0bv32; {209#false} is VALID [2018-11-14 16:05:28,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {209#false} assume !false; {209#false} is VALID [2018-11-14 16:05:28,096 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 16:05:28,097 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:05:28,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:05:28,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:05:28,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 16:05:28,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:28,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:05:28,201 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 16:05:28,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:05:28,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:05:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:05:28,203 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 3 states. [2018-11-14 16:05:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:28,811 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-14 16:05:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:05:28,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 16:05:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:05:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-14 16:05:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:05:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-11-14 16:05:28,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-11-14 16:05:29,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:29,180 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:05:29,180 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 16:05:29,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 16:05:29,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 16:05:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-14 16:05:29,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:29,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-14 16:05:29,194 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-14 16:05:29,194 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-14 16:05:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:29,196 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-14 16:05:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-14 16:05:29,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:29,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:29,197 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-14 16:05:29,198 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-14 16:05:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:29,200 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-14 16:05:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-14 16:05:29,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:29,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:29,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:29,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:05:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-14 16:05:29,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-11-14 16:05:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:29,204 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-14 16:05:29,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:05:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 16:05:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:05:29,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:29,206 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:29,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:29,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 205897947, now seen corresponding path program 1 times [2018-11-14 16:05:29,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:29,207 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 16:05:29,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:05:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:29,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:29,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-14 16:05:29,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {390#true} is VALID [2018-11-14 16:05:29,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-14 16:05:29,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #58#return; {390#true} is VALID [2018-11-14 16:05:29,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2018-11-14 16:05:29,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {390#true} is VALID [2018-11-14 16:05:29,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {390#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:29,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:29,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:29,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:05:29,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:05:29,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {391#false} is VALID [2018-11-14 16:05:29,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {391#false} is VALID [2018-11-14 16:05:29,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 16:05:29,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {391#false} is VALID [2018-11-14 16:05:29,832 INFO L256 TraceCheckUtils]: 15: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-14 16:05:29,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-14 16:05:29,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {391#false} assume ~cond == 0bv32; {391#false} is VALID [2018-11-14 16:05:29,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-14 16:05:29,835 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 16:05:29,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:30,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-14 16:05:30,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {391#false} assume ~cond == 0bv32; {391#false} is VALID [2018-11-14 16:05:30,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-14 16:05:30,052 INFO L256 TraceCheckUtils]: 15: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {391#false} is VALID [2018-11-14 16:05:30,053 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {391#false} is VALID [2018-11-14 16:05:30,053 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 16:05:30,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} ~i~0 := ~sign_extendFrom32To64(0bv32); {391#false} is VALID [2018-11-14 16:05:30,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {472#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {391#false} is VALID [2018-11-14 16:05:30,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {472#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} assume true; {472#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-14 16:05:30,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {472#(bvslt main_~i~0 ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-14 16:05:30,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-14 16:05:30,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} assume true; {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-14 16:05:30,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {390#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {479#(bvslt (bvadd main_~i~0 (_ bv1 64)) ((_ sign_extend 32) ~SIZE~0))} is VALID [2018-11-14 16:05:30,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {390#true} is VALID [2018-11-14 16:05:30,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2018-11-14 16:05:30,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #58#return; {390#true} is VALID [2018-11-14 16:05:30,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-14 16:05:30,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {390#true} is VALID [2018-11-14 16:05:30,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-14 16:05:30,071 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 16:05:30,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:30,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:05:30,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:05:30,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:30,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:05:30,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:30,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:05:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:05:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:05:30,216 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-14 16:05:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:31,623 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-14 16:05:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:05:31,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 16:05:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:05:31,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-14 16:05:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:05:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2018-11-14 16:05:31,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2018-11-14 16:05:31,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:31,924 INFO L225 Difference]: With dead ends: 40 [2018-11-14 16:05:31,925 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:05:31,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:05:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:05:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-14 16:05:31,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:31,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-14 16:05:31,936 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-14 16:05:31,936 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-14 16:05:31,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:31,939 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 16:05:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 16:05:31,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:31,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:31,940 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-14 16:05:31,940 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-14 16:05:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:31,943 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 16:05:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 16:05:31,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:31,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:31,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:31,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:05:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-14 16:05:31,946 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2018-11-14 16:05:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:31,946 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-14 16:05:31,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:05:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-14 16:05:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:05:31,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:31,948 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:31,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:31,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -261111313, now seen corresponding path program 2 times [2018-11-14 16:05:31,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:31,949 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 16:05:31,968 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:05:32,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:05:32,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:05:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:32,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:32,544 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:32,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:32,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 61 [2018-11-14 16:05:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:32,606 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:32,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2018-11-14 16:05:32,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:32,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:32,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:32,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-11-14 16:05:33,002 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-14 16:05:33,181 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-14 16:05:33,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2018-11-14 16:05:33,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,307 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,314 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 165 [2018-11-14 16:05:33,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2018-11-14 16:05:33,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-11-14 16:05:33,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:33,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,696 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:33,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 161 [2018-11-14 16:05:33,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:33,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:20 [2018-11-14 16:05:33,747 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:33,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2018-11-14 16:05:33,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {655#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {655#true} is VALID [2018-11-14 16:05:33,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2018-11-14 16:05:33,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #58#return; {655#true} is VALID [2018-11-14 16:05:33,967 INFO L256 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret5 := main(); {655#true} is VALID [2018-11-14 16:05:33,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {655#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {655#true} is VALID [2018-11-14 16:05:33,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {655#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {678#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:05:33,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {678#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {678#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:05:33,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {678#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {685#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)))) (= ((_ extract 31 0) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))))} is VALID [2018-11-14 16:05:34,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {685#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)) (= ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)))) (= ((_ extract 31 0) (bvmul main_~i~0 main_~i~0)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {689#(and (= ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset| (_ bv4 32)))) (= ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:05:34,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {689#(and (= ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset| (_ bv4 32)))) (= ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {689#(and (= ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset| (_ bv4 32)))) (= ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:05:34,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {689#(and (= ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset| (_ bv4 32)))) (= ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv18446744073709551615 64)) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv18446744073709551615 64)))) |main_~#a~0.offset|))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume true; {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} ~i~0 := ~sign_extendFrom32To64(0bv32); {709#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {709#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume true; {709#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:05:34,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {709#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) ((_ extract 63 32) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {716#(and (= (concat ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~mem4|) (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:05:34,083 INFO L256 TraceCheckUtils]: 18: Hoare triple {716#(and (= (concat ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32)))) ((_ extract 31 0) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~mem4|) (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))))} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {720#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:34,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {720#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {724#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:34,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {724#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {656#false} is VALID [2018-11-14 16:05:34,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {656#false} assume !false; {656#false} is VALID [2018-11-14 16:05:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:05:34,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:35,052 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2018-11-14 16:05:39,183 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-14 16:05:39,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:39,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:05:39,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 153 [2018-11-14 16:05:39,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:39,924 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-11-14 16:05:39,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2018-11-14 16:05:39,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:40,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2018-11-14 16:05:46,497 WARN L179 SmtUtils]: Spent 5.98 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2018-11-14 16:05:46,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,628 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,694 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-14 16:05:46,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 73 [2018-11-14 16:05:46,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:05:46,847 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,897 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:46,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:47,060 INFO L303 Elim1Store]: Index analysis took 318 ms [2018-11-14 16:05:47,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 132 [2018-11-14 16:05:47,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-14 16:05:47,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:47,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:47,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:47,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:05:47,680 INFO L303 Elim1Store]: Index analysis took 280 ms [2018-11-14 16:05:48,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 128 [2018-11-14 16:05:48,035 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-14 16:05:54,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:05:54,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:54,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:54,605 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:126, output treesize:15 [2018-11-14 16:05:56,644 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:57,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {656#false} assume !false; {656#false} is VALID [2018-11-14 16:05:57,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {656#false} is VALID [2018-11-14 16:05:57,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {738#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {734#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:05:57,958 INFO L256 TraceCheckUtils]: 18: Hoare triple {742#(= (bvmul main_~i~0 main_~i~0) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {738#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:05:57,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {746#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {742#(= (bvmul main_~i~0 main_~i~0) |main_#t~mem4|)} is VALID [2018-11-14 16:05:57,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {746#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} assume true; {746#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} is VALID [2018-11-14 16:05:57,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} ~i~0 := ~sign_extendFrom32To64(0bv32); {746#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} is VALID [2018-11-14 16:05:57,972 INFO L273 TraceCheckUtils]: 14: Hoare triple {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} is VALID [2018-11-14 16:05:57,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} assume true; {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} is VALID [2018-11-14 16:05:57,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} is VALID [2018-11-14 16:05:58,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {753#(= (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))))} is VALID [2018-11-14 16:05:58,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {766#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {766#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:00,053 INFO L273 TraceCheckUtils]: 9: Hoare triple {773#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32)) ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32)) ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {766#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32)) ((_ extract 63 32) (bvmul main_~i~0 main_~i~0))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} is UNKNOWN [2018-11-14 16:06:00,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {777#(= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {773#(= (concat (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32)) ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32)))) (_ bv4 32))) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32)) ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))))) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) ((_ sign_extend 32) (_ bv0 32))))))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:00,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {777#(= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {777#(= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:00,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {655#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {777#(= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:00,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {655#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {655#true} is VALID [2018-11-14 16:06:00,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {655#true} call #t~ret5 := main(); {655#true} is VALID [2018-11-14 16:06:00,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {655#true} {655#true} #58#return; {655#true} is VALID [2018-11-14 16:06:00,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {655#true} assume true; {655#true} is VALID [2018-11-14 16:06:00,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {655#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {655#true} is VALID [2018-11-14 16:06:00,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {655#true} call ULTIMATE.init(); {655#true} is VALID [2018-11-14 16:06:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:06:00,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:06:00,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 16:06:00,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-14 16:06:00,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:06:00,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 16:06:02,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:06:02,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 16:06:02,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 16:06:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:06:02,692 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-11-14 16:06:07,203 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-14 16:06:09,922 WARN L179 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-14 16:06:16,975 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-11-14 16:06:20,763 WARN L179 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-14 16:06:26,350 WARN L179 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-14 16:06:33,063 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2018-11-14 16:06:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:44,703 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-11-14 16:06:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:06:44,704 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-14 16:06:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:06:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:06:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2018-11-14 16:06:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:06:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2018-11-14 16:06:44,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 61 transitions. [2018-11-14 16:06:51,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 16:06:51,611 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:06:51,611 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 16:06:51,612 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:06:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 16:06:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2018-11-14 16:06:51,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:06:51,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 34 states. [2018-11-14 16:06:51,780 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 34 states. [2018-11-14 16:06:51,780 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 34 states. [2018-11-14 16:06:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:51,786 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 16:06:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 16:06:51,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:06:51,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:06:51,788 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 54 states. [2018-11-14 16:06:51,788 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 54 states. [2018-11-14 16:06:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:06:51,792 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-14 16:06:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-14 16:06:51,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:06:51,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:06:51,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:06:51,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:06:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:06:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-14 16:06:51,796 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 22 [2018-11-14 16:06:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:06:51,797 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-14 16:06:51,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 16:06:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 16:06:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:06:51,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:06:51,798 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:06:51,799 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:06:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:06:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1912729175, now seen corresponding path program 1 times [2018-11-14 16:06:51,800 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:06:51,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 16:06:51,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:06:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:06:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:06:52,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:06:52,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:52,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:52,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 97 [2018-11-14 16:06:52,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:52,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:52,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 100 [2018-11-14 16:06:52,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:52,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:52,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:52,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:53 [2018-11-14 16:06:52,795 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-14 16:06:53,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-11-14 16:06:53,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:53,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:53,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:53,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:06:53,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:53,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 107 [2018-11-14 16:06:53,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:06:53,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:53,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:06:53,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:30 [2018-11-14 16:06:53,174 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:06:53,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 16:06:53,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {1050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1050#true} is VALID [2018-11-14 16:06:53,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 16:06:53,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #58#return; {1050#true} is VALID [2018-11-14 16:06:53,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret5 := main(); {1050#true} is VALID [2018-11-14 16:06:53,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {1050#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1050#true} is VALID [2018-11-14 16:06:53,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {1050#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,452 INFO L273 TraceCheckUtils]: 9: Hoare triple {1073#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1083#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:53,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {1083#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {1083#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:53,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {1083#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := ~sign_extendFrom32To64(0bv32); {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,472 INFO L256 TraceCheckUtils]: 18: Hoare triple {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:06:53,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} ~cond := #in~cond; {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:06:53,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} assume !(~cond == 0bv32); {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:06:53,477 INFO L273 TraceCheckUtils]: 21: Hoare triple {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} assume true; {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:06:53,480 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1113#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} #62#return; {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} havoc #t~mem4; {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:06:53,490 INFO L273 TraceCheckUtils]: 24: Hoare triple {1103#(and (= main_~i~0 ((_ sign_extend 32) (_ bv0 32))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post3);havoc #t~post3; {1132#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:53,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {1132#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume true; {1132#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:53,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {1132#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1139#(and (= (concat ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) |main_#t~mem4|) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-14 16:06:53,527 INFO L256 TraceCheckUtils]: 27: Hoare triple {1139#(and (= (concat ((_ extract 63 32) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))) |main_#t~mem4|) (= (bvadd main_~i~0 (_ bv18446744073709551615 64)) ((_ sign_extend 32) (_ bv0 32))))} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {1143#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:06:53,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {1143#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1147#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:06:53,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {1147#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 16:06:53,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 16:06:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:06:53,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:06:55,749 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-14 16:06:56,998 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 16:06:57,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:57,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:06:57,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 127 [2018-11-14 16:07:00,406 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2018-11-14 16:07:00,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:00,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:00,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:00,600 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:00,952 INFO L303 Elim1Store]: Index analysis took 499 ms [2018-11-14 16:07:01,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 144 [2018-11-14 16:07:01,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:07:02,164 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-11-14 16:07:02,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-11-14 16:07:02,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:02,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:02,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:02,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:07:02,693 INFO L303 Elim1Store]: Index analysis took 484 ms [2018-11-14 16:07:03,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 132 [2018-11-14 16:07:03,114 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-14 16:07:04,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:07:04,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:07:04,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:07:04,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:38 [2018-11-14 16:07:06,915 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:07:08,274 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 16:07:09,875 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-14 16:07:10,074 INFO L273 TraceCheckUtils]: 30: Hoare triple {1051#false} assume !false; {1051#false} is VALID [2018-11-14 16:07:10,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {1157#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1051#false} is VALID [2018-11-14 16:07:10,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {1161#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1157#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:07:10,077 INFO L256 TraceCheckUtils]: 27: Hoare triple {1165#(= (bvmul main_~i~0 main_~i~0) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {1161#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:07:10,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {1169#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1165#(= (bvmul main_~i~0 main_~i~0) |main_#t~mem4|)} is VALID [2018-11-14 16:07:10,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {1169#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} assume true; {1169#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} is VALID [2018-11-14 16:07:12,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} #t~post3 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post3);havoc #t~post3; {1169#(= (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0))))) (bvmul main_~i~0 main_~i~0))} is UNKNOWN [2018-11-14 16:07:12,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} havoc #t~mem4; {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,114 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1050#true} {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} #62#return; {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 16:07:12,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {1050#true} assume !(~cond == 0bv32); {1050#true} is VALID [2018-11-14 16:07:12,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {1050#true} ~cond := #in~cond; {1050#true} is VALID [2018-11-14 16:07:12,115 INFO L256 TraceCheckUtils]: 18: Hoare triple {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} call __VERIFIER_assert((if #t~mem4 == ~bvmul64(~i~0, ~i~0) then 1bv32 else 0bv32)); {1050#true} is VALID [2018-11-14 16:07:12,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call #t~mem4 := read~intINTTYPE8(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} assume true; {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} ~i~0 := ~sign_extendFrom32To64(0bv32); {1176#(= (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} assume !~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0)); {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,117 INFO L273 TraceCheckUtils]: 13: Hoare triple {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} assume true; {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {1217#(and (= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1204#(= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))))} is VALID [2018-11-14 16:07:12,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {1217#(and (= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))} assume true; {1217#(and (= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))} is VALID [2018-11-14 16:07:12,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} #t~post2 := ~i~0;~i~0 := ~bvadd64(1bv64, #t~post2);havoc #t~post2; {1217#(and (= (concat ((_ extract 63 32) (bvmul main_~i~0 main_~i~0)) ((_ extract 31 0) (bvmul main_~i~0 main_~i~0))) (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (= (bvmul (_ bv8 32) ((_ extract 31 0) main_~i~0)) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))))))} is VALID [2018-11-14 16:07:12,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} assume !!~bvslt64(~i~0, ~sign_extendFrom32To64(~SIZE~0));call write~intINTTYPE8(~bvmul64(~i~0, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0[32:0])), 8bv32); {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} is VALID [2018-11-14 16:07:12,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} assume true; {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} is VALID [2018-11-14 16:07:12,263 INFO L273 TraceCheckUtils]: 6: Hoare triple {1050#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(8bv32, ~SIZE~0));~i~0 := ~sign_extendFrom32To64(0bv32); {1224#(and (= (bvmul (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64))) (concat ((_ extract 63 32) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))) ((_ extract 31 0) (bvmul (bvadd main_~i~0 (_ bv1 64)) (bvadd main_~i~0 (_ bv1 64)))))) (= (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd ((_ sign_extend 32) (_ bv0 32)) (_ bv1 64)))) (bvmul (_ bv8 32) ((_ extract 31 0) (bvadd main_~i~0 (_ bv1 64))))))} is VALID [2018-11-14 16:07:12,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {1050#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1050#true} is VALID [2018-11-14 16:07:12,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {1050#true} call #t~ret5 := main(); {1050#true} is VALID [2018-11-14 16:07:12,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1050#true} {1050#true} #58#return; {1050#true} is VALID [2018-11-14 16:07:12,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {1050#true} assume true; {1050#true} is VALID [2018-11-14 16:07:12,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {1050#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1050#true} is VALID [2018-11-14 16:07:12,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1050#true} call ULTIMATE.init(); {1050#true} is VALID [2018-11-14 16:07:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:07:12,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:07:12,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-14 16:07:12,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-11-14 16:07:12,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:07:12,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states.