java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:50:58,129 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:50:58,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:50:58,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:50:58,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:50:58,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:50:58,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:50:58,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:50:58,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:50:58,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:50:58,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:50:58,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:50:58,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:50:58,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:50:58,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:50:58,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:50:58,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:50:58,180 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:50:58,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:50:58,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:50:58,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:50:58,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:50:58,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:50:58,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:50:58,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:50:58,195 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:50:58,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:50:58,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:50:58,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:50:58,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:50:58,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:50:58,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:50:58,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:50:58,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:50:58,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:50:58,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:50:58,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:50:58,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:50:58,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:50:58,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:50:58,240 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:50:58,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:50:58,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:50:58,241 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:50:58,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:50:58,241 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:50:58,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:50:58,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:50:58,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:50:58,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:50:58,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:50:58,243 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:50:58,243 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:50:58,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:50:58,245 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:50:58,245 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:50:58,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:50:58,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:50:58,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:50:58,246 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:50:58,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:50:58,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:50:58,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:50:58,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:50:58,247 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:50:58,247 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:50:58,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:50:58,247 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:50:58,248 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:50:58,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:50:58,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:50:58,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:50:58,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:50:58,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:50:58,336 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:50:58,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:50:58,408 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ef27d9/eee08a2b7de847a390f6781889ac8cf6/FLAG5c9f4f052 [2018-11-14 17:50:58,858 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:50:58,859 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:50:58,865 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ef27d9/eee08a2b7de847a390f6781889ac8cf6/FLAG5c9f4f052 [2018-11-14 17:50:58,880 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93ef27d9/eee08a2b7de847a390f6781889ac8cf6 [2018-11-14 17:50:58,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:50:58,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:50:58,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:50:58,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:50:58,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:50:58,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:50:58" (1/1) ... [2018-11-14 17:50:58,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9abb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:58, skipping insertion in model container [2018-11-14 17:50:58,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:50:58" (1/1) ... [2018-11-14 17:50:58,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:50:58,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:50:59,193 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:50:59,206 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:50:59,244 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:50:59,267 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:50:59,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59 WrapperNode [2018-11-14 17:50:59,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:50:59,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:50:59,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:50:59,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:50:59,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... [2018-11-14 17:50:59,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:50:59,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:50:59,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:50:59,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:50:59,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:50:59,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:50:59,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:50:59,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:50:59,473 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-14 17:50:59,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:50:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:50:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:50:59,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:50:59,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:50:59,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:51:00,138 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:51:00,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:00 BoogieIcfgContainer [2018-11-14 17:51:00,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:51:00,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:51:00,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:51:00,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:51:00,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:50:58" (1/3) ... [2018-11-14 17:51:00,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:00, skipping insertion in model container [2018-11-14 17:51:00,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:50:59" (2/3) ... [2018-11-14 17:51:00,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4ab24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:00, skipping insertion in model container [2018-11-14 17:51:00,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:00" (3/3) ... [2018-11-14 17:51:00,148 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:51:00,156 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:51:00,164 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:51:00,181 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:51:00,216 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:51:00,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:51:00,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:51:00,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:51:00,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:51:00,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:51:00,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:51:00,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:51:00,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:51:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 17:51:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:51:00,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:00,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:00,251 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:00,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:00,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1280416473, now seen corresponding path program 1 times [2018-11-14 17:51:00,263 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:00,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:00,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:00,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 17:51:00,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-14 17:51:00,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 17:51:00,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #79#return; {39#true} is VALID [2018-11-14 17:51:00,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2018-11-14 17:51:00,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {39#true} is VALID [2018-11-14 17:51:00,790 INFO L256 TraceCheckUtils]: 6: Hoare triple {39#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {39#true} is VALID [2018-11-14 17:51:00,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {39#true} is VALID [2018-11-14 17:51:00,807 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 17:51:00,808 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:51:00,808 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #83#return; {40#false} is VALID [2018-11-14 17:51:00,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~1 := 0bv32; {40#false} is VALID [2018-11-14 17:51:00,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 17:51:00,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~1 := 0bv32; {40#false} is VALID [2018-11-14 17:51:00,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:51:00,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume !!~bvslt32(~i~1, 100000bv32); {40#false} is VALID [2018-11-14 17:51:00,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {40#false} is VALID [2018-11-14 17:51:00,814 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {40#false} is VALID [2018-11-14 17:51:00,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 17:51:00,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume ~cond == 0bv32; {40#false} is VALID [2018-11-14 17:51:00,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 17:51:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:51:00,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:00,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:00,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:51:00,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:51:00,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:00,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:51:00,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:00,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:51:00,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:51:00,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:51:00,991 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 17:51:01,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:01,106 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-14 17:51:01,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:51:01,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:51:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:51:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:51:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:51:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:51:01,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:51:01,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:01,380 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:51:01,380 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:51:01,384 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:51:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:51:01,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:51:01,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:01,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:51:01,453 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:51:01,453 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:51:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:01,458 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:51:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:51:01,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:01,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:01,460 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:51:01,460 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:51:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:01,465 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:51:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:51:01,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:01,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:01,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:01,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:51:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:51:01,473 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2018-11-14 17:51:01,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:01,473 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:51:01,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:51:01,474 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:51:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:51:01,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:01,475 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:01,475 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:01,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:01,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1572312329, now seen corresponding path program 1 times [2018-11-14 17:51:01,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:01,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:01,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:01,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:01,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {283#true} call ULTIMATE.init(); {283#true} is VALID [2018-11-14 17:51:01,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {283#true} is VALID [2018-11-14 17:51:01,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {283#true} assume true; {283#true} is VALID [2018-11-14 17:51:01,963 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {283#true} {283#true} #79#return; {283#true} is VALID [2018-11-14 17:51:01,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {283#true} call #t~ret6 := main(); {283#true} is VALID [2018-11-14 17:51:01,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {283#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {283#true} is VALID [2018-11-14 17:51:01,964 INFO L256 TraceCheckUtils]: 6: Hoare triple {283#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {283#true} is VALID [2018-11-14 17:51:01,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {309#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:01,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {309#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume true; {309#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:01,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {309#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~size); {316#(not (bvslt (_ bv0 32) |init_#in~size|))} is VALID [2018-11-14 17:51:01,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {316#(not (bvslt (_ bv0 32) |init_#in~size|))} assume true; {316#(not (bvslt (_ bv0 32) |init_#in~size|))} is VALID [2018-11-14 17:51:01,978 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {316#(not (bvslt (_ bv0 32) |init_#in~size|))} {283#true} #83#return; {284#false} is VALID [2018-11-14 17:51:01,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {284#false} ~i~1 := 0bv32; {284#false} is VALID [2018-11-14 17:51:01,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {284#false} assume true; {284#false} is VALID [2018-11-14 17:51:01,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {284#false} assume !~bvslt32(~i~1, 100000bv32); {284#false} is VALID [2018-11-14 17:51:01,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {284#false} ~i~1 := 0bv32; {284#false} is VALID [2018-11-14 17:51:01,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {284#false} assume true; {284#false} is VALID [2018-11-14 17:51:01,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {284#false} assume !!~bvslt32(~i~1, 100000bv32); {284#false} is VALID [2018-11-14 17:51:01,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {284#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {284#false} is VALID [2018-11-14 17:51:01,980 INFO L256 TraceCheckUtils]: 19: Hoare triple {284#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {284#false} is VALID [2018-11-14 17:51:01,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {284#false} ~cond := #in~cond; {284#false} is VALID [2018-11-14 17:51:01,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {284#false} assume ~cond == 0bv32; {284#false} is VALID [2018-11-14 17:51:01,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {284#false} assume !false; {284#false} is VALID [2018-11-14 17:51:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:51:01,985 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:01,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:01,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:51:01,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 17:51:01,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:01,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:51:02,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:02,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:51:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:51:02,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:51:02,112 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:51:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:02,523 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:51:02,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:51:02,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-14 17:51:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:51:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-14 17:51:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:51:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-14 17:51:02,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2018-11-14 17:51:02,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:02,657 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:51:02,658 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:51:02,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:51:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:51:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:51:02,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:02,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:51:02,683 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:51:02,683 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:51:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:02,685 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:51:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:51:02,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:02,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:02,687 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:51:02,687 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:51:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:02,690 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:51:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:51:02,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:02,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:02,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:02,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:51:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:51:02,694 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2018-11-14 17:51:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:02,695 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:51:02,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:51:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:51:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 17:51:02,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:02,697 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:02,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:02,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1581395655, now seen corresponding path program 1 times [2018-11-14 17:51:02,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:02,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:02,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:03,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-14 17:51:03,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {540#true} is VALID [2018-11-14 17:51:03,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-14 17:51:03,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #79#return; {540#true} is VALID [2018-11-14 17:51:03,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret6 := main(); {540#true} is VALID [2018-11-14 17:51:03,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {540#true} is VALID [2018-11-14 17:51:03,063 INFO L256 TraceCheckUtils]: 6: Hoare triple {540#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {540#true} is VALID [2018-11-14 17:51:03,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:03,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume true; {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:03,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:03,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {566#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {576#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:03,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {576#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:03,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {576#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~size); {583#(not (bvslt (_ bv1 32) |init_#in~size|))} is VALID [2018-11-14 17:51:03,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {583#(not (bvslt (_ bv1 32) |init_#in~size|))} assume true; {583#(not (bvslt (_ bv1 32) |init_#in~size|))} is VALID [2018-11-14 17:51:03,099 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {583#(not (bvslt (_ bv1 32) |init_#in~size|))} {540#true} #83#return; {541#false} is VALID [2018-11-14 17:51:03,099 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} ~i~1 := 0bv32; {541#false} is VALID [2018-11-14 17:51:03,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-14 17:51:03,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} assume !~bvslt32(~i~1, 100000bv32); {541#false} is VALID [2018-11-14 17:51:03,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {541#false} ~i~1 := 0bv32; {541#false} is VALID [2018-11-14 17:51:03,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-14 17:51:03,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {541#false} assume !!~bvslt32(~i~1, 100000bv32); {541#false} is VALID [2018-11-14 17:51:03,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {541#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {541#false} is VALID [2018-11-14 17:51:03,101 INFO L256 TraceCheckUtils]: 22: Hoare triple {541#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {541#false} is VALID [2018-11-14 17:51:03,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {541#false} ~cond := #in~cond; {541#false} is VALID [2018-11-14 17:51:03,102 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume ~cond == 0bv32; {541#false} is VALID [2018-11-14 17:51:03,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-14 17:51:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:51:03,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:03,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {541#false} assume !false; {541#false} is VALID [2018-11-14 17:51:03,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {541#false} assume ~cond == 0bv32; {541#false} is VALID [2018-11-14 17:51:03,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {541#false} ~cond := #in~cond; {541#false} is VALID [2018-11-14 17:51:03,357 INFO L256 TraceCheckUtils]: 22: Hoare triple {541#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {541#false} is VALID [2018-11-14 17:51:03,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {541#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {541#false} is VALID [2018-11-14 17:51:03,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {541#false} assume !!~bvslt32(~i~1, 100000bv32); {541#false} is VALID [2018-11-14 17:51:03,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-14 17:51:03,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {541#false} ~i~1 := 0bv32; {541#false} is VALID [2018-11-14 17:51:03,359 INFO L273 TraceCheckUtils]: 17: Hoare triple {541#false} assume !~bvslt32(~i~1, 100000bv32); {541#false} is VALID [2018-11-14 17:51:03,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {541#false} assume true; {541#false} is VALID [2018-11-14 17:51:03,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {541#false} ~i~1 := 0bv32; {541#false} is VALID [2018-11-14 17:51:03,364 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {659#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} {540#true} #83#return; {541#false} is VALID [2018-11-14 17:51:03,364 INFO L273 TraceCheckUtils]: 13: Hoare triple {659#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} assume true; {659#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:03,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {666#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume !~bvslt32(~i~0, ~size); {659#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:03,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {666#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume true; {666#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:03,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {666#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:03,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:03,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume true; {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:03,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {673#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:03,392 INFO L256 TraceCheckUtils]: 6: Hoare triple {540#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {540#true} is VALID [2018-11-14 17:51:03,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {540#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {540#true} is VALID [2018-11-14 17:51:03,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {540#true} call #t~ret6 := main(); {540#true} is VALID [2018-11-14 17:51:03,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {540#true} {540#true} #79#return; {540#true} is VALID [2018-11-14 17:51:03,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {540#true} assume true; {540#true} is VALID [2018-11-14 17:51:03,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {540#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {540#true} is VALID [2018-11-14 17:51:03,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {540#true} call ULTIMATE.init(); {540#true} is VALID [2018-11-14 17:51:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:51:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 17:51:03,398 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 17:51:03,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:03,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:51:03,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:03,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:51:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:51:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:51:03,536 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-14 17:51:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:04,103 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-14 17:51:04,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:51:04,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-14 17:51:04,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:51:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-14 17:51:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:51:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2018-11-14 17:51:04,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2018-11-14 17:51:04,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:04,271 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:51:04,272 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:51:04,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:51:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:51:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 17:51:04,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:04,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 17:51:04,320 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:51:04,320 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:51:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:04,323 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:51:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:51:04,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:04,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:04,325 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:51:04,325 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:51:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:04,328 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:51:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:51:04,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:04,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:04,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:04,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:51:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-14 17:51:04,332 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 26 [2018-11-14 17:51:04,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:04,333 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-14 17:51:04,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:51:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:51:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:51:04,335 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:04,335 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:04,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:04,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1518510985, now seen corresponding path program 2 times [2018-11-14 17:51:04,336 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:04,336 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:04,356 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:04,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:51:04,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:04,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:04,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {931#true} call ULTIMATE.init(); {931#true} is VALID [2018-11-14 17:51:04,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {931#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {931#true} is VALID [2018-11-14 17:51:04,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {931#true} {931#true} #79#return; {931#true} is VALID [2018-11-14 17:51:04,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {931#true} call #t~ret6 := main(); {931#true} is VALID [2018-11-14 17:51:04,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {931#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {931#true} is VALID [2018-11-14 17:51:04,489 INFO L256 TraceCheckUtils]: 6: Hoare triple {931#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {931#true} is VALID [2018-11-14 17:51:04,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {931#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {931#true} is VALID [2018-11-14 17:51:04,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {931#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#true} is VALID [2018-11-14 17:51:04,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {931#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#true} is VALID [2018-11-14 17:51:04,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#true} is VALID [2018-11-14 17:51:04,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#true} is VALID [2018-11-14 17:51:04,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,492 INFO L273 TraceCheckUtils]: 15: Hoare triple {931#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#true} is VALID [2018-11-14 17:51:04,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {931#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#true} is VALID [2018-11-14 17:51:04,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {931#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#true} is VALID [2018-11-14 17:51:04,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {931#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#true} is VALID [2018-11-14 17:51:04,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {931#true} assume !~bvslt32(~i~0, ~size); {931#true} is VALID [2018-11-14 17:51:04,494 INFO L273 TraceCheckUtils]: 22: Hoare triple {931#true} assume true; {931#true} is VALID [2018-11-14 17:51:04,494 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {931#true} {931#true} #83#return; {931#true} is VALID [2018-11-14 17:51:04,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {931#true} ~i~1 := 0bv32; {1008#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:04,513 INFO L273 TraceCheckUtils]: 25: Hoare triple {1008#(= main_~i~1 (_ bv0 32))} assume true; {1008#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:04,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {1008#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 100000bv32); {932#false} is VALID [2018-11-14 17:51:04,515 INFO L273 TraceCheckUtils]: 27: Hoare triple {932#false} ~i~1 := 0bv32; {932#false} is VALID [2018-11-14 17:51:04,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {932#false} assume true; {932#false} is VALID [2018-11-14 17:51:04,515 INFO L273 TraceCheckUtils]: 29: Hoare triple {932#false} assume !!~bvslt32(~i~1, 100000bv32); {932#false} is VALID [2018-11-14 17:51:04,515 INFO L273 TraceCheckUtils]: 30: Hoare triple {932#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {932#false} is VALID [2018-11-14 17:51:04,516 INFO L256 TraceCheckUtils]: 31: Hoare triple {932#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {932#false} is VALID [2018-11-14 17:51:04,516 INFO L273 TraceCheckUtils]: 32: Hoare triple {932#false} ~cond := #in~cond; {932#false} is VALID [2018-11-14 17:51:04,516 INFO L273 TraceCheckUtils]: 33: Hoare triple {932#false} assume ~cond == 0bv32; {932#false} is VALID [2018-11-14 17:51:04,516 INFO L273 TraceCheckUtils]: 34: Hoare triple {932#false} assume !false; {932#false} is VALID [2018-11-14 17:51:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 17:51:04,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:04,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:04,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:04,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-14 17:51:04,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:04,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:04,568 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 17:51:04,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:04,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:04,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:04,569 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2018-11-14 17:51:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:04,801 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:51:04,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:04,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-14 17:51:04,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 17:51:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 17:51:04,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-14 17:51:04,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:04,966 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:51:04,966 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 17:51:04,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 17:51:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-14 17:51:05,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:05,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 44 states. [2018-11-14 17:51:05,015 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 44 states. [2018-11-14 17:51:05,015 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 44 states. [2018-11-14 17:51:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:05,019 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-14 17:51:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 17:51:05,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:05,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:05,021 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 52 states. [2018-11-14 17:51:05,021 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 52 states. [2018-11-14 17:51:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:05,024 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-14 17:51:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-14 17:51:05,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:05,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:05,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:05,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:51:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-14 17:51:05,028 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 35 [2018-11-14 17:51:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:05,029 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-14 17:51:05,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 17:51:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:51:05,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:05,030 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:05,031 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:05,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1944603072, now seen corresponding path program 1 times [2018-11-14 17:51:05,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:05,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:51:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:05,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:05,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2018-11-14 17:51:05,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {1288#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1288#true} is VALID [2018-11-14 17:51:05,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1288#true} {1288#true} #79#return; {1288#true} is VALID [2018-11-14 17:51:05,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {1288#true} call #t~ret6 := main(); {1288#true} is VALID [2018-11-14 17:51:05,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {1288#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {1288#true} is VALID [2018-11-14 17:51:05,173 INFO L256 TraceCheckUtils]: 6: Hoare triple {1288#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {1288#true} is VALID [2018-11-14 17:51:05,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {1288#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {1288#true} is VALID [2018-11-14 17:51:05,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1288#true} is VALID [2018-11-14 17:51:05,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {1288#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1288#true} is VALID [2018-11-14 17:51:05,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {1288#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1288#true} is VALID [2018-11-14 17:51:05,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {1288#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1288#true} is VALID [2018-11-14 17:51:05,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {1288#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1288#true} is VALID [2018-11-14 17:51:05,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {1288#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1288#true} is VALID [2018-11-14 17:51:05,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {1288#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1288#true} is VALID [2018-11-14 17:51:05,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {1288#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1288#true} is VALID [2018-11-14 17:51:05,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {1288#true} assume !~bvslt32(~i~0, ~size); {1288#true} is VALID [2018-11-14 17:51:05,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,177 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1288#true} {1288#true} #83#return; {1288#true} is VALID [2018-11-14 17:51:05,178 INFO L273 TraceCheckUtils]: 24: Hoare triple {1288#true} ~i~1 := 0bv32; {1288#true} is VALID [2018-11-14 17:51:05,178 INFO L273 TraceCheckUtils]: 25: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:51:05,178 INFO L273 TraceCheckUtils]: 26: Hoare triple {1288#true} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1288#true} is VALID [2018-11-14 17:51:05,181 INFO L273 TraceCheckUtils]: 27: Hoare triple {1288#true} assume #t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1bv32; {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 100000bv32); {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~1 := 0bv32; {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 100000bv32); {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:05,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {1374#(= (bvadd main_~flag~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1289#false} is VALID [2018-11-14 17:51:05,188 INFO L256 TraceCheckUtils]: 35: Hoare triple {1289#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {1289#false} is VALID [2018-11-14 17:51:05,188 INFO L273 TraceCheckUtils]: 36: Hoare triple {1289#false} ~cond := #in~cond; {1289#false} is VALID [2018-11-14 17:51:05,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {1289#false} assume ~cond == 0bv32; {1289#false} is VALID [2018-11-14 17:51:05,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2018-11-14 17:51:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 17:51:05,193 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:05,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:05,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 17:51:05,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:05,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:05,238 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:05,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:05,239 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 3 states. [2018-11-14 17:51:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:05,363 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 17:51:05,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:05,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 17:51:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:51:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:51:05,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:51:05,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:05,469 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:51:05,469 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:51:05,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:51:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:51:05,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:05,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:51:05,550 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:51:05,550 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:51:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:05,553 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 17:51:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 17:51:05,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:05,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:05,554 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:51:05,554 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:51:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:05,557 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 17:51:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 17:51:05,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:05,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:05,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:05,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:05,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:51:05,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-11-14 17:51:05,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 39 [2018-11-14 17:51:05,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:05,561 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-11-14 17:51:05,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 17:51:05,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 17:51:05,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:05,562 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:05,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:05,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:05,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2092198786, now seen corresponding path program 1 times [2018-11-14 17:51:05,563 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:05,564 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:05,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:05,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:05,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2018-11-14 17:51:05,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1641#true} is VALID [2018-11-14 17:51:05,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-14 17:51:05,898 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #79#return; {1641#true} is VALID [2018-11-14 17:51:05,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret6 := main(); {1641#true} is VALID [2018-11-14 17:51:05,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {1641#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {1641#true} is VALID [2018-11-14 17:51:05,898 INFO L256 TraceCheckUtils]: 6: Hoare triple {1641#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {1641#true} is VALID [2018-11-14 17:51:05,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {1641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:05,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume true; {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:05,905 INFO L273 TraceCheckUtils]: 9: Hoare triple {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:05,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {1667#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {1677#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,911 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {1697#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1707#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,919 INFO L273 TraceCheckUtils]: 20: Hoare triple {1707#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume true; {1707#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:05,920 INFO L273 TraceCheckUtils]: 21: Hoare triple {1707#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~size); {1714#(not (bvslt (_ bv4 32) |init_#in~size|))} is VALID [2018-11-14 17:51:05,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {1714#(not (bvslt (_ bv4 32) |init_#in~size|))} assume true; {1714#(not (bvslt (_ bv4 32) |init_#in~size|))} is VALID [2018-11-14 17:51:05,926 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1714#(not (bvslt (_ bv4 32) |init_#in~size|))} {1641#true} #83#return; {1642#false} is VALID [2018-11-14 17:51:05,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {1642#false} ~i~1 := 0bv32; {1642#false} is VALID [2018-11-14 17:51:05,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:05,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {1642#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1642#false} is VALID [2018-11-14 17:51:05,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {1642#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {1642#false} is VALID [2018-11-14 17:51:05,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {1642#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1642#false} is VALID [2018-11-14 17:51:05,927 INFO L273 TraceCheckUtils]: 29: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:05,927 INFO L273 TraceCheckUtils]: 30: Hoare triple {1642#false} assume !~bvslt32(~i~1, 100000bv32); {1642#false} is VALID [2018-11-14 17:51:05,928 INFO L273 TraceCheckUtils]: 31: Hoare triple {1642#false} ~i~1 := 0bv32; {1642#false} is VALID [2018-11-14 17:51:05,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:05,928 INFO L273 TraceCheckUtils]: 33: Hoare triple {1642#false} assume !!~bvslt32(~i~1, 100000bv32); {1642#false} is VALID [2018-11-14 17:51:05,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {1642#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1642#false} is VALID [2018-11-14 17:51:05,929 INFO L256 TraceCheckUtils]: 35: Hoare triple {1642#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {1642#false} is VALID [2018-11-14 17:51:05,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2018-11-14 17:51:05,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {1642#false} assume ~cond == 0bv32; {1642#false} is VALID [2018-11-14 17:51:05,929 INFO L273 TraceCheckUtils]: 38: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2018-11-14 17:51:05,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:51:05,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:06,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2018-11-14 17:51:06,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {1642#false} assume ~cond == 0bv32; {1642#false} is VALID [2018-11-14 17:51:06,439 INFO L273 TraceCheckUtils]: 36: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2018-11-14 17:51:06,439 INFO L256 TraceCheckUtils]: 35: Hoare triple {1642#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {1642#false} is VALID [2018-11-14 17:51:06,439 INFO L273 TraceCheckUtils]: 34: Hoare triple {1642#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1642#false} is VALID [2018-11-14 17:51:06,439 INFO L273 TraceCheckUtils]: 33: Hoare triple {1642#false} assume !!~bvslt32(~i~1, 100000bv32); {1642#false} is VALID [2018-11-14 17:51:06,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:06,440 INFO L273 TraceCheckUtils]: 31: Hoare triple {1642#false} ~i~1 := 0bv32; {1642#false} is VALID [2018-11-14 17:51:06,440 INFO L273 TraceCheckUtils]: 30: Hoare triple {1642#false} assume !~bvslt32(~i~1, 100000bv32); {1642#false} is VALID [2018-11-14 17:51:06,440 INFO L273 TraceCheckUtils]: 29: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:06,441 INFO L273 TraceCheckUtils]: 28: Hoare triple {1642#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1642#false} is VALID [2018-11-14 17:51:06,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {1642#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {1642#false} is VALID [2018-11-14 17:51:06,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {1642#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {1642#false} is VALID [2018-11-14 17:51:06,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {1642#false} assume true; {1642#false} is VALID [2018-11-14 17:51:06,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {1642#false} ~i~1 := 0bv32; {1642#false} is VALID [2018-11-14 17:51:06,474 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1814#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} {1641#true} #83#return; {1642#false} is VALID [2018-11-14 17:51:06,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {1814#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} assume true; {1814#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:06,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {1821#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume !~bvslt32(~i~0, ~size); {1814#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:06,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {1821#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume true; {1821#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:06,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1821#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:06,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:06,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume true; {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:06,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:06,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:06,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume true; {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:06,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:06,559 INFO L273 TraceCheckUtils]: 12: Hoare triple {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:06,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume true; {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:06,586 INFO L273 TraceCheckUtils]: 10: Hoare triple {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:06,587 INFO L273 TraceCheckUtils]: 9: Hoare triple {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:06,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume true; {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:06,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {1641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {1858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:06,588 INFO L256 TraceCheckUtils]: 6: Hoare triple {1641#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {1641#true} is VALID [2018-11-14 17:51:06,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {1641#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {1641#true} is VALID [2018-11-14 17:51:06,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret6 := main(); {1641#true} is VALID [2018-11-14 17:51:06,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #79#return; {1641#true} is VALID [2018-11-14 17:51:06,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-14 17:51:06,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1641#true} is VALID [2018-11-14 17:51:06,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2018-11-14 17:51:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:51:06,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:06,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 17:51:06,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-14 17:51:06,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:06,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:51:06,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:06,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:51:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:51:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:51:06,829 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 14 states. [2018-11-14 17:51:08,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:08,512 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2018-11-14 17:51:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:51:08,513 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-14 17:51:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:51:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2018-11-14 17:51:08,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:51:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2018-11-14 17:51:08,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 93 transitions. [2018-11-14 17:51:09,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:09,341 INFO L225 Difference]: With dead ends: 86 [2018-11-14 17:51:09,341 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 17:51:09,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:51:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 17:51:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 17:51:09,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:09,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 17:51:09,369 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 17:51:09,369 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 17:51:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:09,372 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-14 17:51:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 17:51:09,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:09,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:09,373 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 17:51:09,373 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 17:51:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:09,375 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-14 17:51:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 17:51:09,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:09,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:09,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:09,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:51:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-14 17:51:09,379 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 39 [2018-11-14 17:51:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:09,379 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-14 17:51:09,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:51:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-14 17:51:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 17:51:09,381 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:09,381 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:09,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:09,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -288020802, now seen corresponding path program 2 times [2018-11-14 17:51:09,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:09,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:09,399 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:09,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:51:09,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:09,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:10,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {2219#true} call ULTIMATE.init(); {2219#true} is VALID [2018-11-14 17:51:10,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {2219#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2219#true} is VALID [2018-11-14 17:51:10,293 INFO L273 TraceCheckUtils]: 2: Hoare triple {2219#true} assume true; {2219#true} is VALID [2018-11-14 17:51:10,293 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2219#true} {2219#true} #79#return; {2219#true} is VALID [2018-11-14 17:51:10,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {2219#true} call #t~ret6 := main(); {2219#true} is VALID [2018-11-14 17:51:10,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {2219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {2219#true} is VALID [2018-11-14 17:51:10,294 INFO L256 TraceCheckUtils]: 6: Hoare triple {2219#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {2219#true} is VALID [2018-11-14 17:51:10,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {2219#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:10,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume true; {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:10,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:10,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {2245#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {2255#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} is VALID [2018-11-14 17:51:10,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} assume true; {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} is VALID [2018-11-14 17:51:10,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} is VALID [2018-11-14 17:51:10,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {2265#(and (= |init_#in~size| init_~size) (= (_ bv2 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {2275#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} is VALID [2018-11-14 17:51:10,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} assume true; {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} is VALID [2018-11-14 17:51:10,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} is VALID [2018-11-14 17:51:10,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {2285#(and (= |init_#in~size| init_~size) (= (_ bv4 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {2295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} is VALID [2018-11-14 17:51:10,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} assume true; {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} is VALID [2018-11-14 17:51:10,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} is VALID [2018-11-14 17:51:10,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {2305#(and (= |init_#in~size| init_~size) (= (_ bv6 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume true; {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,324 INFO L273 TraceCheckUtils]: 31: Hoare triple {2315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} is VALID [2018-11-14 17:51:10,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} assume true; {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} is VALID [2018-11-14 17:51:10,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} is VALID [2018-11-14 17:51:10,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {2325#(and (= |init_#in~size| init_~size) (= (_ bv8 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:10,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} assume true; {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:10,329 INFO L273 TraceCheckUtils]: 36: Hoare triple {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:10,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {2335#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {2345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} assume true; {2345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:10,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {2345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~size); {2352#(not (bvslt (_ bv10 32) |init_#in~size|))} is VALID [2018-11-14 17:51:10,332 INFO L273 TraceCheckUtils]: 40: Hoare triple {2352#(not (bvslt (_ bv10 32) |init_#in~size|))} assume true; {2352#(not (bvslt (_ bv10 32) |init_#in~size|))} is VALID [2018-11-14 17:51:10,333 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2352#(not (bvslt (_ bv10 32) |init_#in~size|))} {2219#true} #83#return; {2220#false} is VALID [2018-11-14 17:51:10,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {2220#false} ~i~1 := 0bv32; {2220#false} is VALID [2018-11-14 17:51:10,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:10,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {2220#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {2220#false} is VALID [2018-11-14 17:51:10,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {2220#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {2220#false} is VALID [2018-11-14 17:51:10,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {2220#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2220#false} is VALID [2018-11-14 17:51:10,335 INFO L273 TraceCheckUtils]: 47: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:10,335 INFO L273 TraceCheckUtils]: 48: Hoare triple {2220#false} assume !~bvslt32(~i~1, 100000bv32); {2220#false} is VALID [2018-11-14 17:51:10,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {2220#false} ~i~1 := 0bv32; {2220#false} is VALID [2018-11-14 17:51:10,336 INFO L273 TraceCheckUtils]: 50: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:10,336 INFO L273 TraceCheckUtils]: 51: Hoare triple {2220#false} assume !!~bvslt32(~i~1, 100000bv32); {2220#false} is VALID [2018-11-14 17:51:10,336 INFO L273 TraceCheckUtils]: 52: Hoare triple {2220#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {2220#false} is VALID [2018-11-14 17:51:10,336 INFO L256 TraceCheckUtils]: 53: Hoare triple {2220#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {2220#false} is VALID [2018-11-14 17:51:10,337 INFO L273 TraceCheckUtils]: 54: Hoare triple {2220#false} ~cond := #in~cond; {2220#false} is VALID [2018-11-14 17:51:10,337 INFO L273 TraceCheckUtils]: 55: Hoare triple {2220#false} assume ~cond == 0bv32; {2220#false} is VALID [2018-11-14 17:51:10,337 INFO L273 TraceCheckUtils]: 56: Hoare triple {2220#false} assume !false; {2220#false} is VALID [2018-11-14 17:51:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:51:10,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:10,501 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 17:51:11,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {2220#false} assume !false; {2220#false} is VALID [2018-11-14 17:51:11,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {2220#false} assume ~cond == 0bv32; {2220#false} is VALID [2018-11-14 17:51:11,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {2220#false} ~cond := #in~cond; {2220#false} is VALID [2018-11-14 17:51:11,631 INFO L256 TraceCheckUtils]: 53: Hoare triple {2220#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {2220#false} is VALID [2018-11-14 17:51:11,631 INFO L273 TraceCheckUtils]: 52: Hoare triple {2220#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {2220#false} is VALID [2018-11-14 17:51:11,631 INFO L273 TraceCheckUtils]: 51: Hoare triple {2220#false} assume !!~bvslt32(~i~1, 100000bv32); {2220#false} is VALID [2018-11-14 17:51:11,631 INFO L273 TraceCheckUtils]: 50: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:11,631 INFO L273 TraceCheckUtils]: 49: Hoare triple {2220#false} ~i~1 := 0bv32; {2220#false} is VALID [2018-11-14 17:51:11,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {2220#false} assume !~bvslt32(~i~1, 100000bv32); {2220#false} is VALID [2018-11-14 17:51:11,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:11,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {2220#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2220#false} is VALID [2018-11-14 17:51:11,632 INFO L273 TraceCheckUtils]: 45: Hoare triple {2220#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {2220#false} is VALID [2018-11-14 17:51:11,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {2220#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {2220#false} is VALID [2018-11-14 17:51:11,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {2220#false} assume true; {2220#false} is VALID [2018-11-14 17:51:11,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {2220#false} ~i~1 := 0bv32; {2220#false} is VALID [2018-11-14 17:51:11,634 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {2452#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} {2219#true} #83#return; {2220#false} is VALID [2018-11-14 17:51:11,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {2452#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} assume true; {2452#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:11,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {2459#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume !~bvslt32(~i~0, ~size); {2452#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:11,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {2459#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume true; {2459#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:11,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2459#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:11,655 INFO L273 TraceCheckUtils]: 36: Hoare triple {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:11,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume true; {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:11,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2466#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:11,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:11,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume true; {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:11,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2476#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:11,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:11,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume true; {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:11,732 INFO L273 TraceCheckUtils]: 28: Hoare triple {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2486#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:11,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:11,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume true; {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:11,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2496#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:11,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:11,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} assume true; {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:11,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2506#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:11,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:11,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} assume true; {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:11,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2516#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:11,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:11,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume true; {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:11,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2526#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:11,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:11,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} assume true; {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:11,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2536#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:11,882 INFO L273 TraceCheckUtils]: 12: Hoare triple {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:11,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} assume true; {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:11,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2546#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:11,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:11,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} assume true; {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:11,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {2219#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {2556#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:11,917 INFO L256 TraceCheckUtils]: 6: Hoare triple {2219#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {2219#true} is VALID [2018-11-14 17:51:11,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {2219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {2219#true} is VALID [2018-11-14 17:51:11,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {2219#true} call #t~ret6 := main(); {2219#true} is VALID [2018-11-14 17:51:11,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2219#true} {2219#true} #79#return; {2219#true} is VALID [2018-11-14 17:51:11,917 INFO L273 TraceCheckUtils]: 2: Hoare triple {2219#true} assume true; {2219#true} is VALID [2018-11-14 17:51:11,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {2219#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2219#true} is VALID [2018-11-14 17:51:11,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {2219#true} call ULTIMATE.init(); {2219#true} is VALID [2018-11-14 17:51:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:51:11,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:11,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 17:51:11,943 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-14 17:51:11,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:11,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:51:12,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:12,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:51:12,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:51:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:51:12,366 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 26 states. [2018-11-14 17:51:15,040 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 17:51:15,489 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 17:51:15,885 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 17:51:16,304 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 17:51:16,730 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-14 17:51:17,022 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-14 17:51:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:18,518 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2018-11-14 17:51:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:51:18,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-11-14 17:51:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:51:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2018-11-14 17:51:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:51:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 135 transitions. [2018-11-14 17:51:18,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 135 transitions. [2018-11-14 17:51:23,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:23,998 INFO L225 Difference]: With dead ends: 122 [2018-11-14 17:51:23,998 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 17:51:23,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 17:51:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 17:51:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-11-14 17:51:24,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:24,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2018-11-14 17:51:24,118 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-14 17:51:24,118 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-14 17:51:24,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:24,121 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-14 17:51:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 17:51:24,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:24,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:24,122 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2018-11-14 17:51:24,122 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2018-11-14 17:51:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:24,126 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-11-14 17:51:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 17:51:24,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:24,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:24,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:24,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 17:51:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-14 17:51:24,130 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 57 [2018-11-14 17:51:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:24,131 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-14 17:51:24,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:51:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 17:51:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 17:51:24,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:24,132 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:24,133 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:24,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1007950654, now seen corresponding path program 3 times [2018-11-14 17:51:24,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:24,154 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:51:24,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:51:24,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:24,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:24,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:51:24,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:51:24,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #79#return; {3097#true} is VALID [2018-11-14 17:51:24,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret6 := main(); {3097#true} is VALID [2018-11-14 17:51:24,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:51:24,429 INFO L256 TraceCheckUtils]: 6: Hoare triple {3097#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {3097#true} is VALID [2018-11-14 17:51:24,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:51:24,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,431 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,431 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,435 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,435 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,436 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,436 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,436 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,437 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,438 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,438 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,438 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,439 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,439 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,439 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,440 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,440 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,440 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,440 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,440 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,441 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,441 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,442 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,442 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,442 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,443 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,443 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,443 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,443 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,444 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,444 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,444 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,444 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,444 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,445 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,445 INFO L273 TraceCheckUtils]: 74: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,445 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} assume !~bvslt32(~i~0, ~size); {3097#true} is VALID [2018-11-14 17:51:24,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,445 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {3097#true} {3097#true} #83#return; {3097#true} is VALID [2018-11-14 17:51:24,461 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} ~i~1 := 0bv32; {3336#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:24,464 INFO L273 TraceCheckUtils]: 79: Hoare triple {3336#(= main_~i~1 (_ bv0 32))} assume true; {3336#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:24,464 INFO L273 TraceCheckUtils]: 80: Hoare triple {3336#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {3336#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:24,466 INFO L273 TraceCheckUtils]: 81: Hoare triple {3336#(= main_~i~1 (_ bv0 32))} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {3336#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-14 17:51:24,466 INFO L273 TraceCheckUtils]: 82: Hoare triple {3336#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3349#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:24,468 INFO L273 TraceCheckUtils]: 83: Hoare triple {3349#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3349#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:24,468 INFO L273 TraceCheckUtils]: 84: Hoare triple {3349#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 100000bv32); {3098#false} is VALID [2018-11-14 17:51:24,469 INFO L273 TraceCheckUtils]: 85: Hoare triple {3098#false} ~i~1 := 0bv32; {3098#false} is VALID [2018-11-14 17:51:24,469 INFO L273 TraceCheckUtils]: 86: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:51:24,469 INFO L273 TraceCheckUtils]: 87: Hoare triple {3098#false} assume !!~bvslt32(~i~1, 100000bv32); {3098#false} is VALID [2018-11-14 17:51:24,469 INFO L273 TraceCheckUtils]: 88: Hoare triple {3098#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {3098#false} is VALID [2018-11-14 17:51:24,470 INFO L256 TraceCheckUtils]: 89: Hoare triple {3098#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {3098#false} is VALID [2018-11-14 17:51:24,470 INFO L273 TraceCheckUtils]: 90: Hoare triple {3098#false} ~cond := #in~cond; {3098#false} is VALID [2018-11-14 17:51:24,470 INFO L273 TraceCheckUtils]: 91: Hoare triple {3098#false} assume ~cond == 0bv32; {3098#false} is VALID [2018-11-14 17:51:24,470 INFO L273 TraceCheckUtils]: 92: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:51:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 17:51:24,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:24,590 INFO L273 TraceCheckUtils]: 92: Hoare triple {3098#false} assume !false; {3098#false} is VALID [2018-11-14 17:51:24,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {3098#false} assume ~cond == 0bv32; {3098#false} is VALID [2018-11-14 17:51:24,591 INFO L273 TraceCheckUtils]: 90: Hoare triple {3098#false} ~cond := #in~cond; {3098#false} is VALID [2018-11-14 17:51:24,591 INFO L256 TraceCheckUtils]: 89: Hoare triple {3098#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {3098#false} is VALID [2018-11-14 17:51:24,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {3098#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {3098#false} is VALID [2018-11-14 17:51:24,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {3098#false} assume !!~bvslt32(~i~1, 100000bv32); {3098#false} is VALID [2018-11-14 17:51:24,592 INFO L273 TraceCheckUtils]: 86: Hoare triple {3098#false} assume true; {3098#false} is VALID [2018-11-14 17:51:24,593 INFO L273 TraceCheckUtils]: 85: Hoare triple {3098#false} ~i~1 := 0bv32; {3098#false} is VALID [2018-11-14 17:51:24,593 INFO L273 TraceCheckUtils]: 84: Hoare triple {3404#(bvslt main_~i~1 (_ bv100000 32))} assume !~bvslt32(~i~1, 100000bv32); {3098#false} is VALID [2018-11-14 17:51:24,594 INFO L273 TraceCheckUtils]: 83: Hoare triple {3404#(bvslt main_~i~1 (_ bv100000 32))} assume true; {3404#(bvslt main_~i~1 (_ bv100000 32))} is VALID [2018-11-14 17:51:24,594 INFO L273 TraceCheckUtils]: 82: Hoare triple {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3404#(bvslt main_~i~1 (_ bv100000 32))} is VALID [2018-11-14 17:51:24,595 INFO L273 TraceCheckUtils]: 81: Hoare triple {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:51:24,595 INFO L273 TraceCheckUtils]: 80: Hoare triple {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:51:24,595 INFO L273 TraceCheckUtils]: 79: Hoare triple {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} assume true; {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:51:24,596 INFO L273 TraceCheckUtils]: 78: Hoare triple {3097#true} ~i~1 := 0bv32; {3411#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:51:24,596 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {3097#true} {3097#true} #83#return; {3097#true} is VALID [2018-11-14 17:51:24,596 INFO L273 TraceCheckUtils]: 76: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,596 INFO L273 TraceCheckUtils]: 75: Hoare triple {3097#true} assume !~bvslt32(~i~0, ~size); {3097#true} is VALID [2018-11-14 17:51:24,597 INFO L273 TraceCheckUtils]: 74: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,597 INFO L273 TraceCheckUtils]: 73: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,598 INFO L273 TraceCheckUtils]: 71: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,598 INFO L273 TraceCheckUtils]: 70: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,598 INFO L273 TraceCheckUtils]: 69: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,598 INFO L273 TraceCheckUtils]: 68: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,599 INFO L273 TraceCheckUtils]: 67: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,599 INFO L273 TraceCheckUtils]: 66: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,599 INFO L273 TraceCheckUtils]: 65: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,599 INFO L273 TraceCheckUtils]: 64: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 63: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 62: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 61: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 60: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 58: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 56: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 52: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 50: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,602 INFO L273 TraceCheckUtils]: 45: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 44: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,603 INFO L273 TraceCheckUtils]: 39: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,605 INFO L273 TraceCheckUtils]: 32: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,605 INFO L273 TraceCheckUtils]: 31: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,605 INFO L273 TraceCheckUtils]: 30: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,606 INFO L273 TraceCheckUtils]: 29: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,609 INFO L273 TraceCheckUtils]: 15: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {3097#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3097#true} is VALID [2018-11-14 17:51:24,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {3097#true} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3097#true} is VALID [2018-11-14 17:51:24,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {3097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:51:24,611 INFO L256 TraceCheckUtils]: 6: Hoare triple {3097#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {3097#true} is VALID [2018-11-14 17:51:24,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {3097#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {3097#true} is VALID [2018-11-14 17:51:24,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {3097#true} call #t~ret6 := main(); {3097#true} is VALID [2018-11-14 17:51:24,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3097#true} {3097#true} #79#return; {3097#true} is VALID [2018-11-14 17:51:24,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {3097#true} assume true; {3097#true} is VALID [2018-11-14 17:51:24,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {3097#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3097#true} is VALID [2018-11-14 17:51:24,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {3097#true} call ULTIMATE.init(); {3097#true} is VALID [2018-11-14 17:51:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 17:51:24,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:24,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:51:24,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-14 17:51:24,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:24,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:51:24,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:24,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:51:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:51:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:51:24,684 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 6 states. [2018-11-14 17:51:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:25,143 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-11-14 17:51:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:51:25,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-11-14 17:51:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2018-11-14 17:51:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2018-11-14 17:51:25,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2018-11-14 17:51:25,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:25,287 INFO L225 Difference]: With dead ends: 143 [2018-11-14 17:51:25,288 INFO L226 Difference]: Without dead ends: 130 [2018-11-14 17:51:25,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:51:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-14 17:51:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 110. [2018-11-14 17:51:25,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:25,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand 110 states. [2018-11-14 17:51:25,624 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 110 states. [2018-11-14 17:51:25,624 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 110 states. [2018-11-14 17:51:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:25,629 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:51:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-11-14 17:51:25,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:25,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:25,630 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 130 states. [2018-11-14 17:51:25,630 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 130 states. [2018-11-14 17:51:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:25,635 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:51:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-11-14 17:51:25,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:25,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:25,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:25,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 17:51:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-11-14 17:51:25,640 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 93 [2018-11-14 17:51:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:25,641 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-11-14 17:51:25,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:51:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-11-14 17:51:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 17:51:25,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:25,642 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:25,642 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:25,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 567901779, now seen corresponding path program 4 times [2018-11-14 17:51:25,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:25,644 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:25,678 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:51:25,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:51:25,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:26,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:27,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {4259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {4259#true} assume true; {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4259#true} {4259#true} #79#return; {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {4259#true} call #t~ret6 := main(); {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {4259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {4259#true} is VALID [2018-11-14 17:51:27,460 INFO L256 TraceCheckUtils]: 6: Hoare triple {4259#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {4259#true} is VALID [2018-11-14 17:51:27,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {4259#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:27,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume true; {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:27,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:51:27,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {4285#(and (= |init_#in~size| init_~size) (= init_~i~0 (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {4295#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume true; {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {4305#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {4315#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume true; {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {4325#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967292 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {4335#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} assume true; {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {4345#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967290 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} is VALID [2018-11-14 17:51:27,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} assume true; {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} is VALID [2018-11-14 17:51:27,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} is VALID [2018-11-14 17:51:27,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {4355#(and (= |init_#in~size| init_~size) (= (_ bv7 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} assume true; {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {4365#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967288 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} assume true; {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {4375#(and (= (bvadd init_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} assume true; {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {4385#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967286 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} is VALID [2018-11-14 17:51:27,490 INFO L273 TraceCheckUtils]: 41: Hoare triple {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} assume true; {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} is VALID [2018-11-14 17:51:27,491 INFO L273 TraceCheckUtils]: 42: Hoare triple {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} is VALID [2018-11-14 17:51:27,491 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#(and (= |init_#in~size| init_~size) (= (_ bv11 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,492 INFO L273 TraceCheckUtils]: 44: Hoare triple {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} assume true; {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,493 INFO L273 TraceCheckUtils]: 45: Hoare triple {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,494 INFO L273 TraceCheckUtils]: 46: Hoare triple {4405#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967284 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} is VALID [2018-11-14 17:51:27,495 INFO L273 TraceCheckUtils]: 47: Hoare triple {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} assume true; {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} is VALID [2018-11-14 17:51:27,496 INFO L273 TraceCheckUtils]: 48: Hoare triple {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} is VALID [2018-11-14 17:51:27,497 INFO L273 TraceCheckUtils]: 49: Hoare triple {4415#(and (= |init_#in~size| init_~size) (= (_ bv13 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,498 INFO L273 TraceCheckUtils]: 50: Hoare triple {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} assume true; {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,499 INFO L273 TraceCheckUtils]: 51: Hoare triple {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {4425#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967282 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} is VALID [2018-11-14 17:51:27,500 INFO L273 TraceCheckUtils]: 53: Hoare triple {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} assume true; {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} is VALID [2018-11-14 17:51:27,501 INFO L273 TraceCheckUtils]: 54: Hoare triple {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} is VALID [2018-11-14 17:51:27,502 INFO L273 TraceCheckUtils]: 55: Hoare triple {4435#(and (= |init_#in~size| init_~size) (= (_ bv15 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,503 INFO L273 TraceCheckUtils]: 56: Hoare triple {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} assume true; {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,504 INFO L273 TraceCheckUtils]: 57: Hoare triple {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,505 INFO L273 TraceCheckUtils]: 58: Hoare triple {4445#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967280 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} is VALID [2018-11-14 17:51:27,506 INFO L273 TraceCheckUtils]: 59: Hoare triple {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} assume true; {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} is VALID [2018-11-14 17:51:27,507 INFO L273 TraceCheckUtils]: 60: Hoare triple {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} is VALID [2018-11-14 17:51:27,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {4455#(and (= |init_#in~size| init_~size) (= (_ bv17 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,508 INFO L273 TraceCheckUtils]: 62: Hoare triple {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} assume true; {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {4465#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967278 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,511 INFO L273 TraceCheckUtils]: 65: Hoare triple {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} assume true; {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,512 INFO L273 TraceCheckUtils]: 66: Hoare triple {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} is VALID [2018-11-14 17:51:27,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {4475#(and (= (_ bv19 32) init_~i~0) (= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,514 INFO L273 TraceCheckUtils]: 68: Hoare triple {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} assume true; {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,515 INFO L273 TraceCheckUtils]: 69: Hoare triple {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,516 INFO L273 TraceCheckUtils]: 70: Hoare triple {4485#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967276 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} is VALID [2018-11-14 17:51:27,517 INFO L273 TraceCheckUtils]: 71: Hoare triple {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} assume true; {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} is VALID [2018-11-14 17:51:27,518 INFO L273 TraceCheckUtils]: 72: Hoare triple {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} is VALID [2018-11-14 17:51:27,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {4495#(and (= |init_#in~size| init_~size) (= (_ bv21 32) init_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4505#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,519 INFO L273 TraceCheckUtils]: 74: Hoare triple {4505#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} assume true; {4505#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:27,520 INFO L273 TraceCheckUtils]: 75: Hoare triple {4505#(and (= |init_#in~size| init_~size) (= (bvadd init_~i~0 (_ bv4294967274 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~size); {4512#(not (bvslt (_ bv22 32) |init_#in~size|))} is VALID [2018-11-14 17:51:27,520 INFO L273 TraceCheckUtils]: 76: Hoare triple {4512#(not (bvslt (_ bv22 32) |init_#in~size|))} assume true; {4512#(not (bvslt (_ bv22 32) |init_#in~size|))} is VALID [2018-11-14 17:51:27,522 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {4512#(not (bvslt (_ bv22 32) |init_#in~size|))} {4259#true} #83#return; {4260#false} is VALID [2018-11-14 17:51:27,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {4260#false} ~i~1 := 0bv32; {4260#false} is VALID [2018-11-14 17:51:27,522 INFO L273 TraceCheckUtils]: 79: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,522 INFO L273 TraceCheckUtils]: 80: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:27,522 INFO L273 TraceCheckUtils]: 81: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:27,523 INFO L273 TraceCheckUtils]: 82: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:27,523 INFO L273 TraceCheckUtils]: 83: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,523 INFO L273 TraceCheckUtils]: 84: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:27,523 INFO L273 TraceCheckUtils]: 85: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:27,524 INFO L273 TraceCheckUtils]: 86: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:27,524 INFO L273 TraceCheckUtils]: 87: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,524 INFO L273 TraceCheckUtils]: 88: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:27,524 INFO L273 TraceCheckUtils]: 89: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:27,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 91: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 92: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 93: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 94: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 95: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 96: Hoare triple {4260#false} assume !~bvslt32(~i~1, 100000bv32); {4260#false} is VALID [2018-11-14 17:51:27,525 INFO L273 TraceCheckUtils]: 97: Hoare triple {4260#false} ~i~1 := 0bv32; {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 98: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 99: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32); {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 100: Hoare triple {4260#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L256 TraceCheckUtils]: 101: Hoare triple {4260#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 102: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 103: Hoare triple {4260#false} assume ~cond == 0bv32; {4260#false} is VALID [2018-11-14 17:51:27,526 INFO L273 TraceCheckUtils]: 104: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2018-11-14 17:51:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 17:51:27,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:27,866 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-14 17:51:30,774 INFO L273 TraceCheckUtils]: 104: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2018-11-14 17:51:30,774 INFO L273 TraceCheckUtils]: 103: Hoare triple {4260#false} assume ~cond == 0bv32; {4260#false} is VALID [2018-11-14 17:51:30,774 INFO L273 TraceCheckUtils]: 102: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2018-11-14 17:51:30,774 INFO L256 TraceCheckUtils]: 101: Hoare triple {4260#false} call __VERIFIER_assert((if #t~mem5.base == 0bv32 && #t~mem5.offset == 0bv32 then 1bv32 else 0bv32)); {4260#false} is VALID [2018-11-14 17:51:30,774 INFO L273 TraceCheckUtils]: 100: Hoare triple {4260#false} assume ~flag~0 == 0bv32;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 99: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32); {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 98: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 97: Hoare triple {4260#false} ~i~1 := 0bv32; {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 96: Hoare triple {4260#false} assume !~bvslt32(~i~1, 100000bv32); {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 95: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 94: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:30,775 INFO L273 TraceCheckUtils]: 93: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:30,776 INFO L273 TraceCheckUtils]: 92: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:30,776 INFO L273 TraceCheckUtils]: 91: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,776 INFO L273 TraceCheckUtils]: 90: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:30,776 INFO L273 TraceCheckUtils]: 89: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:30,776 INFO L273 TraceCheckUtils]: 88: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 87: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 86: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 85: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 84: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 83: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,777 INFO L273 TraceCheckUtils]: 82: Hoare triple {4260#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4260#false} is VALID [2018-11-14 17:51:30,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {4260#false} assume !(#t~mem3.base != 0bv32 || #t~mem3.offset != 0bv32);havoc #t~mem3.base, #t~mem3.offset; {4260#false} is VALID [2018-11-14 17:51:30,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {4260#false} assume !!~bvslt32(~i~1, 100000bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32); {4260#false} is VALID [2018-11-14 17:51:30,778 INFO L273 TraceCheckUtils]: 79: Hoare triple {4260#false} assume true; {4260#false} is VALID [2018-11-14 17:51:30,778 INFO L273 TraceCheckUtils]: 78: Hoare triple {4260#false} ~i~1 := 0bv32; {4260#false} is VALID [2018-11-14 17:51:30,794 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {4684#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} {4259#true} #83#return; {4260#false} is VALID [2018-11-14 17:51:30,803 INFO L273 TraceCheckUtils]: 76: Hoare triple {4684#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} assume true; {4684#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:30,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {4691#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume !~bvslt32(~i~0, ~size); {4684#(not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32)))} is VALID [2018-11-14 17:51:30,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {4691#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} assume true; {4691#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:30,831 INFO L273 TraceCheckUtils]: 73: Hoare triple {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4691#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt init_~i~0 init_~size))} is VALID [2018-11-14 17:51:30,831 INFO L273 TraceCheckUtils]: 72: Hoare triple {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:30,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} assume true; {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:30,863 INFO L273 TraceCheckUtils]: 70: Hoare triple {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4698#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv1 32)) init_~size))} is VALID [2018-11-14 17:51:30,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:30,864 INFO L273 TraceCheckUtils]: 68: Hoare triple {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} assume true; {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:30,889 INFO L273 TraceCheckUtils]: 67: Hoare triple {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4708#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv2 32)) init_~size))} is VALID [2018-11-14 17:51:30,889 INFO L273 TraceCheckUtils]: 66: Hoare triple {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:30,890 INFO L273 TraceCheckUtils]: 65: Hoare triple {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} assume true; {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:30,911 INFO L273 TraceCheckUtils]: 64: Hoare triple {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4718#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv3 32)) init_~size))} is VALID [2018-11-14 17:51:30,911 INFO L273 TraceCheckUtils]: 63: Hoare triple {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:30,912 INFO L273 TraceCheckUtils]: 62: Hoare triple {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} assume true; {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:30,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4728#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv4 32)) init_~size))} is VALID [2018-11-14 17:51:30,943 INFO L273 TraceCheckUtils]: 60: Hoare triple {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:30,943 INFO L273 TraceCheckUtils]: 59: Hoare triple {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} assume true; {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:30,972 INFO L273 TraceCheckUtils]: 58: Hoare triple {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4738#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv5 32)) init_~size))} is VALID [2018-11-14 17:51:30,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:30,973 INFO L273 TraceCheckUtils]: 56: Hoare triple {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} assume true; {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:31,003 INFO L273 TraceCheckUtils]: 55: Hoare triple {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4748#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv6 32)) init_~size))} is VALID [2018-11-14 17:51:31,004 INFO L273 TraceCheckUtils]: 54: Hoare triple {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,004 INFO L273 TraceCheckUtils]: 53: Hoare triple {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume true; {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,025 INFO L273 TraceCheckUtils]: 52: Hoare triple {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4758#(or (bvslt (bvadd init_~i~0 (_ bv7 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,026 INFO L273 TraceCheckUtils]: 51: Hoare triple {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:31,026 INFO L273 TraceCheckUtils]: 50: Hoare triple {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} assume true; {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:31,056 INFO L273 TraceCheckUtils]: 49: Hoare triple {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4768#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv8 32)) init_~size))} is VALID [2018-11-14 17:51:31,056 INFO L273 TraceCheckUtils]: 48: Hoare triple {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:31,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} assume true; {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:31,087 INFO L273 TraceCheckUtils]: 46: Hoare triple {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4778#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv9 32)) init_~size))} is VALID [2018-11-14 17:51:31,087 INFO L273 TraceCheckUtils]: 45: Hoare triple {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:31,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} assume true; {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:31,113 INFO L273 TraceCheckUtils]: 43: Hoare triple {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4788#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv10 32)) init_~size))} is VALID [2018-11-14 17:51:31,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} is VALID [2018-11-14 17:51:31,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} assume true; {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} is VALID [2018-11-14 17:51:31,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4798#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv11 32)) init_~size))} is VALID [2018-11-14 17:51:31,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} is VALID [2018-11-14 17:51:31,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} assume true; {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} is VALID [2018-11-14 17:51:31,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4808#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv12 32)) init_~size))} is VALID [2018-11-14 17:51:31,173 INFO L273 TraceCheckUtils]: 36: Hoare triple {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} is VALID [2018-11-14 17:51:31,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} assume true; {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} is VALID [2018-11-14 17:51:31,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4818#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv13 32)) init_~size))} is VALID [2018-11-14 17:51:31,200 INFO L273 TraceCheckUtils]: 33: Hoare triple {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} is VALID [2018-11-14 17:51:31,200 INFO L273 TraceCheckUtils]: 32: Hoare triple {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} assume true; {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} is VALID [2018-11-14 17:51:31,222 INFO L273 TraceCheckUtils]: 31: Hoare triple {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4828#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv14 32)) init_~size))} is VALID [2018-11-14 17:51:31,223 INFO L273 TraceCheckUtils]: 30: Hoare triple {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} is VALID [2018-11-14 17:51:31,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} assume true; {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} is VALID [2018-11-14 17:51:31,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4838#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv15 32)) init_~size))} is VALID [2018-11-14 17:51:31,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} is VALID [2018-11-14 17:51:31,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} assume true; {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} is VALID [2018-11-14 17:51:31,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4848#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv16 32)) init_~size))} is VALID [2018-11-14 17:51:31,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} is VALID [2018-11-14 17:51:31,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} assume true; {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} is VALID [2018-11-14 17:51:31,333 INFO L273 TraceCheckUtils]: 22: Hoare triple {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4858#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv17 32)) init_~size))} is VALID [2018-11-14 17:51:31,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} is VALID [2018-11-14 17:51:31,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} assume true; {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} is VALID [2018-11-14 17:51:31,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4868#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv18 32)) init_~size))} is VALID [2018-11-14 17:51:31,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} is VALID [2018-11-14 17:51:31,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} assume true; {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} is VALID [2018-11-14 17:51:31,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4878#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv19 32)) init_~size))} is VALID [2018-11-14 17:51:31,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} assume true; {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,433 INFO L273 TraceCheckUtils]: 13: Hoare triple {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4888#(or (bvslt (bvadd init_~i~0 (_ bv20 32)) init_~size) (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))))} is VALID [2018-11-14 17:51:31,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} is VALID [2018-11-14 17:51:31,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} assume true; {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} is VALID [2018-11-14 17:51:31,465 INFO L273 TraceCheckUtils]: 10: Hoare triple {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4898#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv21 32)) init_~size))} is VALID [2018-11-14 17:51:31,465 INFO L273 TraceCheckUtils]: 9: Hoare triple {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} assume !!~bvslt32(~i~0, ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~bvadd32(~a.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} is VALID [2018-11-14 17:51:31,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} assume true; {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} is VALID [2018-11-14 17:51:31,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {4259#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0bv32; {4908#(or (not (= (bvadd |init_#in~size| (_ bv4294867296 32)) (_ bv0 32))) (bvslt (bvadd init_~i~0 (_ bv22 32)) init_~size))} is VALID [2018-11-14 17:51:31,467 INFO L256 TraceCheckUtils]: 6: Hoare triple {4259#true} call init(~#a~0.base, ~#a~0.offset, 100000bv32); {4259#true} is VALID [2018-11-14 17:51:31,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {4259#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~1;havoc ~flag~0;~flag~0 := 0bv32; {4259#true} is VALID [2018-11-14 17:51:31,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {4259#true} call #t~ret6 := main(); {4259#true} is VALID [2018-11-14 17:51:31,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4259#true} {4259#true} #79#return; {4259#true} is VALID [2018-11-14 17:51:31,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {4259#true} assume true; {4259#true} is VALID [2018-11-14 17:51:31,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {4259#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4259#true} is VALID [2018-11-14 17:51:31,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2018-11-14 17:51:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 17:51:31,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:31,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-14 17:51:31,498 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 105 [2018-11-14 17:51:31,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:31,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-14 17:51:32,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:32,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-14 17:51:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-14 17:51:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 17:51:32,400 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 50 states. [2018-11-14 17:51:41,158 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-14 17:51:43,002 WARN L179 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 95 [2018-11-14 17:51:44,527 WARN L179 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-14 17:51:46,412 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 87 [2018-11-14 17:51:47,888 WARN L179 SmtUtils]: Spent 836.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-14 17:51:49,193 WARN L179 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-14 17:51:50,654 WARN L179 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-14 17:51:51,841 WARN L179 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-14 17:51:52,992 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-14 17:51:54,356 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-11-14 17:51:55,466 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-14 17:51:56,325 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-14 17:51:57,218 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 17:51:58,085 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 17:51:58,701 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-14 17:51:59,330 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 17:51:59,912 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-14 17:52:00,400 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-14 17:52:00,836 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-14 17:52:01,233 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-14 17:52:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:52:03,233 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2018-11-14 17:52:03,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-14 17:52:03,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 105 [2018-11-14 17:52:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:52:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:52:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 219 transitions. [2018-11-14 17:52:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:52:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 219 transitions. [2018-11-14 17:52:03,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 219 transitions. [2018-11-14 17:52:33,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 207 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2018-11-14 17:52:33,744 INFO L225 Difference]: With dead ends: 218 [2018-11-14 17:52:33,744 INFO L226 Difference]: Without dead ends: 182 [2018-11-14 17:52:33,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=1823, Invalid=3433, Unknown=0, NotChecked=0, Total=5256 [2018-11-14 17:52:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-14 17:52:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-14 17:52:33,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:52:33,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 182 states. [2018-11-14 17:52:33,913 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 182 states. [2018-11-14 17:52:33,913 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 182 states. [2018-11-14 17:52:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:52:33,920 INFO L93 Difference]: Finished difference Result 182 states and 185 transitions. [2018-11-14 17:52:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-11-14 17:52:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:52:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:52:33,921 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 182 states. [2018-11-14 17:52:33,921 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 182 states. [2018-11-14 17:52:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:52:33,926 INFO L93 Difference]: Finished difference Result 182 states and 185 transitions. [2018-11-14 17:52:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-11-14 17:52:33,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:52:33,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:52:33,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:52:33,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:52:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-14 17:52:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2018-11-14 17:52:33,932 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 105 [2018-11-14 17:52:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:52:33,933 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2018-11-14 17:52:33,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-14 17:52:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2018-11-14 17:52:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-14 17:52:33,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:52:33,935 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:52:33,936 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:52:33,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:52:33,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1199646547, now seen corresponding path program 5 times [2018-11-14 17:52:33,937 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:52:33,937 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:52:33,967 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1