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_Default-Const.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_partial_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:48:30,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:48:30,390 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:48:30,405 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:48:30,406 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:48:30,407 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:48:30,409 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:48:30,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:48:30,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:48:30,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:48:30,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:48:30,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:48:30,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:48:30,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:48:30,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:48:30,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:48:30,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:48:30,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:48:30,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:48:30,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:48:30,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:48:30,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:48:30,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:48:30,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:48:30,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:48:30,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:48:30,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:48:30,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:48:30,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:48:30,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:48:30,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:48:30,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:48:30,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:48:30,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:48:30,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:48:30,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:48:30,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:48:30,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:48:30,469 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:48:30,469 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:48:30,473 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:48:30,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:48:30,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:48:30,474 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:48:30,474 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:48:30,474 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:48:30,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:48:30,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:48:30,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:48:30,475 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:48:30,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:48:30,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:48:30,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:48:30,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:48:30,476 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:48:30,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:48:30,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:48:30,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:48:30,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:48:30,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:48:30,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:48:30,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:48:30,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:48:30,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:48:30,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:48:30,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:48:30,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:48:30,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:48:30,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:48:30,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:48:30,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:48:30,557 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:48:30,557 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:48:30,558 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_ptr_partial_init_true-unreach-call.i [2018-11-14 18:48:30,628 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6111fd1d/6dddc99dceda47ddb0c712c6ceaec0ad/FLAGea2c7bf01 [2018-11-14 18:48:31,042 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:48:31,043 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_ptr_partial_init_true-unreach-call.i [2018-11-14 18:48:31,049 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6111fd1d/6dddc99dceda47ddb0c712c6ceaec0ad/FLAGea2c7bf01 [2018-11-14 18:48:31,064 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6111fd1d/6dddc99dceda47ddb0c712c6ceaec0ad [2018-11-14 18:48:31,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:48:31,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:48:31,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:48:31,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:48:31,085 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:48:31,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f049fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31, skipping insertion in model container [2018-11-14 18:48:31,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:48:31,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:48:31,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:48:31,341 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:48:31,362 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:48:31,383 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:48:31,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31 WrapperNode [2018-11-14 18:48:31,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:48:31,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:48:31,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:48:31,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:48:31,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (1/1) ... [2018-11-14 18:48:31,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:48:31,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:48:31,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:48:31,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:48:31,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (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 18:48:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:48:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:48:31,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:48:31,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:48:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:48:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:48:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:48:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:48:32,088 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:48:32,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:48:32 BoogieIcfgContainer [2018-11-14 18:48:32,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:48:32,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:48:32,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:48:32,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:48:32,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:48:31" (1/3) ... [2018-11-14 18:48:32,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4786a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:48:32, skipping insertion in model container [2018-11-14 18:48:32,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:48:31" (2/3) ... [2018-11-14 18:48:32,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4786a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:48:32, skipping insertion in model container [2018-11-14 18:48:32,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:48:32" (3/3) ... [2018-11-14 18:48:32,097 INFO L112 eAbstractionObserver]: Analyzing ICFG array_ptr_partial_init_true-unreach-call.i [2018-11-14 18:48:32,107 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:48:32,115 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:48:32,131 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:48:32,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:48:32,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:48:32,166 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:48:32,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:48:32,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:48:32,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:48:32,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:48:32,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:48:32,167 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:48:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-14 18:48:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:48:32,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:32,195 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:32,198 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:32,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-14 18:48:32,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:32,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:32,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-14 18:48:32,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {33#true} is VALID [2018-11-14 18:48:32,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-14 18:48:32,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #66#return; {33#true} is VALID [2018-11-14 18:48:32,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2018-11-14 18:48:32,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} ~i~0 := 0; {33#true} is VALID [2018-11-14 18:48:32,413 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-14 18:48:32,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-14 18:48:32,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !true; {34#false} is VALID [2018-11-14 18:48:32,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0; {34#false} is VALID [2018-11-14 18:48:32,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-14 18:48:32,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {34#false} is VALID [2018-11-14 18:48:32,415 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {34#false} is VALID [2018-11-14 18:48:32,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-14 18:48:32,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume ~cond == 0; {34#false} is VALID [2018-11-14 18:48:32,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-14 18:48:32,420 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 18:48:32,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:48:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:48:32,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:48:32,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:32,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:48:32,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:32,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:48:32,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:48:32,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:48:32,597 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-14 18:48:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:32,866 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-14 18:48:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:48:32,866 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 18:48:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:48:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 18:48:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:48:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-14 18:48:32,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-14 18:48:33,181 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 18:48:33,192 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:48:33,193 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 18:48:33,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 18:48:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 18:48:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 18:48:33,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:33,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 18:48:33,352 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:48:33,352 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:48:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:33,357 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 18:48:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 18:48:33,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:33,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:33,358 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:48:33,358 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:48:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:33,363 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 18:48:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 18:48:33,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:33,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:33,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:33,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:48:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-14 18:48:33,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-14 18:48:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:33,369 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-14 18:48:33,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:48:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 18:48:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:48:33,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:33,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:33,371 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:33,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:33,372 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-14 18:48:33,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:33,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:33,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {185#true} is VALID [2018-11-14 18:48:33,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {185#true} is VALID [2018-11-14 18:48:33,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2018-11-14 18:48:33,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #66#return; {185#true} is VALID [2018-11-14 18:48:33,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret5 := main(); {185#true} is VALID [2018-11-14 18:48:33,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {185#true} ~i~0 := 0; {187#(= ~i~0 0)} is VALID [2018-11-14 18:48:33,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {187#(= ~i~0 0)} assume true; {187#(= ~i~0 0)} is VALID [2018-11-14 18:48:33,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {187#(= ~i~0 0)} assume !(~i~0 < 100000); {186#false} is VALID [2018-11-14 18:48:33,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {186#false} ~i~0 := 0; {186#false} is VALID [2018-11-14 18:48:33,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {186#false} assume true; {186#false} is VALID [2018-11-14 18:48:33,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {186#false} assume !(~i~0 < 50000); {186#false} is VALID [2018-11-14 18:48:33,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {186#false} ~i~0 := 0; {186#false} is VALID [2018-11-14 18:48:33,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {186#false} assume true; {186#false} is VALID [2018-11-14 18:48:33,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {186#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {186#false} is VALID [2018-11-14 18:48:33,543 INFO L256 TraceCheckUtils]: 14: Hoare triple {186#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {186#false} is VALID [2018-11-14 18:48:33,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {186#false} ~cond := #in~cond; {186#false} is VALID [2018-11-14 18:48:33,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {186#false} assume ~cond == 0; {186#false} is VALID [2018-11-14 18:48:33,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {186#false} assume !false; {186#false} is VALID [2018-11-14 18:48:33,546 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 18:48:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:48:33,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:48:33,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:48:33,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:33,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:48:33,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:33,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:48:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:48:33,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:48:33,606 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 3 states. [2018-11-14 18:48:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:34,043 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-14 18:48:34,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:48:34,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 18:48:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:48:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 18:48:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:48:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 18:48:34,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-14 18:48:34,305 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 18:48:34,308 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:48:34,308 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:48:34,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 18:48:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:48:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2018-11-14 18:48:34,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:34,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 29 states. [2018-11-14 18:48:34,386 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 29 states. [2018-11-14 18:48:34,386 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 29 states. [2018-11-14 18:48:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:34,393 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 18:48:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 18:48:34,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:34,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:34,395 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 42 states. [2018-11-14 18:48:34,395 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 42 states. [2018-11-14 18:48:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:34,402 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 18:48:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-14 18:48:34,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:34,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:34,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:34,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:34,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:48:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-14 18:48:34,408 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2018-11-14 18:48:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:34,408 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-14 18:48:34,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:48:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-14 18:48:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:48:34,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:34,410 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:34,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:34,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-11-14 18:48:34,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:34,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:34,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-14 18:48:34,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {392#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:34,739 INFO L273 TraceCheckUtils]: 2: Hoare triple {392#(= |~#a~0.offset| 0)} assume true; {392#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:34,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {392#(= |~#a~0.offset| 0)} {390#true} #66#return; {392#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:34,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {392#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {392#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:34,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {392#(= |~#a~0.offset| 0)} ~i~0 := 0; {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:34,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:34,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:34,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {394#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:34,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {394#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {394#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:34,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {394#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !(~i~0 < 100000); {391#false} is VALID [2018-11-14 18:48:34,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} ~i~0 := 0; {391#false} is VALID [2018-11-14 18:48:34,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 18:48:34,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {391#false} is VALID [2018-11-14 18:48:34,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {391#false} is VALID [2018-11-14 18:48:34,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 18:48:34,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !(~i~0 < 50000); {391#false} is VALID [2018-11-14 18:48:34,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {391#false} ~i~0 := 0; {395#(and (= |~#a~0.offset| ~i~0) (<= 99999 |~#a~0.offset|))} is VALID [2018-11-14 18:48:34,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {395#(and (= |~#a~0.offset| ~i~0) (<= 99999 |~#a~0.offset|))} assume true; {395#(and (= |~#a~0.offset| ~i~0) (<= 99999 |~#a~0.offset|))} is VALID [2018-11-14 18:48:34,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {395#(and (= |~#a~0.offset| ~i~0) (<= 99999 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {391#false} is VALID [2018-11-14 18:48:34,757 INFO L256 TraceCheckUtils]: 20: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {391#false} is VALID [2018-11-14 18:48:34,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-14 18:48:34,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {391#false} assume ~cond == 0; {391#false} is VALID [2018-11-14 18:48:34,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-14 18:48:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:48:34,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:34,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:34,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:34,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:34,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-14 18:48:34,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {390#true} is VALID [2018-11-14 18:48:34,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-14 18:48:34,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #66#return; {390#true} is VALID [2018-11-14 18:48:34,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret5 := main(); {390#true} is VALID [2018-11-14 18:48:34,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} ~i~0 := 0; {414#(<= ~i~0 0)} is VALID [2018-11-14 18:48:34,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {414#(<= ~i~0 0)} assume true; {414#(<= ~i~0 0)} is VALID [2018-11-14 18:48:34,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {414#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {414#(<= ~i~0 0)} is VALID [2018-11-14 18:48:35,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {414#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {424#(<= ~i~0 1)} is VALID [2018-11-14 18:48:35,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(<= ~i~0 1)} assume true; {424#(<= ~i~0 1)} is VALID [2018-11-14 18:48:35,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(<= ~i~0 1)} assume !(~i~0 < 100000); {391#false} is VALID [2018-11-14 18:48:35,001 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#false} ~i~0 := 0; {391#false} is VALID [2018-11-14 18:48:35,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 18:48:35,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {391#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {391#false} is VALID [2018-11-14 18:48:35,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {391#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {391#false} is VALID [2018-11-14 18:48:35,003 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 18:48:35,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !(~i~0 < 50000); {391#false} is VALID [2018-11-14 18:48:35,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {391#false} ~i~0 := 0; {391#false} is VALID [2018-11-14 18:48:35,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {391#false} assume true; {391#false} is VALID [2018-11-14 18:48:35,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {391#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {391#false} is VALID [2018-11-14 18:48:35,004 INFO L256 TraceCheckUtils]: 20: Hoare triple {391#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {391#false} is VALID [2018-11-14 18:48:35,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {391#false} ~cond := #in~cond; {391#false} is VALID [2018-11-14 18:48:35,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {391#false} assume ~cond == 0; {391#false} is VALID [2018-11-14 18:48:35,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-14 18:48:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:48:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 18:48:35,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 18:48:35,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:35,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:48:35,199 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 18:48:35,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:48:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:48:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:48:35,200 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 8 states. [2018-11-14 18:48:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:36,054 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-11-14 18:48:36,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:48:36,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 18:48:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:48:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 18:48:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:48:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 18:48:36,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-14 18:48:36,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:36,187 INFO L225 Difference]: With dead ends: 77 [2018-11-14 18:48:36,188 INFO L226 Difference]: Without dead ends: 59 [2018-11-14 18:48:36,188 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:48:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-14 18:48:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2018-11-14 18:48:36,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:36,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 35 states. [2018-11-14 18:48:36,307 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 35 states. [2018-11-14 18:48:36,307 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 35 states. [2018-11-14 18:48:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:36,311 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 18:48:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:48:36,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:36,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:36,312 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 59 states. [2018-11-14 18:48:36,312 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 59 states. [2018-11-14 18:48:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:36,316 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-14 18:48:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:48:36,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:36,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:36,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:36,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:48:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-14 18:48:36,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 24 [2018-11-14 18:48:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:36,320 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-14 18:48:36,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:48:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-14 18:48:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:48:36,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:36,322 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:36,322 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:36,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 2 times [2018-11-14 18:48:36,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:36,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:36,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:36,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:36,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2018-11-14 18:48:36,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {738#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:36,535 INFO L273 TraceCheckUtils]: 2: Hoare triple {738#(= |~#a~0.offset| 0)} assume true; {738#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:36,535 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {738#(= |~#a~0.offset| 0)} {736#true} #66#return; {738#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:36,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {738#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {738#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:36,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {738#(= |~#a~0.offset| 0)} ~i~0 := 0; {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:36,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:36,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:36,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {739#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:36,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:36,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:36,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {741#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:36,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {741#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {741#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:36,544 INFO L273 TraceCheckUtils]: 13: Hoare triple {741#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !(~i~0 < 100000); {737#false} is VALID [2018-11-14 18:48:36,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {737#false} ~i~0 := 0; {737#false} is VALID [2018-11-14 18:48:36,545 INFO L273 TraceCheckUtils]: 15: Hoare triple {737#false} assume true; {737#false} is VALID [2018-11-14 18:48:36,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {737#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {737#false} is VALID [2018-11-14 18:48:36,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {737#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {737#false} is VALID [2018-11-14 18:48:36,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {737#false} assume true; {737#false} is VALID [2018-11-14 18:48:36,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {737#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {737#false} is VALID [2018-11-14 18:48:36,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {737#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {737#false} is VALID [2018-11-14 18:48:36,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {737#false} assume true; {737#false} is VALID [2018-11-14 18:48:36,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {737#false} assume !(~i~0 < 50000); {737#false} is VALID [2018-11-14 18:48:36,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {737#false} ~i~0 := 0; {742#(and (= |~#a~0.offset| ~i~0) (<= 99998 |~#a~0.offset|))} is VALID [2018-11-14 18:48:36,554 INFO L273 TraceCheckUtils]: 24: Hoare triple {742#(and (= |~#a~0.offset| ~i~0) (<= 99998 |~#a~0.offset|))} assume true; {742#(and (= |~#a~0.offset| ~i~0) (<= 99998 |~#a~0.offset|))} is VALID [2018-11-14 18:48:36,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {742#(and (= |~#a~0.offset| ~i~0) (<= 99998 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {737#false} is VALID [2018-11-14 18:48:36,555 INFO L256 TraceCheckUtils]: 26: Hoare triple {737#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {737#false} is VALID [2018-11-14 18:48:36,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2018-11-14 18:48:36,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {737#false} assume ~cond == 0; {737#false} is VALID [2018-11-14 18:48:36,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {737#false} assume !false; {737#false} is VALID [2018-11-14 18:48:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:48:36,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:36,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:36,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:48:36,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:48:36,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:36,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:36,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {736#true} call ULTIMATE.init(); {736#true} is VALID [2018-11-14 18:48:36,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {736#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {736#true} is VALID [2018-11-14 18:48:36,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-14 18:48:36,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {736#true} {736#true} #66#return; {736#true} is VALID [2018-11-14 18:48:36,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {736#true} call #t~ret5 := main(); {736#true} is VALID [2018-11-14 18:48:36,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {736#true} ~i~0 := 0; {736#true} is VALID [2018-11-14 18:48:36,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-14 18:48:36,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {736#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {736#true} is VALID [2018-11-14 18:48:36,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {736#true} is VALID [2018-11-14 18:48:36,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-14 18:48:36,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {736#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {736#true} is VALID [2018-11-14 18:48:36,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {736#true} is VALID [2018-11-14 18:48:36,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {736#true} assume true; {736#true} is VALID [2018-11-14 18:48:36,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {736#true} assume !(~i~0 < 100000); {736#true} is VALID [2018-11-14 18:48:36,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {736#true} ~i~0 := 0; {788#(<= ~i~0 0)} is VALID [2018-11-14 18:48:36,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {788#(<= ~i~0 0)} assume true; {788#(<= ~i~0 0)} is VALID [2018-11-14 18:48:36,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {788#(<= ~i~0 0)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {788#(<= ~i~0 0)} is VALID [2018-11-14 18:48:36,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {788#(<= ~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {798#(<= ~i~0 1)} is VALID [2018-11-14 18:48:36,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {798#(<= ~i~0 1)} assume true; {798#(<= ~i~0 1)} is VALID [2018-11-14 18:48:36,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {798#(<= ~i~0 1)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {798#(<= ~i~0 1)} is VALID [2018-11-14 18:48:36,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {798#(<= ~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {808#(<= ~i~0 2)} is VALID [2018-11-14 18:48:36,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {808#(<= ~i~0 2)} assume true; {808#(<= ~i~0 2)} is VALID [2018-11-14 18:48:36,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {808#(<= ~i~0 2)} assume !(~i~0 < 50000); {737#false} is VALID [2018-11-14 18:48:36,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {737#false} ~i~0 := 0; {737#false} is VALID [2018-11-14 18:48:36,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {737#false} assume true; {737#false} is VALID [2018-11-14 18:48:36,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {737#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {737#false} is VALID [2018-11-14 18:48:36,871 INFO L256 TraceCheckUtils]: 26: Hoare triple {737#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {737#false} is VALID [2018-11-14 18:48:36,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {737#false} ~cond := #in~cond; {737#false} is VALID [2018-11-14 18:48:36,871 INFO L273 TraceCheckUtils]: 28: Hoare triple {737#false} assume ~cond == 0; {737#false} is VALID [2018-11-14 18:48:36,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {737#false} assume !false; {737#false} is VALID [2018-11-14 18:48:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 18:48:36,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:36,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-14 18:48:36,894 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-14 18:48:36,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:36,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:48:36,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:36,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:48:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:48:36,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:48:36,983 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 10 states. [2018-11-14 18:48:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:37,640 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-14 18:48:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:48:37,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-14 18:48:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:48:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:48:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:48:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-14 18:48:37,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2018-11-14 18:48:37,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:37,830 INFO L225 Difference]: With dead ends: 97 [2018-11-14 18:48:37,831 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:48:37,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:48:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:48:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2018-11-14 18:48:37,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:37,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 41 states. [2018-11-14 18:48:37,881 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 41 states. [2018-11-14 18:48:37,881 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 41 states. [2018-11-14 18:48:37,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:37,886 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-14 18:48:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-14 18:48:37,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:37,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:37,887 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 76 states. [2018-11-14 18:48:37,887 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 76 states. [2018-11-14 18:48:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:37,891 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-14 18:48:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-14 18:48:37,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:37,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:37,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:37,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:48:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-14 18:48:37,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 30 [2018-11-14 18:48:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:37,895 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-14 18:48:37,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:48:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-14 18:48:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:48:37,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:37,897 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:37,897 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:37,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 144640967, now seen corresponding path program 3 times [2018-11-14 18:48:37,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:37,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:37,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:37,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:38,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-14 18:48:38,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {1172#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:38,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {1172#(= |~#a~0.offset| 0)} assume true; {1172#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:38,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1172#(= |~#a~0.offset| 0)} {1170#true} #66#return; {1172#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:38,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {1172#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {1172#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:38,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {1172#(= |~#a~0.offset| 0)} ~i~0 := 0; {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {1173#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:38,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:38,237 INFO L273 TraceCheckUtils]: 10: Hoare triple {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:38,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:38,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1176#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:38,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {1176#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:38,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !(~i~0 < 100000); {1171#false} is VALID [2018-11-14 18:48:38,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-14 18:48:38,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {1171#false} assume true; {1171#false} is VALID [2018-11-14 18:48:38,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {1171#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1171#false} is VALID [2018-11-14 18:48:38,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {1171#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1171#false} is VALID [2018-11-14 18:48:38,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {1171#false} assume true; {1171#false} is VALID [2018-11-14 18:48:38,245 INFO L273 TraceCheckUtils]: 22: Hoare triple {1171#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1171#false} is VALID [2018-11-14 18:48:38,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {1171#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1171#false} is VALID [2018-11-14 18:48:38,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {1171#false} assume true; {1171#false} is VALID [2018-11-14 18:48:38,246 INFO L273 TraceCheckUtils]: 25: Hoare triple {1171#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1171#false} is VALID [2018-11-14 18:48:38,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {1171#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1171#false} is VALID [2018-11-14 18:48:38,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {1171#false} assume true; {1171#false} is VALID [2018-11-14 18:48:38,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {1171#false} assume !(~i~0 < 50000); {1171#false} is VALID [2018-11-14 18:48:38,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {1171#false} ~i~0 := 0; {1177#(and (<= 99997 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} is VALID [2018-11-14 18:48:38,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {1177#(and (<= 99997 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} assume true; {1177#(and (<= 99997 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} is VALID [2018-11-14 18:48:38,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {1177#(and (<= 99997 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1171#false} is VALID [2018-11-14 18:48:38,248 INFO L256 TraceCheckUtils]: 32: Hoare triple {1171#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {1171#false} is VALID [2018-11-14 18:48:38,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-14 18:48:38,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume ~cond == 0; {1171#false} is VALID [2018-11-14 18:48:38,249 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-14 18:48:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:48:38,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:38,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:38,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:48:38,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:48:38,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:38,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:38,494 INFO L256 TraceCheckUtils]: 0: Hoare triple {1170#true} call ULTIMATE.init(); {1170#true} is VALID [2018-11-14 18:48:38,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {1170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {1170#true} is VALID [2018-11-14 18:48:38,495 INFO L273 TraceCheckUtils]: 2: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:48:38,496 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1170#true} {1170#true} #66#return; {1170#true} is VALID [2018-11-14 18:48:38,496 INFO L256 TraceCheckUtils]: 4: Hoare triple {1170#true} call #t~ret5 := main(); {1170#true} is VALID [2018-11-14 18:48:38,496 INFO L273 TraceCheckUtils]: 5: Hoare triple {1170#true} ~i~0 := 0; {1170#true} is VALID [2018-11-14 18:48:38,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:48:38,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1170#true} is VALID [2018-11-14 18:48:38,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {1170#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1170#true} is VALID [2018-11-14 18:48:38,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:48:38,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1170#true} is VALID [2018-11-14 18:48:38,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {1170#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1170#true} is VALID [2018-11-14 18:48:38,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:48:38,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {1170#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1170#true} is VALID [2018-11-14 18:48:38,498 INFO L273 TraceCheckUtils]: 14: Hoare triple {1170#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1170#true} is VALID [2018-11-14 18:48:38,498 INFO L273 TraceCheckUtils]: 15: Hoare triple {1170#true} assume true; {1170#true} is VALID [2018-11-14 18:48:38,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {1170#true} assume !(~i~0 < 100000); {1170#true} is VALID [2018-11-14 18:48:38,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {1170#true} ~i~0 := 0; {1232#(<= ~i~0 0)} is VALID [2018-11-14 18:48:38,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {1232#(<= ~i~0 0)} assume true; {1232#(<= ~i~0 0)} is VALID [2018-11-14 18:48:38,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {1232#(<= ~i~0 0)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1232#(<= ~i~0 0)} is VALID [2018-11-14 18:48:38,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {1232#(<= ~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1242#(<= ~i~0 1)} is VALID [2018-11-14 18:48:38,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {1242#(<= ~i~0 1)} assume true; {1242#(<= ~i~0 1)} is VALID [2018-11-14 18:48:38,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {1242#(<= ~i~0 1)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1242#(<= ~i~0 1)} is VALID [2018-11-14 18:48:38,504 INFO L273 TraceCheckUtils]: 23: Hoare triple {1242#(<= ~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1252#(<= ~i~0 2)} is VALID [2018-11-14 18:48:38,505 INFO L273 TraceCheckUtils]: 24: Hoare triple {1252#(<= ~i~0 2)} assume true; {1252#(<= ~i~0 2)} is VALID [2018-11-14 18:48:38,505 INFO L273 TraceCheckUtils]: 25: Hoare triple {1252#(<= ~i~0 2)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1252#(<= ~i~0 2)} is VALID [2018-11-14 18:48:38,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {1252#(<= ~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1262#(<= ~i~0 3)} is VALID [2018-11-14 18:48:38,513 INFO L273 TraceCheckUtils]: 27: Hoare triple {1262#(<= ~i~0 3)} assume true; {1262#(<= ~i~0 3)} is VALID [2018-11-14 18:48:38,514 INFO L273 TraceCheckUtils]: 28: Hoare triple {1262#(<= ~i~0 3)} assume !(~i~0 < 50000); {1171#false} is VALID [2018-11-14 18:48:38,514 INFO L273 TraceCheckUtils]: 29: Hoare triple {1171#false} ~i~0 := 0; {1171#false} is VALID [2018-11-14 18:48:38,514 INFO L273 TraceCheckUtils]: 30: Hoare triple {1171#false} assume true; {1171#false} is VALID [2018-11-14 18:48:38,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {1171#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1171#false} is VALID [2018-11-14 18:48:38,515 INFO L256 TraceCheckUtils]: 32: Hoare triple {1171#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {1171#false} is VALID [2018-11-14 18:48:38,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {1171#false} ~cond := #in~cond; {1171#false} is VALID [2018-11-14 18:48:38,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {1171#false} assume ~cond == 0; {1171#false} is VALID [2018-11-14 18:48:38,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2018-11-14 18:48:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 18:48:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-14 18:48:38,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-14 18:48:38,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:38,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:48:38,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:38,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:48:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:48:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:48:38,602 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-11-14 18:48:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:39,706 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-11-14 18:48:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:48:39,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-14 18:48:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:48:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 18:48:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:48:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-14 18:48:39,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-14 18:48:39,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:39,884 INFO L225 Difference]: With dead ends: 117 [2018-11-14 18:48:39,885 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 18:48:39,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:48:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 18:48:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 47. [2018-11-14 18:48:40,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:40,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 47 states. [2018-11-14 18:48:40,018 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 47 states. [2018-11-14 18:48:40,018 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 47 states. [2018-11-14 18:48:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:40,022 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-14 18:48:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-14 18:48:40,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:40,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:40,024 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 93 states. [2018-11-14 18:48:40,024 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 93 states. [2018-11-14 18:48:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:40,028 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-14 18:48:40,028 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-14 18:48:40,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:40,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:40,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:40,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:48:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-14 18:48:40,031 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 36 [2018-11-14 18:48:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:40,032 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-14 18:48:40,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:48:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-14 18:48:40,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:48:40,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:40,033 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:40,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:40,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:40,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1345869878, now seen corresponding path program 4 times [2018-11-14 18:48:40,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:40,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:40,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:40,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:40,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2018-11-14 18:48:40,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {1694#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:40,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {1694#(= |~#a~0.offset| 0)} assume true; {1694#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:40,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1694#(= |~#a~0.offset| 0)} {1692#true} #66#return; {1694#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:40,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {1694#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {1694#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:40,292 INFO L273 TraceCheckUtils]: 5: Hoare triple {1694#(= |~#a~0.offset| 0)} ~i~0 := 0; {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,293 INFO L273 TraceCheckUtils]: 6: Hoare triple {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {1695#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:40,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:40,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:40,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {1696#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:40,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {1697#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:40,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:40,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:40,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {1698#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1699#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:40,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {1699#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:40,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !(~i~0 < 100000); {1693#false} is VALID [2018-11-14 18:48:40,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {1693#false} ~i~0 := 0; {1693#false} is VALID [2018-11-14 18:48:40,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,310 INFO L273 TraceCheckUtils]: 24: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,311 INFO L273 TraceCheckUtils]: 25: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {1693#false} assume !(~i~0 < 50000); {1693#false} is VALID [2018-11-14 18:48:40,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {1693#false} ~i~0 := 0; {1700#(and (= |~#a~0.offset| ~i~0) (<= 99996 |~#a~0.offset|))} is VALID [2018-11-14 18:48:40,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {1700#(and (= |~#a~0.offset| ~i~0) (<= 99996 |~#a~0.offset|))} assume true; {1700#(and (= |~#a~0.offset| ~i~0) (<= 99996 |~#a~0.offset|))} is VALID [2018-11-14 18:48:40,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {1700#(and (= |~#a~0.offset| ~i~0) (<= 99996 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,315 INFO L256 TraceCheckUtils]: 38: Hoare triple {1693#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {1693#false} is VALID [2018-11-14 18:48:40,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2018-11-14 18:48:40,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {1693#false} assume ~cond == 0; {1693#false} is VALID [2018-11-14 18:48:40,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2018-11-14 18:48:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 18:48:40,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:40,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:40,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:48:40,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:48:40,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:40,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:40,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2018-11-14 18:48:40,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {1692#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {1692#true} is VALID [2018-11-14 18:48:40,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2018-11-14 18:48:40,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #66#return; {1692#true} is VALID [2018-11-14 18:48:40,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret5 := main(); {1692#true} is VALID [2018-11-14 18:48:40,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {1692#true} ~i~0 := 0; {1719#(<= ~i~0 0)} is VALID [2018-11-14 18:48:40,628 INFO L273 TraceCheckUtils]: 6: Hoare triple {1719#(<= ~i~0 0)} assume true; {1719#(<= ~i~0 0)} is VALID [2018-11-14 18:48:40,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {1719#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1719#(<= ~i~0 0)} is VALID [2018-11-14 18:48:40,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {1719#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1729#(<= ~i~0 1)} is VALID [2018-11-14 18:48:40,630 INFO L273 TraceCheckUtils]: 9: Hoare triple {1729#(<= ~i~0 1)} assume true; {1729#(<= ~i~0 1)} is VALID [2018-11-14 18:48:40,630 INFO L273 TraceCheckUtils]: 10: Hoare triple {1729#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1729#(<= ~i~0 1)} is VALID [2018-11-14 18:48:40,631 INFO L273 TraceCheckUtils]: 11: Hoare triple {1729#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1739#(<= ~i~0 2)} is VALID [2018-11-14 18:48:40,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {1739#(<= ~i~0 2)} assume true; {1739#(<= ~i~0 2)} is VALID [2018-11-14 18:48:40,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {1739#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1739#(<= ~i~0 2)} is VALID [2018-11-14 18:48:40,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {1739#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1749#(<= ~i~0 3)} is VALID [2018-11-14 18:48:40,633 INFO L273 TraceCheckUtils]: 15: Hoare triple {1749#(<= ~i~0 3)} assume true; {1749#(<= ~i~0 3)} is VALID [2018-11-14 18:48:40,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {1749#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1749#(<= ~i~0 3)} is VALID [2018-11-14 18:48:40,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {1749#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1759#(<= ~i~0 4)} is VALID [2018-11-14 18:48:40,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {1759#(<= ~i~0 4)} assume true; {1759#(<= ~i~0 4)} is VALID [2018-11-14 18:48:40,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {1759#(<= ~i~0 4)} assume !(~i~0 < 100000); {1693#false} is VALID [2018-11-14 18:48:40,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {1693#false} ~i~0 := 0; {1693#false} is VALID [2018-11-14 18:48:40,674 INFO L273 TraceCheckUtils]: 21: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 25: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 26: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 27: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 31: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 32: Hoare triple {1693#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 33: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {1693#false} assume !(~i~0 < 50000); {1693#false} is VALID [2018-11-14 18:48:40,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {1693#false} ~i~0 := 0; {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {1693#false} assume true; {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {1693#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L256 TraceCheckUtils]: 38: Hoare triple {1693#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {1693#false} ~cond := #in~cond; {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {1693#false} assume ~cond == 0; {1693#false} is VALID [2018-11-14 18:48:40,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2018-11-14 18:48:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 18:48:40,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-14 18:48:40,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 18:48:40,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:40,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:48:40,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:48:40,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:48:40,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:48:40,767 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 14 states. [2018-11-14 18:48:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:41,674 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-11-14 18:48:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:48:41,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-14 18:48:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:48:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-14 18:48:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:48:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2018-11-14 18:48:41,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2018-11-14 18:48:41,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:41,848 INFO L225 Difference]: With dead ends: 137 [2018-11-14 18:48:41,848 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 18:48:41,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:48:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 18:48:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 53. [2018-11-14 18:48:41,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:41,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 53 states. [2018-11-14 18:48:41,960 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 53 states. [2018-11-14 18:48:41,960 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 53 states. [2018-11-14 18:48:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:41,964 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-11-14 18:48:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-14 18:48:41,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:41,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:41,965 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 110 states. [2018-11-14 18:48:41,965 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 110 states. [2018-11-14 18:48:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:41,969 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-11-14 18:48:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-11-14 18:48:41,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:41,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:41,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:41,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:48:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-11-14 18:48:41,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2018-11-14 18:48:41,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:41,972 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-11-14 18:48:41,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:48:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-14 18:48:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 18:48:41,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:41,974 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:41,974 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:41,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:41,974 INFO L82 PathProgramCache]: Analyzing trace with hash 805826727, now seen corresponding path program 5 times [2018-11-14 18:48:41,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:41,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:41,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:42,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {2302#true} call ULTIMATE.init(); {2302#true} is VALID [2018-11-14 18:48:42,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {2302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {2304#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:42,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {2304#(= |~#a~0.offset| 0)} assume true; {2304#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:42,285 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2304#(= |~#a~0.offset| 0)} {2302#true} #66#return; {2304#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:42,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {2304#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {2304#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:42,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {2304#(= |~#a~0.offset| 0)} ~i~0 := 0; {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {2305#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:42,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:42,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:42,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {2306#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {2307#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:42,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:42,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:42,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {2308#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:42,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:42,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:42,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {2309#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2310#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {2310#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {2310#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:42,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {2310#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !(~i~0 < 100000); {2303#false} is VALID [2018-11-14 18:48:42,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {2303#false} ~i~0 := 0; {2303#false} is VALID [2018-11-14 18:48:42,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,306 INFO L273 TraceCheckUtils]: 25: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,308 INFO L273 TraceCheckUtils]: 33: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,309 INFO L273 TraceCheckUtils]: 35: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {2303#false} assume !(~i~0 < 50000); {2303#false} is VALID [2018-11-14 18:48:42,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {2303#false} ~i~0 := 0; {2311#(and (= |~#a~0.offset| ~i~0) (<= 99995 |~#a~0.offset|))} is VALID [2018-11-14 18:48:42,311 INFO L273 TraceCheckUtils]: 42: Hoare triple {2311#(and (= |~#a~0.offset| ~i~0) (<= 99995 |~#a~0.offset|))} assume true; {2311#(and (= |~#a~0.offset| ~i~0) (<= 99995 |~#a~0.offset|))} is VALID [2018-11-14 18:48:42,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {2311#(and (= |~#a~0.offset| ~i~0) (<= 99995 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,313 INFO L256 TraceCheckUtils]: 44: Hoare triple {2303#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {2303#false} is VALID [2018-11-14 18:48:42,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {2303#false} ~cond := #in~cond; {2303#false} is VALID [2018-11-14 18:48:42,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {2303#false} assume ~cond == 0; {2303#false} is VALID [2018-11-14 18:48:42,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {2303#false} assume !false; {2303#false} is VALID [2018-11-14 18:48:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 18:48:42,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:42,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:42,331 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:48:42,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:48:42,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:42,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:42,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {2302#true} call ULTIMATE.init(); {2302#true} is VALID [2018-11-14 18:48:42,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {2302#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {2302#true} is VALID [2018-11-14 18:48:42,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {2302#true} assume true; {2302#true} is VALID [2018-11-14 18:48:42,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2302#true} {2302#true} #66#return; {2302#true} is VALID [2018-11-14 18:48:42,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {2302#true} call #t~ret5 := main(); {2302#true} is VALID [2018-11-14 18:48:42,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {2302#true} ~i~0 := 0; {2330#(<= ~i~0 0)} is VALID [2018-11-14 18:48:42,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {2330#(<= ~i~0 0)} assume true; {2330#(<= ~i~0 0)} is VALID [2018-11-14 18:48:42,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {2330#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2330#(<= ~i~0 0)} is VALID [2018-11-14 18:48:42,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {2330#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2340#(<= ~i~0 1)} is VALID [2018-11-14 18:48:42,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {2340#(<= ~i~0 1)} assume true; {2340#(<= ~i~0 1)} is VALID [2018-11-14 18:48:42,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2340#(<= ~i~0 1)} is VALID [2018-11-14 18:48:42,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {2340#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2350#(<= ~i~0 2)} is VALID [2018-11-14 18:48:42,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {2350#(<= ~i~0 2)} assume true; {2350#(<= ~i~0 2)} is VALID [2018-11-14 18:48:42,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {2350#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2350#(<= ~i~0 2)} is VALID [2018-11-14 18:48:42,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {2350#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2360#(<= ~i~0 3)} is VALID [2018-11-14 18:48:42,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {2360#(<= ~i~0 3)} assume true; {2360#(<= ~i~0 3)} is VALID [2018-11-14 18:48:42,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {2360#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2360#(<= ~i~0 3)} is VALID [2018-11-14 18:48:42,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {2360#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2370#(<= ~i~0 4)} is VALID [2018-11-14 18:48:42,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2370#(<= ~i~0 4)} assume true; {2370#(<= ~i~0 4)} is VALID [2018-11-14 18:48:42,875 INFO L273 TraceCheckUtils]: 19: Hoare triple {2370#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2370#(<= ~i~0 4)} is VALID [2018-11-14 18:48:42,876 INFO L273 TraceCheckUtils]: 20: Hoare triple {2370#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2380#(<= ~i~0 5)} is VALID [2018-11-14 18:48:42,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~i~0 5)} assume true; {2380#(<= ~i~0 5)} is VALID [2018-11-14 18:48:42,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~i~0 5)} assume !(~i~0 < 100000); {2303#false} is VALID [2018-11-14 18:48:42,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {2303#false} ~i~0 := 0; {2303#false} is VALID [2018-11-14 18:48:42,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,878 INFO L273 TraceCheckUtils]: 27: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,878 INFO L273 TraceCheckUtils]: 28: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,879 INFO L273 TraceCheckUtils]: 29: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,879 INFO L273 TraceCheckUtils]: 30: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,880 INFO L273 TraceCheckUtils]: 35: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {2303#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2303#false} is VALID [2018-11-14 18:48:42,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {2303#false} assume !(~i~0 < 50000); {2303#false} is VALID [2018-11-14 18:48:42,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {2303#false} ~i~0 := 0; {2303#false} is VALID [2018-11-14 18:48:42,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {2303#false} assume true; {2303#false} is VALID [2018-11-14 18:48:42,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {2303#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {2303#false} is VALID [2018-11-14 18:48:42,882 INFO L256 TraceCheckUtils]: 44: Hoare triple {2303#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {2303#false} is VALID [2018-11-14 18:48:42,882 INFO L273 TraceCheckUtils]: 45: Hoare triple {2303#false} ~cond := #in~cond; {2303#false} is VALID [2018-11-14 18:48:42,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {2303#false} assume ~cond == 0; {2303#false} is VALID [2018-11-14 18:48:42,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {2303#false} assume !false; {2303#false} is VALID [2018-11-14 18:48:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 18:48:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:42,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-11-14 18:48:42,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-11-14 18:48:42,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:42,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:48:43,002 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 18:48:43,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:48:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:48:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:48:43,004 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 16 states. [2018-11-14 18:48:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:44,089 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2018-11-14 18:48:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:48:44,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 48 [2018-11-14 18:48:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:48:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2018-11-14 18:48:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:48:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2018-11-14 18:48:44,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 148 transitions. [2018-11-14 18:48:44,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:44,305 INFO L225 Difference]: With dead ends: 157 [2018-11-14 18:48:44,305 INFO L226 Difference]: Without dead ends: 127 [2018-11-14 18:48:44,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:48:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-14 18:48:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 59. [2018-11-14 18:48:44,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:44,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 59 states. [2018-11-14 18:48:44,356 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 59 states. [2018-11-14 18:48:44,357 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 59 states. [2018-11-14 18:48:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:44,362 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-14 18:48:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-11-14 18:48:44,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:44,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:44,363 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 127 states. [2018-11-14 18:48:44,363 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 127 states. [2018-11-14 18:48:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:44,367 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-11-14 18:48:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-11-14 18:48:44,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:44,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:44,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:44,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:48:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-14 18:48:44,370 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 48 [2018-11-14 18:48:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:44,371 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-14 18:48:44,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:48:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-14 18:48:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:48:44,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:44,372 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:44,372 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:44,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash 552556138, now seen corresponding path program 6 times [2018-11-14 18:48:44,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:44,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:44,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:44,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:44,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:44,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {3000#true} call ULTIMATE.init(); {3000#true} is VALID [2018-11-14 18:48:44,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {3000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {3002#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:44,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {3002#(= |~#a~0.offset| 0)} assume true; {3002#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:44,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3002#(= |~#a~0.offset| 0)} {3000#true} #66#return; {3002#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:44,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {3002#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {3002#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:44,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {3002#(= |~#a~0.offset| 0)} ~i~0 := 0; {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {3003#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:44,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:44,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:44,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {3004#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,743 INFO L273 TraceCheckUtils]: 14: Hoare triple {3005#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:44,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:44,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:44,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {3006#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:44,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:44,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:44,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {3007#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,749 INFO L273 TraceCheckUtils]: 21: Hoare triple {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,750 INFO L273 TraceCheckUtils]: 22: Hoare triple {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:44,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3008#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3009#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:44,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {3009#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {3009#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:44,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {3009#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !(~i~0 < 100000); {3001#false} is VALID [2018-11-14 18:48:44,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {3001#false} ~i~0 := 0; {3001#false} is VALID [2018-11-14 18:48:44,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,755 INFO L273 TraceCheckUtils]: 37: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,755 INFO L273 TraceCheckUtils]: 38: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,756 INFO L273 TraceCheckUtils]: 40: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,756 INFO L273 TraceCheckUtils]: 42: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:44,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:44,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {3001#false} assume !(~i~0 < 50000); {3001#false} is VALID [2018-11-14 18:48:44,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {3001#false} ~i~0 := 0; {3010#(and (= |~#a~0.offset| ~i~0) (<= 99994 |~#a~0.offset|))} is VALID [2018-11-14 18:48:44,758 INFO L273 TraceCheckUtils]: 48: Hoare triple {3010#(and (= |~#a~0.offset| ~i~0) (<= 99994 |~#a~0.offset|))} assume true; {3010#(and (= |~#a~0.offset| ~i~0) (<= 99994 |~#a~0.offset|))} is VALID [2018-11-14 18:48:44,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {3010#(and (= |~#a~0.offset| ~i~0) (<= 99994 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:44,759 INFO L256 TraceCheckUtils]: 50: Hoare triple {3001#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {3001#false} is VALID [2018-11-14 18:48:44,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {3001#false} ~cond := #in~cond; {3001#false} is VALID [2018-11-14 18:48:44,759 INFO L273 TraceCheckUtils]: 52: Hoare triple {3001#false} assume ~cond == 0; {3001#false} is VALID [2018-11-14 18:48:44,759 INFO L273 TraceCheckUtils]: 53: Hoare triple {3001#false} assume !false; {3001#false} is VALID [2018-11-14 18:48:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 18:48:44,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:44,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:44,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:48:44,942 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:48:44,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:44,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:45,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {3000#true} call ULTIMATE.init(); {3000#true} is VALID [2018-11-14 18:48:45,163 INFO L273 TraceCheckUtils]: 1: Hoare triple {3000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {3000#true} is VALID [2018-11-14 18:48:45,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {3000#true} assume true; {3000#true} is VALID [2018-11-14 18:48:45,163 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3000#true} {3000#true} #66#return; {3000#true} is VALID [2018-11-14 18:48:45,163 INFO L256 TraceCheckUtils]: 4: Hoare triple {3000#true} call #t~ret5 := main(); {3000#true} is VALID [2018-11-14 18:48:45,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {3000#true} ~i~0 := 0; {3029#(<= ~i~0 0)} is VALID [2018-11-14 18:48:45,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {3029#(<= ~i~0 0)} assume true; {3029#(<= ~i~0 0)} is VALID [2018-11-14 18:48:45,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {3029#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3029#(<= ~i~0 0)} is VALID [2018-11-14 18:48:45,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {3029#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3039#(<= ~i~0 1)} is VALID [2018-11-14 18:48:45,166 INFO L273 TraceCheckUtils]: 9: Hoare triple {3039#(<= ~i~0 1)} assume true; {3039#(<= ~i~0 1)} is VALID [2018-11-14 18:48:45,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {3039#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3039#(<= ~i~0 1)} is VALID [2018-11-14 18:48:45,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {3039#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3049#(<= ~i~0 2)} is VALID [2018-11-14 18:48:45,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {3049#(<= ~i~0 2)} assume true; {3049#(<= ~i~0 2)} is VALID [2018-11-14 18:48:45,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {3049#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3049#(<= ~i~0 2)} is VALID [2018-11-14 18:48:45,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {3049#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3059#(<= ~i~0 3)} is VALID [2018-11-14 18:48:45,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {3059#(<= ~i~0 3)} assume true; {3059#(<= ~i~0 3)} is VALID [2018-11-14 18:48:45,170 INFO L273 TraceCheckUtils]: 16: Hoare triple {3059#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3059#(<= ~i~0 3)} is VALID [2018-11-14 18:48:45,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {3059#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3069#(<= ~i~0 4)} is VALID [2018-11-14 18:48:45,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {3069#(<= ~i~0 4)} assume true; {3069#(<= ~i~0 4)} is VALID [2018-11-14 18:48:45,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {3069#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3069#(<= ~i~0 4)} is VALID [2018-11-14 18:48:45,173 INFO L273 TraceCheckUtils]: 20: Hoare triple {3069#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3079#(<= ~i~0 5)} is VALID [2018-11-14 18:48:45,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {3079#(<= ~i~0 5)} assume true; {3079#(<= ~i~0 5)} is VALID [2018-11-14 18:48:45,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {3079#(<= ~i~0 5)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3079#(<= ~i~0 5)} is VALID [2018-11-14 18:48:45,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {3079#(<= ~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3089#(<= ~i~0 6)} is VALID [2018-11-14 18:48:45,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {3089#(<= ~i~0 6)} assume true; {3089#(<= ~i~0 6)} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {3089#(<= ~i~0 6)} assume !(~i~0 < 100000); {3001#false} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {3001#false} ~i~0 := 0; {3001#false} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 27: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 36: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 40: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 41: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 43: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 44: Hoare triple {3001#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3001#false} is VALID [2018-11-14 18:48:45,189 INFO L273 TraceCheckUtils]: 45: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 46: Hoare triple {3001#false} assume !(~i~0 < 50000); {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 47: Hoare triple {3001#false} ~i~0 := 0; {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {3001#false} assume true; {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 49: Hoare triple {3001#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L256 TraceCheckUtils]: 50: Hoare triple {3001#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 51: Hoare triple {3001#false} ~cond := #in~cond; {3001#false} is VALID [2018-11-14 18:48:45,190 INFO L273 TraceCheckUtils]: 52: Hoare triple {3001#false} assume ~cond == 0; {3001#false} is VALID [2018-11-14 18:48:45,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {3001#false} assume !false; {3001#false} is VALID [2018-11-14 18:48:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-14 18:48:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-11-14 18:48:45,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 18:48:45,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:45,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:48:45,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:45,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:48:45,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:48:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:48:45,283 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 18 states. [2018-11-14 18:48:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:46,555 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-11-14 18:48:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:48:46,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2018-11-14 18:48:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:48:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2018-11-14 18:48:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:48:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2018-11-14 18:48:46,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 165 transitions. [2018-11-14 18:48:46,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:46,785 INFO L225 Difference]: With dead ends: 177 [2018-11-14 18:48:46,785 INFO L226 Difference]: Without dead ends: 144 [2018-11-14 18:48:46,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:48:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-14 18:48:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 65. [2018-11-14 18:48:46,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:46,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 65 states. [2018-11-14 18:48:46,870 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 65 states. [2018-11-14 18:48:46,870 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 65 states. [2018-11-14 18:48:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:46,875 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-11-14 18:48:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-11-14 18:48:46,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:46,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:46,876 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 144 states. [2018-11-14 18:48:46,876 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 144 states. [2018-11-14 18:48:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:46,881 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-11-14 18:48:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-11-14 18:48:46,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:46,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:46,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:46,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:48:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-14 18:48:46,884 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2018-11-14 18:48:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:46,884 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-14 18:48:46,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:48:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-14 18:48:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-14 18:48:46,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:46,885 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:46,886 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:46,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1772495481, now seen corresponding path program 7 times [2018-11-14 18:48:46,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:46,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:46,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:46,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:47,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {3786#true} call ULTIMATE.init(); {3786#true} is VALID [2018-11-14 18:48:47,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {3786#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {3788#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:47,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {3788#(= |~#a~0.offset| 0)} assume true; {3788#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:47,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3788#(= |~#a~0.offset| 0)} {3786#true} #66#return; {3788#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:47,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {3788#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {3788#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:47,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {3788#(= |~#a~0.offset| 0)} ~i~0 := 0; {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {3789#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:47,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:47,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:47,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {3790#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {3791#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:47,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:47,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:47,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {3792#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:47,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:47,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:47,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {3793#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,313 INFO L273 TraceCheckUtils]: 21: Hoare triple {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,315 INFO L273 TraceCheckUtils]: 23: Hoare triple {3794#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:47,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:47,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:47,317 INFO L273 TraceCheckUtils]: 26: Hoare triple {3795#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3796#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {3796#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {3796#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:47,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {3796#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !(~i~0 < 100000); {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {3787#false} ~i~0 := 0; {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 34: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,321 INFO L273 TraceCheckUtils]: 36: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 43: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,322 INFO L273 TraceCheckUtils]: 44: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 47: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 48: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 49: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 51: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,323 INFO L273 TraceCheckUtils]: 52: Hoare triple {3787#false} assume !(~i~0 < 50000); {3787#false} is VALID [2018-11-14 18:48:47,324 INFO L273 TraceCheckUtils]: 53: Hoare triple {3787#false} ~i~0 := 0; {3797#(and (<= 99993 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} is VALID [2018-11-14 18:48:47,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {3797#(and (<= 99993 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} assume true; {3797#(and (<= 99993 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} is VALID [2018-11-14 18:48:47,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {3797#(and (<= 99993 |~#a~0.offset|) (= |~#a~0.offset| ~i~0))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,326 INFO L256 TraceCheckUtils]: 56: Hoare triple {3787#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {3787#false} is VALID [2018-11-14 18:48:47,326 INFO L273 TraceCheckUtils]: 57: Hoare triple {3787#false} ~cond := #in~cond; {3787#false} is VALID [2018-11-14 18:48:47,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {3787#false} assume ~cond == 0; {3787#false} is VALID [2018-11-14 18:48:47,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2018-11-14 18:48:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-14 18:48:47,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:47,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:47,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:47,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {3786#true} call ULTIMATE.init(); {3786#true} is VALID [2018-11-14 18:48:47,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {3786#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {3786#true} is VALID [2018-11-14 18:48:47,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {3786#true} assume true; {3786#true} is VALID [2018-11-14 18:48:47,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3786#true} {3786#true} #66#return; {3786#true} is VALID [2018-11-14 18:48:47,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {3786#true} call #t~ret5 := main(); {3786#true} is VALID [2018-11-14 18:48:47,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {3786#true} ~i~0 := 0; {3816#(<= ~i~0 0)} is VALID [2018-11-14 18:48:47,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {3816#(<= ~i~0 0)} assume true; {3816#(<= ~i~0 0)} is VALID [2018-11-14 18:48:47,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {3816#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3816#(<= ~i~0 0)} is VALID [2018-11-14 18:48:47,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {3816#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3826#(<= ~i~0 1)} is VALID [2018-11-14 18:48:47,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {3826#(<= ~i~0 1)} assume true; {3826#(<= ~i~0 1)} is VALID [2018-11-14 18:48:47,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {3826#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3826#(<= ~i~0 1)} is VALID [2018-11-14 18:48:47,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {3826#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3836#(<= ~i~0 2)} is VALID [2018-11-14 18:48:47,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {3836#(<= ~i~0 2)} assume true; {3836#(<= ~i~0 2)} is VALID [2018-11-14 18:48:47,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {3836#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3836#(<= ~i~0 2)} is VALID [2018-11-14 18:48:47,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {3836#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3846#(<= ~i~0 3)} is VALID [2018-11-14 18:48:47,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {3846#(<= ~i~0 3)} assume true; {3846#(<= ~i~0 3)} is VALID [2018-11-14 18:48:47,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {3846#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3846#(<= ~i~0 3)} is VALID [2018-11-14 18:48:47,585 INFO L273 TraceCheckUtils]: 17: Hoare triple {3846#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3856#(<= ~i~0 4)} is VALID [2018-11-14 18:48:47,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {3856#(<= ~i~0 4)} assume true; {3856#(<= ~i~0 4)} is VALID [2018-11-14 18:48:47,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {3856#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3856#(<= ~i~0 4)} is VALID [2018-11-14 18:48:47,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {3856#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3866#(<= ~i~0 5)} is VALID [2018-11-14 18:48:47,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {3866#(<= ~i~0 5)} assume true; {3866#(<= ~i~0 5)} is VALID [2018-11-14 18:48:47,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {3866#(<= ~i~0 5)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3866#(<= ~i~0 5)} is VALID [2018-11-14 18:48:47,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {3866#(<= ~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3876#(<= ~i~0 6)} is VALID [2018-11-14 18:48:47,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {3876#(<= ~i~0 6)} assume true; {3876#(<= ~i~0 6)} is VALID [2018-11-14 18:48:47,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {3876#(<= ~i~0 6)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3876#(<= ~i~0 6)} is VALID [2018-11-14 18:48:47,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {3876#(<= ~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3886#(<= ~i~0 7)} is VALID [2018-11-14 18:48:47,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {3886#(<= ~i~0 7)} assume true; {3886#(<= ~i~0 7)} is VALID [2018-11-14 18:48:47,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {3886#(<= ~i~0 7)} assume !(~i~0 < 100000); {3787#false} is VALID [2018-11-14 18:48:47,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {3787#false} ~i~0 := 0; {3787#false} is VALID [2018-11-14 18:48:47,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,592 INFO L273 TraceCheckUtils]: 32: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,593 INFO L273 TraceCheckUtils]: 33: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,593 INFO L273 TraceCheckUtils]: 35: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,593 INFO L273 TraceCheckUtils]: 36: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,594 INFO L273 TraceCheckUtils]: 40: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,594 INFO L273 TraceCheckUtils]: 42: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,595 INFO L273 TraceCheckUtils]: 44: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,595 INFO L273 TraceCheckUtils]: 45: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,595 INFO L273 TraceCheckUtils]: 46: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,595 INFO L273 TraceCheckUtils]: 47: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 48: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 49: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 50: Hoare triple {3787#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {3787#false} assume !(~i~0 < 50000); {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 53: Hoare triple {3787#false} ~i~0 := 0; {3787#false} is VALID [2018-11-14 18:48:47,596 INFO L273 TraceCheckUtils]: 54: Hoare triple {3787#false} assume true; {3787#false} is VALID [2018-11-14 18:48:47,597 INFO L273 TraceCheckUtils]: 55: Hoare triple {3787#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {3787#false} is VALID [2018-11-14 18:48:47,597 INFO L256 TraceCheckUtils]: 56: Hoare triple {3787#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {3787#false} is VALID [2018-11-14 18:48:47,597 INFO L273 TraceCheckUtils]: 57: Hoare triple {3787#false} ~cond := #in~cond; {3787#false} is VALID [2018-11-14 18:48:47,597 INFO L273 TraceCheckUtils]: 58: Hoare triple {3787#false} assume ~cond == 0; {3787#false} is VALID [2018-11-14 18:48:47,597 INFO L273 TraceCheckUtils]: 59: Hoare triple {3787#false} assume !false; {3787#false} is VALID [2018-11-14 18:48:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-14 18:48:47,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:47,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-14 18:48:47,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-14 18:48:47,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:47,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:48:47,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:47,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:48:47,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:48:47,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:48:47,686 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 20 states. [2018-11-14 18:48:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:48,840 INFO L93 Difference]: Finished difference Result 197 states and 202 transitions. [2018-11-14 18:48:48,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:48:48,840 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-14 18:48:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:48:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2018-11-14 18:48:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:48:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2018-11-14 18:48:48,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2018-11-14 18:48:49,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:49,500 INFO L225 Difference]: With dead ends: 197 [2018-11-14 18:48:49,501 INFO L226 Difference]: Without dead ends: 161 [2018-11-14 18:48:49,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:48:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-14 18:48:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 71. [2018-11-14 18:48:49,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:49,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 71 states. [2018-11-14 18:48:49,739 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 71 states. [2018-11-14 18:48:49,739 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 71 states. [2018-11-14 18:48:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:49,744 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-11-14 18:48:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-11-14 18:48:49,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:49,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:49,745 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 161 states. [2018-11-14 18:48:49,750 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 161 states. [2018-11-14 18:48:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:49,755 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-11-14 18:48:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-11-14 18:48:49,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:49,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:49,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:49,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 18:48:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-14 18:48:49,758 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 60 [2018-11-14 18:48:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:49,759 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-14 18:48:49,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:48:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-14 18:48:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 18:48:49,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:49,760 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:49,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:49,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash -489833206, now seen corresponding path program 8 times [2018-11-14 18:48:49,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:48:49,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:51,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4660#true} is VALID [2018-11-14 18:48:51,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {4660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {4662#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:51,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {4662#(= |~#a~0.offset| 0)} assume true; {4662#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:51,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4662#(= |~#a~0.offset| 0)} {4660#true} #66#return; {4662#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:51,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {4662#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {4662#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:51,177 INFO L273 TraceCheckUtils]: 5: Hoare triple {4662#(= |~#a~0.offset| 0)} ~i~0 := 0; {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {4663#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:51,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:51,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:51,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {4664#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {4665#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:51,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:51,185 INFO L273 TraceCheckUtils]: 16: Hoare triple {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:51,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {4666#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:51,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:51,188 INFO L273 TraceCheckUtils]: 19: Hoare triple {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:51,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {4667#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,208 INFO L273 TraceCheckUtils]: 21: Hoare triple {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,224 INFO L273 TraceCheckUtils]: 22: Hoare triple {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {4668#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:51,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:51,229 INFO L273 TraceCheckUtils]: 25: Hoare triple {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:51,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {4669#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:51,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {4670#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4671#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:48:51,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume true; {4671#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:48:51,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume !(~i~0 < 100000); {4661#false} is VALID [2018-11-14 18:48:51,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {4661#false} ~i~0 := 0; {4661#false} is VALID [2018-11-14 18:48:51,234 INFO L273 TraceCheckUtils]: 33: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,235 INFO L273 TraceCheckUtils]: 36: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 43: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 44: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 45: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 49: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 51: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,237 INFO L273 TraceCheckUtils]: 56: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {4661#false} assume !(~i~0 < 50000); {4661#false} is VALID [2018-11-14 18:48:51,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {4661#false} ~i~0 := 0; {4672#(and (= |~#a~0.offset| ~i~0) (<= 99992 |~#a~0.offset|))} is VALID [2018-11-14 18:48:51,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#(and (= |~#a~0.offset| ~i~0) (<= 99992 |~#a~0.offset|))} assume true; {4672#(and (= |~#a~0.offset| ~i~0) (<= 99992 |~#a~0.offset|))} is VALID [2018-11-14 18:48:51,239 INFO L273 TraceCheckUtils]: 61: Hoare triple {4672#(and (= |~#a~0.offset| ~i~0) (<= 99992 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,239 INFO L256 TraceCheckUtils]: 62: Hoare triple {4661#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {4661#false} is VALID [2018-11-14 18:48:51,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {4661#false} ~cond := #in~cond; {4661#false} is VALID [2018-11-14 18:48:51,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {4661#false} assume ~cond == 0; {4661#false} is VALID [2018-11-14 18:48:51,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2018-11-14 18:48:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-14 18:48:51,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:51,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:51,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:48:51,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:48:51,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:51,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:51,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {4660#true} call ULTIMATE.init(); {4660#true} is VALID [2018-11-14 18:48:51,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {4660#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {4660#true} is VALID [2018-11-14 18:48:51,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {4660#true} assume true; {4660#true} is VALID [2018-11-14 18:48:51,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4660#true} {4660#true} #66#return; {4660#true} is VALID [2018-11-14 18:48:51,574 INFO L256 TraceCheckUtils]: 4: Hoare triple {4660#true} call #t~ret5 := main(); {4660#true} is VALID [2018-11-14 18:48:51,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {4660#true} ~i~0 := 0; {4691#(<= ~i~0 0)} is VALID [2018-11-14 18:48:51,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {4691#(<= ~i~0 0)} assume true; {4691#(<= ~i~0 0)} is VALID [2018-11-14 18:48:51,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {4691#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4691#(<= ~i~0 0)} is VALID [2018-11-14 18:48:51,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {4691#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4701#(<= ~i~0 1)} is VALID [2018-11-14 18:48:51,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {4701#(<= ~i~0 1)} assume true; {4701#(<= ~i~0 1)} is VALID [2018-11-14 18:48:51,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {4701#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4701#(<= ~i~0 1)} is VALID [2018-11-14 18:48:51,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {4701#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4711#(<= ~i~0 2)} is VALID [2018-11-14 18:48:51,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {4711#(<= ~i~0 2)} assume true; {4711#(<= ~i~0 2)} is VALID [2018-11-14 18:48:51,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {4711#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4711#(<= ~i~0 2)} is VALID [2018-11-14 18:48:51,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {4711#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4721#(<= ~i~0 3)} is VALID [2018-11-14 18:48:51,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {4721#(<= ~i~0 3)} assume true; {4721#(<= ~i~0 3)} is VALID [2018-11-14 18:48:51,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {4721#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4721#(<= ~i~0 3)} is VALID [2018-11-14 18:48:51,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {4721#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4731#(<= ~i~0 4)} is VALID [2018-11-14 18:48:51,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {4731#(<= ~i~0 4)} assume true; {4731#(<= ~i~0 4)} is VALID [2018-11-14 18:48:51,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {4731#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4731#(<= ~i~0 4)} is VALID [2018-11-14 18:48:51,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {4731#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4741#(<= ~i~0 5)} is VALID [2018-11-14 18:48:51,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {4741#(<= ~i~0 5)} assume true; {4741#(<= ~i~0 5)} is VALID [2018-11-14 18:48:51,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {4741#(<= ~i~0 5)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4741#(<= ~i~0 5)} is VALID [2018-11-14 18:48:51,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {4741#(<= ~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4751#(<= ~i~0 6)} is VALID [2018-11-14 18:48:51,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {4751#(<= ~i~0 6)} assume true; {4751#(<= ~i~0 6)} is VALID [2018-11-14 18:48:51,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {4751#(<= ~i~0 6)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4751#(<= ~i~0 6)} is VALID [2018-11-14 18:48:51,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {4751#(<= ~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4761#(<= ~i~0 7)} is VALID [2018-11-14 18:48:51,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {4761#(<= ~i~0 7)} assume true; {4761#(<= ~i~0 7)} is VALID [2018-11-14 18:48:51,587 INFO L273 TraceCheckUtils]: 28: Hoare triple {4761#(<= ~i~0 7)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4761#(<= ~i~0 7)} is VALID [2018-11-14 18:48:51,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {4761#(<= ~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4771#(<= ~i~0 8)} is VALID [2018-11-14 18:48:51,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {4771#(<= ~i~0 8)} assume true; {4771#(<= ~i~0 8)} is VALID [2018-11-14 18:48:51,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {4771#(<= ~i~0 8)} assume !(~i~0 < 100000); {4661#false} is VALID [2018-11-14 18:48:51,589 INFO L273 TraceCheckUtils]: 32: Hoare triple {4661#false} ~i~0 := 0; {4661#false} is VALID [2018-11-14 18:48:51,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,591 INFO L273 TraceCheckUtils]: 39: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,591 INFO L273 TraceCheckUtils]: 41: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,591 INFO L273 TraceCheckUtils]: 42: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 43: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 44: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 45: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 47: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 48: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 49: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 50: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,592 INFO L273 TraceCheckUtils]: 51: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 55: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 56: Hoare triple {4661#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 57: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {4661#false} assume !(~i~0 < 50000); {4661#false} is VALID [2018-11-14 18:48:51,593 INFO L273 TraceCheckUtils]: 59: Hoare triple {4661#false} ~i~0 := 0; {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {4661#false} assume true; {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {4661#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L256 TraceCheckUtils]: 62: Hoare triple {4661#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L273 TraceCheckUtils]: 63: Hoare triple {4661#false} ~cond := #in~cond; {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L273 TraceCheckUtils]: 64: Hoare triple {4661#false} assume ~cond == 0; {4661#false} is VALID [2018-11-14 18:48:51,594 INFO L273 TraceCheckUtils]: 65: Hoare triple {4661#false} assume !false; {4661#false} is VALID [2018-11-14 18:48:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-14 18:48:51,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:51,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-14 18:48:51,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2018-11-14 18:48:51,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:51,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:48:51,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:51,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:48:51,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:48:51,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:48:51,693 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 22 states. [2018-11-14 18:48:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:53,608 INFO L93 Difference]: Finished difference Result 217 states and 222 transitions. [2018-11-14 18:48:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:48:53,609 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2018-11-14 18:48:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:48:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-14 18:48:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:48:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-14 18:48:53,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 199 transitions. [2018-11-14 18:48:53,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:53,839 INFO L225 Difference]: With dead ends: 217 [2018-11-14 18:48:53,839 INFO L226 Difference]: Without dead ends: 178 [2018-11-14 18:48:53,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:48:53,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-14 18:48:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 77. [2018-11-14 18:48:53,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:53,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand 77 states. [2018-11-14 18:48:53,970 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 77 states. [2018-11-14 18:48:53,971 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 77 states. [2018-11-14 18:48:53,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:53,977 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2018-11-14 18:48:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-11-14 18:48:53,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:53,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:53,978 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 178 states. [2018-11-14 18:48:53,978 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 178 states. [2018-11-14 18:48:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:53,984 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2018-11-14 18:48:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-11-14 18:48:53,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:53,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:53,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:53,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:48:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-11-14 18:48:53,988 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 66 [2018-11-14 18:48:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-11-14 18:48:53,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:48:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-14 18:48:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-14 18:48:53,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:53,990 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:53,990 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -471412121, now seen corresponding path program 9 times [2018-11-14 18:48:53,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:53,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:53,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:54,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {5622#true} call ULTIMATE.init(); {5622#true} is VALID [2018-11-14 18:48:54,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {5622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {5624#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:54,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {5624#(= |~#a~0.offset| 0)} assume true; {5624#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:54,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5624#(= |~#a~0.offset| 0)} {5622#true} #66#return; {5624#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:54,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {5624#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {5624#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:48:54,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {5624#(= |~#a~0.offset| 0)} ~i~0 := 0; {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {5625#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:54,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:54,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:48:54,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {5626#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {5627#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:54,657 INFO L273 TraceCheckUtils]: 15: Hoare triple {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:54,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:48:54,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {5628#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:54,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:54,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:48:54,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {5629#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {5630#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:54,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:54,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:48:54,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {5631#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,735 INFO L273 TraceCheckUtils]: 27: Hoare triple {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:48:54,736 INFO L273 TraceCheckUtils]: 29: Hoare triple {5632#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:48:54,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume true; {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:48:54,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:48:54,763 INFO L273 TraceCheckUtils]: 32: Hoare triple {5633#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5634#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:48:54,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {5634#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume true; {5634#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:48:54,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {5634#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume !(~i~0 < 100000); {5623#false} is VALID [2018-11-14 18:48:54,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {5623#false} ~i~0 := 0; {5623#false} is VALID [2018-11-14 18:48:54,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,777 INFO L273 TraceCheckUtils]: 37: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,777 INFO L273 TraceCheckUtils]: 38: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 41: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 44: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,778 INFO L273 TraceCheckUtils]: 45: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 46: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 47: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 51: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,780 INFO L273 TraceCheckUtils]: 53: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,780 INFO L273 TraceCheckUtils]: 55: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,780 INFO L273 TraceCheckUtils]: 56: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,780 INFO L273 TraceCheckUtils]: 57: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,781 INFO L273 TraceCheckUtils]: 58: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,781 INFO L273 TraceCheckUtils]: 59: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,781 INFO L273 TraceCheckUtils]: 60: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,781 INFO L273 TraceCheckUtils]: 61: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,781 INFO L273 TraceCheckUtils]: 62: Hoare triple {5623#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5623#false} is VALID [2018-11-14 18:48:54,782 INFO L273 TraceCheckUtils]: 63: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:54,782 INFO L273 TraceCheckUtils]: 64: Hoare triple {5623#false} assume !(~i~0 < 50000); {5623#false} is VALID [2018-11-14 18:48:54,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {5623#false} ~i~0 := 0; {5635#(and (= |~#a~0.offset| ~i~0) (<= 99991 |~#a~0.offset|))} is VALID [2018-11-14 18:48:54,792 INFO L273 TraceCheckUtils]: 66: Hoare triple {5635#(and (= |~#a~0.offset| ~i~0) (<= 99991 |~#a~0.offset|))} assume true; {5635#(and (= |~#a~0.offset| ~i~0) (<= 99991 |~#a~0.offset|))} is VALID [2018-11-14 18:48:54,793 INFO L273 TraceCheckUtils]: 67: Hoare triple {5635#(and (= |~#a~0.offset| ~i~0) (<= 99991 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:54,793 INFO L256 TraceCheckUtils]: 68: Hoare triple {5623#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {5623#false} is VALID [2018-11-14 18:48:54,793 INFO L273 TraceCheckUtils]: 69: Hoare triple {5623#false} ~cond := #in~cond; {5623#false} is VALID [2018-11-14 18:48:54,793 INFO L273 TraceCheckUtils]: 70: Hoare triple {5623#false} assume ~cond == 0; {5623#false} is VALID [2018-11-14 18:48:54,794 INFO L273 TraceCheckUtils]: 71: Hoare triple {5623#false} assume !false; {5623#false} is VALID [2018-11-14 18:48:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 18:48:54,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:48:54,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:48:54,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:48:56,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:48:56,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:48:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:48:56,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:48:56,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {5622#true} call ULTIMATE.init(); {5622#true} is VALID [2018-11-14 18:48:56,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {5622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {5622#true} is VALID [2018-11-14 18:48:56,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,876 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5622#true} {5622#true} #66#return; {5622#true} is VALID [2018-11-14 18:48:56,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {5622#true} call #t~ret5 := main(); {5622#true} is VALID [2018-11-14 18:48:56,877 INFO L273 TraceCheckUtils]: 5: Hoare triple {5622#true} ~i~0 := 0; {5622#true} is VALID [2018-11-14 18:48:56,877 INFO L273 TraceCheckUtils]: 6: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 21: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 22: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 24: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {5622#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5622#true} is VALID [2018-11-14 18:48:56,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {5622#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5622#true} is VALID [2018-11-14 18:48:56,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {5622#true} assume true; {5622#true} is VALID [2018-11-14 18:48:56,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {5622#true} assume !(~i~0 < 100000); {5622#true} is VALID [2018-11-14 18:48:56,881 INFO L273 TraceCheckUtils]: 35: Hoare triple {5622#true} ~i~0 := 0; {5744#(<= ~i~0 0)} is VALID [2018-11-14 18:48:56,881 INFO L273 TraceCheckUtils]: 36: Hoare triple {5744#(<= ~i~0 0)} assume true; {5744#(<= ~i~0 0)} is VALID [2018-11-14 18:48:56,882 INFO L273 TraceCheckUtils]: 37: Hoare triple {5744#(<= ~i~0 0)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5744#(<= ~i~0 0)} is VALID [2018-11-14 18:48:56,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {5744#(<= ~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5754#(<= ~i~0 1)} is VALID [2018-11-14 18:48:56,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {5754#(<= ~i~0 1)} assume true; {5754#(<= ~i~0 1)} is VALID [2018-11-14 18:48:56,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {5754#(<= ~i~0 1)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5754#(<= ~i~0 1)} is VALID [2018-11-14 18:48:56,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {5754#(<= ~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#(<= ~i~0 2)} is VALID [2018-11-14 18:48:56,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {5764#(<= ~i~0 2)} assume true; {5764#(<= ~i~0 2)} is VALID [2018-11-14 18:48:56,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#(<= ~i~0 2)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5764#(<= ~i~0 2)} is VALID [2018-11-14 18:48:56,885 INFO L273 TraceCheckUtils]: 44: Hoare triple {5764#(<= ~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5774#(<= ~i~0 3)} is VALID [2018-11-14 18:48:56,886 INFO L273 TraceCheckUtils]: 45: Hoare triple {5774#(<= ~i~0 3)} assume true; {5774#(<= ~i~0 3)} is VALID [2018-11-14 18:48:56,886 INFO L273 TraceCheckUtils]: 46: Hoare triple {5774#(<= ~i~0 3)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5774#(<= ~i~0 3)} is VALID [2018-11-14 18:48:56,887 INFO L273 TraceCheckUtils]: 47: Hoare triple {5774#(<= ~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5784#(<= ~i~0 4)} is VALID [2018-11-14 18:48:56,887 INFO L273 TraceCheckUtils]: 48: Hoare triple {5784#(<= ~i~0 4)} assume true; {5784#(<= ~i~0 4)} is VALID [2018-11-14 18:48:56,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {5784#(<= ~i~0 4)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5784#(<= ~i~0 4)} is VALID [2018-11-14 18:48:56,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {5784#(<= ~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5794#(<= ~i~0 5)} is VALID [2018-11-14 18:48:56,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {5794#(<= ~i~0 5)} assume true; {5794#(<= ~i~0 5)} is VALID [2018-11-14 18:48:56,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {5794#(<= ~i~0 5)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5794#(<= ~i~0 5)} is VALID [2018-11-14 18:48:56,890 INFO L273 TraceCheckUtils]: 53: Hoare triple {5794#(<= ~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5804#(<= ~i~0 6)} is VALID [2018-11-14 18:48:56,891 INFO L273 TraceCheckUtils]: 54: Hoare triple {5804#(<= ~i~0 6)} assume true; {5804#(<= ~i~0 6)} is VALID [2018-11-14 18:48:56,892 INFO L273 TraceCheckUtils]: 55: Hoare triple {5804#(<= ~i~0 6)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5804#(<= ~i~0 6)} is VALID [2018-11-14 18:48:56,892 INFO L273 TraceCheckUtils]: 56: Hoare triple {5804#(<= ~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5814#(<= ~i~0 7)} is VALID [2018-11-14 18:48:56,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {5814#(<= ~i~0 7)} assume true; {5814#(<= ~i~0 7)} is VALID [2018-11-14 18:48:56,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {5814#(<= ~i~0 7)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5814#(<= ~i~0 7)} is VALID [2018-11-14 18:48:56,894 INFO L273 TraceCheckUtils]: 59: Hoare triple {5814#(<= ~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5824#(<= ~i~0 8)} is VALID [2018-11-14 18:48:56,895 INFO L273 TraceCheckUtils]: 60: Hoare triple {5824#(<= ~i~0 8)} assume true; {5824#(<= ~i~0 8)} is VALID [2018-11-14 18:48:56,895 INFO L273 TraceCheckUtils]: 61: Hoare triple {5824#(<= ~i~0 8)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5824#(<= ~i~0 8)} is VALID [2018-11-14 18:48:56,896 INFO L273 TraceCheckUtils]: 62: Hoare triple {5824#(<= ~i~0 8)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5834#(<= ~i~0 9)} is VALID [2018-11-14 18:48:56,896 INFO L273 TraceCheckUtils]: 63: Hoare triple {5834#(<= ~i~0 9)} assume true; {5834#(<= ~i~0 9)} is VALID [2018-11-14 18:48:56,897 INFO L273 TraceCheckUtils]: 64: Hoare triple {5834#(<= ~i~0 9)} assume !(~i~0 < 50000); {5623#false} is VALID [2018-11-14 18:48:56,897 INFO L273 TraceCheckUtils]: 65: Hoare triple {5623#false} ~i~0 := 0; {5623#false} is VALID [2018-11-14 18:48:56,897 INFO L273 TraceCheckUtils]: 66: Hoare triple {5623#false} assume true; {5623#false} is VALID [2018-11-14 18:48:56,898 INFO L273 TraceCheckUtils]: 67: Hoare triple {5623#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {5623#false} is VALID [2018-11-14 18:48:56,898 INFO L256 TraceCheckUtils]: 68: Hoare triple {5623#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {5623#false} is VALID [2018-11-14 18:48:56,898 INFO L273 TraceCheckUtils]: 69: Hoare triple {5623#false} ~cond := #in~cond; {5623#false} is VALID [2018-11-14 18:48:56,898 INFO L273 TraceCheckUtils]: 70: Hoare triple {5623#false} assume ~cond == 0; {5623#false} is VALID [2018-11-14 18:48:56,899 INFO L273 TraceCheckUtils]: 71: Hoare triple {5623#false} assume !false; {5623#false} is VALID [2018-11-14 18:48:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 18:48:56,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:48:56,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-11-14 18:48:56,925 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-11-14 18:48:56,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:48:56,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:48:57,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:57,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:48:57,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:48:57,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:48:57,189 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 24 states. [2018-11-14 18:48:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:59,024 INFO L93 Difference]: Finished difference Result 237 states and 242 transitions. [2018-11-14 18:48:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:48:59,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-11-14 18:48:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:48:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:48:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2018-11-14 18:48:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:48:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2018-11-14 18:48:59,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 216 transitions. [2018-11-14 18:48:59,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:48:59,608 INFO L225 Difference]: With dead ends: 237 [2018-11-14 18:48:59,609 INFO L226 Difference]: Without dead ends: 195 [2018-11-14 18:48:59,609 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:48:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-14 18:48:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 83. [2018-11-14 18:48:59,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:48:59,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 83 states. [2018-11-14 18:48:59,682 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 83 states. [2018-11-14 18:48:59,682 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 83 states. [2018-11-14 18:48:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:59,687 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-11-14 18:48:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-11-14 18:48:59,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:59,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:59,688 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 195 states. [2018-11-14 18:48:59,688 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 195 states. [2018-11-14 18:48:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:48:59,693 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-11-14 18:48:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-11-14 18:48:59,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:48:59,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:48:59,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:48:59,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:48:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:48:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-14 18:48:59,696 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 72 [2018-11-14 18:48:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:48:59,697 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-14 18:48:59,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:48:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-14 18:48:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-14 18:48:59,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:48:59,698 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:48:59,698 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:48:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:48:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash -827270230, now seen corresponding path program 10 times [2018-11-14 18:48:59,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:48:59,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:48:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:59,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:48:59,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:48:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:00,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {6672#true} call ULTIMATE.init(); {6672#true} is VALID [2018-11-14 18:49:00,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {6672#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {6674#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:00,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {6674#(= |~#a~0.offset| 0)} assume true; {6674#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:00,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6674#(= |~#a~0.offset| 0)} {6672#true} #66#return; {6674#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:00,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {6674#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {6674#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:00,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {6674#(= |~#a~0.offset| 0)} ~i~0 := 0; {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {6675#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:00,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:00,331 INFO L273 TraceCheckUtils]: 10: Hoare triple {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:00,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {6676#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {6677#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:00,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:00,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:00,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {6678#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:00,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:00,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:00,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {6679#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {6680#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:00,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:00,343 INFO L273 TraceCheckUtils]: 25: Hoare triple {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:00,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {6681#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:00,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {6682#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:00,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume true; {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:00,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:00,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {6683#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:00,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume true; {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:00,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:00,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {6684#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6685#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:00,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {6685#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume true; {6685#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:00,352 INFO L273 TraceCheckUtils]: 37: Hoare triple {6685#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume !(~i~0 < 100000); {6673#false} is VALID [2018-11-14 18:49:00,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {6673#false} ~i~0 := 0; {6673#false} is VALID [2018-11-14 18:49:00,352 INFO L273 TraceCheckUtils]: 39: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,353 INFO L273 TraceCheckUtils]: 41: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,353 INFO L273 TraceCheckUtils]: 42: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,353 INFO L273 TraceCheckUtils]: 43: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,353 INFO L273 TraceCheckUtils]: 44: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,354 INFO L273 TraceCheckUtils]: 45: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,354 INFO L273 TraceCheckUtils]: 47: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 50: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 51: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 53: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 54: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,355 INFO L273 TraceCheckUtils]: 55: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 56: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 58: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 59: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 60: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 61: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,356 INFO L273 TraceCheckUtils]: 62: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 63: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 64: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 65: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 66: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 67: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 68: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 69: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,357 INFO L273 TraceCheckUtils]: 70: Hoare triple {6673#false} assume !(~i~0 < 50000); {6673#false} is VALID [2018-11-14 18:49:00,358 INFO L273 TraceCheckUtils]: 71: Hoare triple {6673#false} ~i~0 := 0; {6686#(and (= |~#a~0.offset| ~i~0) (<= 99990 |~#a~0.offset|))} is VALID [2018-11-14 18:49:00,358 INFO L273 TraceCheckUtils]: 72: Hoare triple {6686#(and (= |~#a~0.offset| ~i~0) (<= 99990 |~#a~0.offset|))} assume true; {6686#(and (= |~#a~0.offset| ~i~0) (<= 99990 |~#a~0.offset|))} is VALID [2018-11-14 18:49:00,359 INFO L273 TraceCheckUtils]: 73: Hoare triple {6686#(and (= |~#a~0.offset| ~i~0) (<= 99990 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,359 INFO L256 TraceCheckUtils]: 74: Hoare triple {6673#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {6673#false} is VALID [2018-11-14 18:49:00,359 INFO L273 TraceCheckUtils]: 75: Hoare triple {6673#false} ~cond := #in~cond; {6673#false} is VALID [2018-11-14 18:49:00,359 INFO L273 TraceCheckUtils]: 76: Hoare triple {6673#false} assume ~cond == 0; {6673#false} is VALID [2018-11-14 18:49:00,359 INFO L273 TraceCheckUtils]: 77: Hoare triple {6673#false} assume !false; {6673#false} is VALID [2018-11-14 18:49:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-14 18:49:00,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:49:00,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:49:00,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:49:00,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:49:00,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:49:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:00,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:49:00,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {6672#true} call ULTIMATE.init(); {6672#true} is VALID [2018-11-14 18:49:00,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {6672#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {6672#true} is VALID [2018-11-14 18:49:00,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {6672#true} assume true; {6672#true} is VALID [2018-11-14 18:49:00,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6672#true} {6672#true} #66#return; {6672#true} is VALID [2018-11-14 18:49:00,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {6672#true} call #t~ret5 := main(); {6672#true} is VALID [2018-11-14 18:49:00,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {6672#true} ~i~0 := 0; {6705#(<= ~i~0 0)} is VALID [2018-11-14 18:49:00,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {6705#(<= ~i~0 0)} assume true; {6705#(<= ~i~0 0)} is VALID [2018-11-14 18:49:00,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {6705#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6705#(<= ~i~0 0)} is VALID [2018-11-14 18:49:00,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {6705#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6715#(<= ~i~0 1)} is VALID [2018-11-14 18:49:00,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {6715#(<= ~i~0 1)} assume true; {6715#(<= ~i~0 1)} is VALID [2018-11-14 18:49:00,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {6715#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6715#(<= ~i~0 1)} is VALID [2018-11-14 18:49:00,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {6715#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6725#(<= ~i~0 2)} is VALID [2018-11-14 18:49:00,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(<= ~i~0 2)} assume true; {6725#(<= ~i~0 2)} is VALID [2018-11-14 18:49:00,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6725#(<= ~i~0 2)} is VALID [2018-11-14 18:49:00,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {6725#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6735#(<= ~i~0 3)} is VALID [2018-11-14 18:49:00,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {6735#(<= ~i~0 3)} assume true; {6735#(<= ~i~0 3)} is VALID [2018-11-14 18:49:00,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {6735#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6735#(<= ~i~0 3)} is VALID [2018-11-14 18:49:00,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {6735#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6745#(<= ~i~0 4)} is VALID [2018-11-14 18:49:00,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {6745#(<= ~i~0 4)} assume true; {6745#(<= ~i~0 4)} is VALID [2018-11-14 18:49:00,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {6745#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6745#(<= ~i~0 4)} is VALID [2018-11-14 18:49:00,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {6745#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6755#(<= ~i~0 5)} is VALID [2018-11-14 18:49:00,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {6755#(<= ~i~0 5)} assume true; {6755#(<= ~i~0 5)} is VALID [2018-11-14 18:49:00,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {6755#(<= ~i~0 5)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6755#(<= ~i~0 5)} is VALID [2018-11-14 18:49:00,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {6755#(<= ~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6765#(<= ~i~0 6)} is VALID [2018-11-14 18:49:00,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {6765#(<= ~i~0 6)} assume true; {6765#(<= ~i~0 6)} is VALID [2018-11-14 18:49:00,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {6765#(<= ~i~0 6)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6765#(<= ~i~0 6)} is VALID [2018-11-14 18:49:00,737 INFO L273 TraceCheckUtils]: 26: Hoare triple {6765#(<= ~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6775#(<= ~i~0 7)} is VALID [2018-11-14 18:49:00,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {6775#(<= ~i~0 7)} assume true; {6775#(<= ~i~0 7)} is VALID [2018-11-14 18:49:00,738 INFO L273 TraceCheckUtils]: 28: Hoare triple {6775#(<= ~i~0 7)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6775#(<= ~i~0 7)} is VALID [2018-11-14 18:49:00,739 INFO L273 TraceCheckUtils]: 29: Hoare triple {6775#(<= ~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6785#(<= ~i~0 8)} is VALID [2018-11-14 18:49:00,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {6785#(<= ~i~0 8)} assume true; {6785#(<= ~i~0 8)} is VALID [2018-11-14 18:49:00,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {6785#(<= ~i~0 8)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6785#(<= ~i~0 8)} is VALID [2018-11-14 18:49:00,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {6785#(<= ~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6795#(<= ~i~0 9)} is VALID [2018-11-14 18:49:00,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {6795#(<= ~i~0 9)} assume true; {6795#(<= ~i~0 9)} is VALID [2018-11-14 18:49:00,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {6795#(<= ~i~0 9)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6795#(<= ~i~0 9)} is VALID [2018-11-14 18:49:00,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {6795#(<= ~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6805#(<= ~i~0 10)} is VALID [2018-11-14 18:49:00,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {6805#(<= ~i~0 10)} assume true; {6805#(<= ~i~0 10)} is VALID [2018-11-14 18:49:00,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {6805#(<= ~i~0 10)} assume !(~i~0 < 100000); {6673#false} is VALID [2018-11-14 18:49:00,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {6673#false} ~i~0 := 0; {6673#false} is VALID [2018-11-14 18:49:00,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,744 INFO L273 TraceCheckUtils]: 42: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,744 INFO L273 TraceCheckUtils]: 44: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,745 INFO L273 TraceCheckUtils]: 45: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,745 INFO L273 TraceCheckUtils]: 46: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,745 INFO L273 TraceCheckUtils]: 47: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 51: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 52: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 53: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 54: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 55: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,746 INFO L273 TraceCheckUtils]: 57: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 61: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 62: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 63: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 64: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 65: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,747 INFO L273 TraceCheckUtils]: 66: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 67: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 68: Hoare triple {6673#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 69: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 70: Hoare triple {6673#false} assume !(~i~0 < 50000); {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {6673#false} ~i~0 := 0; {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 72: Hoare triple {6673#false} assume true; {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {6673#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {6673#false} is VALID [2018-11-14 18:49:00,748 INFO L256 TraceCheckUtils]: 74: Hoare triple {6673#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {6673#false} is VALID [2018-11-14 18:49:00,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {6673#false} ~cond := #in~cond; {6673#false} is VALID [2018-11-14 18:49:00,749 INFO L273 TraceCheckUtils]: 76: Hoare triple {6673#false} assume ~cond == 0; {6673#false} is VALID [2018-11-14 18:49:00,749 INFO L273 TraceCheckUtils]: 77: Hoare triple {6673#false} assume !false; {6673#false} is VALID [2018-11-14 18:49:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-14 18:49:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:49:00,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-11-14 18:49:00,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 78 [2018-11-14 18:49:00,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:49:00,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:49:00,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:49:00,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:49:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:49:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:49:00,859 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 26 states. [2018-11-14 18:49:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:02,606 INFO L93 Difference]: Finished difference Result 257 states and 262 transitions. [2018-11-14 18:49:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:49:02,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 78 [2018-11-14 18:49:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:49:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:49:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 233 transitions. [2018-11-14 18:49:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:49:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 233 transitions. [2018-11-14 18:49:02,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 233 transitions. [2018-11-14 18:49:03,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:49:03,172 INFO L225 Difference]: With dead ends: 257 [2018-11-14 18:49:03,172 INFO L226 Difference]: Without dead ends: 212 [2018-11-14 18:49:03,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:49:03,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-14 18:49:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 89. [2018-11-14 18:49:03,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:49:03,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 89 states. [2018-11-14 18:49:03,286 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 89 states. [2018-11-14 18:49:03,286 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 89 states. [2018-11-14 18:49:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:03,292 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-11-14 18:49:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-11-14 18:49:03,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:49:03,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:49:03,293 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 212 states. [2018-11-14 18:49:03,293 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 212 states. [2018-11-14 18:49:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:03,299 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-11-14 18:49:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-11-14 18:49:03,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:49:03,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:49:03,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:49:03,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:49:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 18:49:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-14 18:49:03,302 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 78 [2018-11-14 18:49:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:49:03,303 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-14 18:49:03,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:49:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-14 18:49:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-14 18:49:03,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:49:03,304 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:49:03,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:49:03,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:49:03,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1484730553, now seen corresponding path program 11 times [2018-11-14 18:49:03,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:49:03,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:49:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:49:03,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:49:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:49:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:04,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {7810#true} call ULTIMATE.init(); {7810#true} is VALID [2018-11-14 18:49:04,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {7810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {7812#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:04,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {7812#(= |~#a~0.offset| 0)} assume true; {7812#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:04,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7812#(= |~#a~0.offset| 0)} {7810#true} #66#return; {7812#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:04,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {7812#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {7812#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:04,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {7812#(= |~#a~0.offset| 0)} ~i~0 := 0; {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {7813#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:04,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:04,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:04,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {7814#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,158 INFO L273 TraceCheckUtils]: 14: Hoare triple {7815#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:04,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:04,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:04,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {7816#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:04,162 INFO L273 TraceCheckUtils]: 18: Hoare triple {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:04,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:04,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {7817#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,165 INFO L273 TraceCheckUtils]: 22: Hoare triple {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,166 INFO L273 TraceCheckUtils]: 23: Hoare triple {7818#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:04,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:04,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:04,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {7819#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {7820#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:04,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume true; {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:04,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:04,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {7821#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:04,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume true; {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:04,175 INFO L273 TraceCheckUtils]: 34: Hoare triple {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:04,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {7822#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:04,177 INFO L273 TraceCheckUtils]: 36: Hoare triple {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume true; {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:04,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:04,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {7823#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7824#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,180 INFO L273 TraceCheckUtils]: 39: Hoare triple {7824#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} assume true; {7824#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:04,181 INFO L273 TraceCheckUtils]: 40: Hoare triple {7824#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} assume !(~i~0 < 100000); {7811#false} is VALID [2018-11-14 18:49:04,181 INFO L273 TraceCheckUtils]: 41: Hoare triple {7811#false} ~i~0 := 0; {7811#false} is VALID [2018-11-14 18:49:04,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,182 INFO L273 TraceCheckUtils]: 46: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 50: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 51: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 52: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 53: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,183 INFO L273 TraceCheckUtils]: 54: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 55: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 56: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 58: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 59: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 60: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 61: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 62: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,184 INFO L273 TraceCheckUtils]: 63: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 64: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 65: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 66: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 67: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 69: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 70: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,185 INFO L273 TraceCheckUtils]: 71: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 72: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 73: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {7811#false} assume !(~i~0 < 50000); {7811#false} is VALID [2018-11-14 18:49:04,186 INFO L273 TraceCheckUtils]: 77: Hoare triple {7811#false} ~i~0 := 0; {7825#(and (= |~#a~0.offset| ~i~0) (<= 99989 |~#a~0.offset|))} is VALID [2018-11-14 18:49:04,187 INFO L273 TraceCheckUtils]: 78: Hoare triple {7825#(and (= |~#a~0.offset| ~i~0) (<= 99989 |~#a~0.offset|))} assume true; {7825#(and (= |~#a~0.offset| ~i~0) (<= 99989 |~#a~0.offset|))} is VALID [2018-11-14 18:49:04,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {7825#(and (= |~#a~0.offset| ~i~0) (<= 99989 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:04,187 INFO L256 TraceCheckUtils]: 80: Hoare triple {7811#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {7811#false} is VALID [2018-11-14 18:49:04,188 INFO L273 TraceCheckUtils]: 81: Hoare triple {7811#false} ~cond := #in~cond; {7811#false} is VALID [2018-11-14 18:49:04,188 INFO L273 TraceCheckUtils]: 82: Hoare triple {7811#false} assume ~cond == 0; {7811#false} is VALID [2018-11-14 18:49:04,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2018-11-14 18:49:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:49:04,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:49:04,197 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:49:04,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:49:16,053 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:49:16,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:49:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:16,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:49:16,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {7810#true} call ULTIMATE.init(); {7810#true} is VALID [2018-11-14 18:49:16,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {7810#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {7810#true} is VALID [2018-11-14 18:49:16,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {7810#true} assume true; {7810#true} is VALID [2018-11-14 18:49:16,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7810#true} {7810#true} #66#return; {7810#true} is VALID [2018-11-14 18:49:16,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {7810#true} call #t~ret5 := main(); {7810#true} is VALID [2018-11-14 18:49:16,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {7810#true} ~i~0 := 0; {7844#(<= ~i~0 0)} is VALID [2018-11-14 18:49:16,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {7844#(<= ~i~0 0)} assume true; {7844#(<= ~i~0 0)} is VALID [2018-11-14 18:49:16,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {7844#(<= ~i~0 0)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7844#(<= ~i~0 0)} is VALID [2018-11-14 18:49:16,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {7844#(<= ~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7854#(<= ~i~0 1)} is VALID [2018-11-14 18:49:16,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {7854#(<= ~i~0 1)} assume true; {7854#(<= ~i~0 1)} is VALID [2018-11-14 18:49:16,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {7854#(<= ~i~0 1)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7854#(<= ~i~0 1)} is VALID [2018-11-14 18:49:16,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {7854#(<= ~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7864#(<= ~i~0 2)} is VALID [2018-11-14 18:49:16,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {7864#(<= ~i~0 2)} assume true; {7864#(<= ~i~0 2)} is VALID [2018-11-14 18:49:16,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {7864#(<= ~i~0 2)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7864#(<= ~i~0 2)} is VALID [2018-11-14 18:49:16,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {7864#(<= ~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7874#(<= ~i~0 3)} is VALID [2018-11-14 18:49:16,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {7874#(<= ~i~0 3)} assume true; {7874#(<= ~i~0 3)} is VALID [2018-11-14 18:49:16,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {7874#(<= ~i~0 3)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7874#(<= ~i~0 3)} is VALID [2018-11-14 18:49:16,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {7874#(<= ~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7884#(<= ~i~0 4)} is VALID [2018-11-14 18:49:16,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {7884#(<= ~i~0 4)} assume true; {7884#(<= ~i~0 4)} is VALID [2018-11-14 18:49:16,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {7884#(<= ~i~0 4)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7884#(<= ~i~0 4)} is VALID [2018-11-14 18:49:16,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {7884#(<= ~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7894#(<= ~i~0 5)} is VALID [2018-11-14 18:49:16,383 INFO L273 TraceCheckUtils]: 21: Hoare triple {7894#(<= ~i~0 5)} assume true; {7894#(<= ~i~0 5)} is VALID [2018-11-14 18:49:16,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {7894#(<= ~i~0 5)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7894#(<= ~i~0 5)} is VALID [2018-11-14 18:49:16,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {7894#(<= ~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7904#(<= ~i~0 6)} is VALID [2018-11-14 18:49:16,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {7904#(<= ~i~0 6)} assume true; {7904#(<= ~i~0 6)} is VALID [2018-11-14 18:49:16,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {7904#(<= ~i~0 6)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7904#(<= ~i~0 6)} is VALID [2018-11-14 18:49:16,386 INFO L273 TraceCheckUtils]: 26: Hoare triple {7904#(<= ~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7914#(<= ~i~0 7)} is VALID [2018-11-14 18:49:16,386 INFO L273 TraceCheckUtils]: 27: Hoare triple {7914#(<= ~i~0 7)} assume true; {7914#(<= ~i~0 7)} is VALID [2018-11-14 18:49:16,387 INFO L273 TraceCheckUtils]: 28: Hoare triple {7914#(<= ~i~0 7)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7914#(<= ~i~0 7)} is VALID [2018-11-14 18:49:16,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {7914#(<= ~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7924#(<= ~i~0 8)} is VALID [2018-11-14 18:49:16,388 INFO L273 TraceCheckUtils]: 30: Hoare triple {7924#(<= ~i~0 8)} assume true; {7924#(<= ~i~0 8)} is VALID [2018-11-14 18:49:16,388 INFO L273 TraceCheckUtils]: 31: Hoare triple {7924#(<= ~i~0 8)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7924#(<= ~i~0 8)} is VALID [2018-11-14 18:49:16,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {7924#(<= ~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7934#(<= ~i~0 9)} is VALID [2018-11-14 18:49:16,389 INFO L273 TraceCheckUtils]: 33: Hoare triple {7934#(<= ~i~0 9)} assume true; {7934#(<= ~i~0 9)} is VALID [2018-11-14 18:49:16,390 INFO L273 TraceCheckUtils]: 34: Hoare triple {7934#(<= ~i~0 9)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7934#(<= ~i~0 9)} is VALID [2018-11-14 18:49:16,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {7934#(<= ~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7944#(<= ~i~0 10)} is VALID [2018-11-14 18:49:16,391 INFO L273 TraceCheckUtils]: 36: Hoare triple {7944#(<= ~i~0 10)} assume true; {7944#(<= ~i~0 10)} is VALID [2018-11-14 18:49:16,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {7944#(<= ~i~0 10)} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7944#(<= ~i~0 10)} is VALID [2018-11-14 18:49:16,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {7944#(<= ~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {7954#(<= ~i~0 11)} is VALID [2018-11-14 18:49:16,393 INFO L273 TraceCheckUtils]: 39: Hoare triple {7954#(<= ~i~0 11)} assume true; {7954#(<= ~i~0 11)} is VALID [2018-11-14 18:49:16,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {7954#(<= ~i~0 11)} assume !(~i~0 < 100000); {7811#false} is VALID [2018-11-14 18:49:16,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {7811#false} ~i~0 := 0; {7811#false} is VALID [2018-11-14 18:49:16,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,394 INFO L273 TraceCheckUtils]: 43: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,394 INFO L273 TraceCheckUtils]: 44: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 47: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 48: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 49: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 50: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 53: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 55: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 56: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 57: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 58: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 59: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,396 INFO L273 TraceCheckUtils]: 60: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 61: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 62: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 63: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 64: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 65: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 66: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 67: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 68: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,397 INFO L273 TraceCheckUtils]: 69: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 70: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 71: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 72: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 73: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 74: Hoare triple {7811#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 75: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 76: Hoare triple {7811#false} assume !(~i~0 < 50000); {7811#false} is VALID [2018-11-14 18:49:16,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {7811#false} ~i~0 := 0; {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L273 TraceCheckUtils]: 78: Hoare triple {7811#false} assume true; {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L273 TraceCheckUtils]: 79: Hoare triple {7811#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L256 TraceCheckUtils]: 80: Hoare triple {7811#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L273 TraceCheckUtils]: 81: Hoare triple {7811#false} ~cond := #in~cond; {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L273 TraceCheckUtils]: 82: Hoare triple {7811#false} assume ~cond == 0; {7811#false} is VALID [2018-11-14 18:49:16,399 INFO L273 TraceCheckUtils]: 83: Hoare triple {7811#false} assume !false; {7811#false} is VALID [2018-11-14 18:49:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:49:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:49:16,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-11-14 18:49:16,426 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-11-14 18:49:16,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:49:16,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:49:16,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:49:16,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:49:16,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:49:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:49:16,519 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 28 states. [2018-11-14 18:49:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:18,642 INFO L93 Difference]: Finished difference Result 277 states and 282 transitions. [2018-11-14 18:49:18,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:49:18,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-11-14 18:49:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:49:18,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:49:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 250 transitions. [2018-11-14 18:49:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:49:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 250 transitions. [2018-11-14 18:49:18,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 250 transitions. [2018-11-14 18:49:19,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:49:19,544 INFO L225 Difference]: With dead ends: 277 [2018-11-14 18:49:19,544 INFO L226 Difference]: Without dead ends: 229 [2018-11-14 18:49:19,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:49:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-14 18:49:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 95. [2018-11-14 18:49:19,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:49:19,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 95 states. [2018-11-14 18:49:19,640 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 95 states. [2018-11-14 18:49:19,640 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 95 states. [2018-11-14 18:49:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:19,648 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-11-14 18:49:19,648 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-11-14 18:49:19,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:49:19,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:49:19,649 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 229 states. [2018-11-14 18:49:19,649 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 229 states. [2018-11-14 18:49:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:49:19,655 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-11-14 18:49:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2018-11-14 18:49:19,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:49:19,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:49:19,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:49:19,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:49:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 18:49:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-11-14 18:49:19,658 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 84 [2018-11-14 18:49:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:49:19,658 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-11-14 18:49:19,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:49:19,659 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-14 18:49:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-14 18:49:19,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:49:19,660 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:49:19,660 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:49:19,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:49:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -144264630, now seen corresponding path program 12 times [2018-11-14 18:49:19,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:49:19,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:49:19,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:49:19,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:49:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:49:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:20,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {9036#true} call ULTIMATE.init(); {9036#true} is VALID [2018-11-14 18:49:20,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {9036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {9038#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:20,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {9038#(= |~#a~0.offset| 0)} assume true; {9038#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:20,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9038#(= |~#a~0.offset| 0)} {9036#true} #66#return; {9038#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:20,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {9038#(= |~#a~0.offset| 0)} call #t~ret5 := main(); {9038#(= |~#a~0.offset| 0)} is VALID [2018-11-14 18:49:20,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {9038#(= |~#a~0.offset| 0)} ~i~0 := 0; {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume true; {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {9039#(and (= |~#a~0.offset| ~i~0) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:20,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume true; {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:20,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} is VALID [2018-11-14 18:49:20,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {9040#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 1)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume true; {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {9041#(and (<= ~i~0 (+ |~#a~0.offset| 2)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:20,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume true; {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:20,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} is VALID [2018-11-14 18:49:20,395 INFO L273 TraceCheckUtils]: 17: Hoare triple {9042#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 3)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:20,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume true; {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:20,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} is VALID [2018-11-14 18:49:20,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {9043#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 4)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume true; {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,399 INFO L273 TraceCheckUtils]: 22: Hoare triple {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,400 INFO L273 TraceCheckUtils]: 23: Hoare triple {9044#(and (<= ~i~0 (+ |~#a~0.offset| 5)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:20,400 INFO L273 TraceCheckUtils]: 24: Hoare triple {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume true; {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:20,401 INFO L273 TraceCheckUtils]: 25: Hoare triple {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} is VALID [2018-11-14 18:49:20,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {9045#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 6)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume true; {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {9046#(and (<= ~i~0 (+ |~#a~0.offset| 7)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:20,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume true; {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:20,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} is VALID [2018-11-14 18:49:20,407 INFO L273 TraceCheckUtils]: 32: Hoare triple {9047#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 8)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:20,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume true; {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:20,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} is VALID [2018-11-14 18:49:20,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {9048#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 9)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:20,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume true; {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:20,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} is VALID [2018-11-14 18:49:20,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {9049#(and (= |~#a~0.offset| 0) (<= ~i~0 (+ |~#a~0.offset| 10)))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,413 INFO L273 TraceCheckUtils]: 39: Hoare triple {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} assume true; {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {9050#(and (<= ~i~0 (+ |~#a~0.offset| 11)) (= |~#a~0.offset| 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9051#(and (<= ~i~0 (+ |~#a~0.offset| 12)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {9051#(and (<= ~i~0 (+ |~#a~0.offset| 12)) (= |~#a~0.offset| 0))} assume true; {9051#(and (<= ~i~0 (+ |~#a~0.offset| 12)) (= |~#a~0.offset| 0))} is VALID [2018-11-14 18:49:20,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {9051#(and (<= ~i~0 (+ |~#a~0.offset| 12)) (= |~#a~0.offset| 0))} assume !(~i~0 < 100000); {9037#false} is VALID [2018-11-14 18:49:20,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {9037#false} ~i~0 := 0; {9037#false} is VALID [2018-11-14 18:49:20,417 INFO L273 TraceCheckUtils]: 45: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,419 INFO L273 TraceCheckUtils]: 59: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 68: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 73: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 74: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,421 INFO L273 TraceCheckUtils]: 75: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 76: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 77: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 78: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 79: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 80: Hoare triple {9037#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 81: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 82: Hoare triple {9037#false} assume !(~i~0 < 50000); {9037#false} is VALID [2018-11-14 18:49:20,422 INFO L273 TraceCheckUtils]: 83: Hoare triple {9037#false} ~i~0 := 0; {9052#(and (= |~#a~0.offset| ~i~0) (<= 99988 |~#a~0.offset|))} is VALID [2018-11-14 18:49:20,423 INFO L273 TraceCheckUtils]: 84: Hoare triple {9052#(and (= |~#a~0.offset| ~i~0) (<= 99988 |~#a~0.offset|))} assume true; {9052#(and (= |~#a~0.offset| ~i~0) (<= 99988 |~#a~0.offset|))} is VALID [2018-11-14 18:49:20,423 INFO L273 TraceCheckUtils]: 85: Hoare triple {9052#(and (= |~#a~0.offset| ~i~0) (<= 99988 |~#a~0.offset|))} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:20,424 INFO L256 TraceCheckUtils]: 86: Hoare triple {9037#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {9037#false} is VALID [2018-11-14 18:49:20,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {9037#false} ~cond := #in~cond; {9037#false} is VALID [2018-11-14 18:49:20,424 INFO L273 TraceCheckUtils]: 88: Hoare triple {9037#false} assume ~cond == 0; {9037#false} is VALID [2018-11-14 18:49:20,424 INFO L273 TraceCheckUtils]: 89: Hoare triple {9037#false} assume !false; {9037#false} is VALID [2018-11-14 18:49:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-14 18:49:20,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:49:20,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:49:20,443 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:49:58,930 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:49:58,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:49:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:49:58,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:49:59,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {9036#true} call ULTIMATE.init(); {9036#true} is VALID [2018-11-14 18:49:59,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {9036#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#a~0.base);~i~0 := 0; {9036#true} is VALID [2018-11-14 18:49:59,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9036#true} {9036#true} #66#return; {9036#true} is VALID [2018-11-14 18:49:59,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {9036#true} call #t~ret5 := main(); {9036#true} is VALID [2018-11-14 18:49:59,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {9036#true} ~i~0 := 0; {9036#true} is VALID [2018-11-14 18:49:59,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,339 INFO L273 TraceCheckUtils]: 9: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 13: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 24: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 36: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,343 INFO L273 TraceCheckUtils]: 38: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {9036#true} assume !!(~i~0 < 100000);call write~$Pointer$(0, 0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9036#true} is VALID [2018-11-14 18:49:59,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {9036#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {9036#true} is VALID [2018-11-14 18:49:59,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {9036#true} assume true; {9036#true} is VALID [2018-11-14 18:49:59,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {9036#true} assume !(~i~0 < 100000); {9036#true} is VALID [2018-11-14 18:49:59,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {9036#true} ~i~0 := 0; {9188#(<= ~i~0 0)} is VALID [2018-11-14 18:49:59,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {9188#(<= ~i~0 0)} assume true; {9188#(<= ~i~0 0)} is VALID [2018-11-14 18:49:59,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {9188#(<= ~i~0 0)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9188#(<= ~i~0 0)} is VALID [2018-11-14 18:49:59,362 INFO L273 TraceCheckUtils]: 47: Hoare triple {9188#(<= ~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9198#(<= ~i~0 1)} is VALID [2018-11-14 18:49:59,362 INFO L273 TraceCheckUtils]: 48: Hoare triple {9198#(<= ~i~0 1)} assume true; {9198#(<= ~i~0 1)} is VALID [2018-11-14 18:49:59,363 INFO L273 TraceCheckUtils]: 49: Hoare triple {9198#(<= ~i~0 1)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9198#(<= ~i~0 1)} is VALID [2018-11-14 18:49:59,363 INFO L273 TraceCheckUtils]: 50: Hoare triple {9198#(<= ~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9208#(<= ~i~0 2)} is VALID [2018-11-14 18:49:59,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {9208#(<= ~i~0 2)} assume true; {9208#(<= ~i~0 2)} is VALID [2018-11-14 18:49:59,364 INFO L273 TraceCheckUtils]: 52: Hoare triple {9208#(<= ~i~0 2)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9208#(<= ~i~0 2)} is VALID [2018-11-14 18:49:59,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {9208#(<= ~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9218#(<= ~i~0 3)} is VALID [2018-11-14 18:49:59,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {9218#(<= ~i~0 3)} assume true; {9218#(<= ~i~0 3)} is VALID [2018-11-14 18:49:59,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {9218#(<= ~i~0 3)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9218#(<= ~i~0 3)} is VALID [2018-11-14 18:49:59,366 INFO L273 TraceCheckUtils]: 56: Hoare triple {9218#(<= ~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9228#(<= ~i~0 4)} is VALID [2018-11-14 18:49:59,366 INFO L273 TraceCheckUtils]: 57: Hoare triple {9228#(<= ~i~0 4)} assume true; {9228#(<= ~i~0 4)} is VALID [2018-11-14 18:49:59,367 INFO L273 TraceCheckUtils]: 58: Hoare triple {9228#(<= ~i~0 4)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9228#(<= ~i~0 4)} is VALID [2018-11-14 18:49:59,368 INFO L273 TraceCheckUtils]: 59: Hoare triple {9228#(<= ~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9238#(<= ~i~0 5)} is VALID [2018-11-14 18:49:59,368 INFO L273 TraceCheckUtils]: 60: Hoare triple {9238#(<= ~i~0 5)} assume true; {9238#(<= ~i~0 5)} is VALID [2018-11-14 18:49:59,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {9238#(<= ~i~0 5)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9238#(<= ~i~0 5)} is VALID [2018-11-14 18:49:59,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {9238#(<= ~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9248#(<= ~i~0 6)} is VALID [2018-11-14 18:49:59,370 INFO L273 TraceCheckUtils]: 63: Hoare triple {9248#(<= ~i~0 6)} assume true; {9248#(<= ~i~0 6)} is VALID [2018-11-14 18:49:59,370 INFO L273 TraceCheckUtils]: 64: Hoare triple {9248#(<= ~i~0 6)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9248#(<= ~i~0 6)} is VALID [2018-11-14 18:49:59,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {9248#(<= ~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9258#(<= ~i~0 7)} is VALID [2018-11-14 18:49:59,372 INFO L273 TraceCheckUtils]: 66: Hoare triple {9258#(<= ~i~0 7)} assume true; {9258#(<= ~i~0 7)} is VALID [2018-11-14 18:49:59,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {9258#(<= ~i~0 7)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9258#(<= ~i~0 7)} is VALID [2018-11-14 18:49:59,373 INFO L273 TraceCheckUtils]: 68: Hoare triple {9258#(<= ~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9268#(<= ~i~0 8)} is VALID [2018-11-14 18:49:59,373 INFO L273 TraceCheckUtils]: 69: Hoare triple {9268#(<= ~i~0 8)} assume true; {9268#(<= ~i~0 8)} is VALID [2018-11-14 18:49:59,374 INFO L273 TraceCheckUtils]: 70: Hoare triple {9268#(<= ~i~0 8)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9268#(<= ~i~0 8)} is VALID [2018-11-14 18:49:59,375 INFO L273 TraceCheckUtils]: 71: Hoare triple {9268#(<= ~i~0 8)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9278#(<= ~i~0 9)} is VALID [2018-11-14 18:49:59,375 INFO L273 TraceCheckUtils]: 72: Hoare triple {9278#(<= ~i~0 9)} assume true; {9278#(<= ~i~0 9)} is VALID [2018-11-14 18:49:59,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {9278#(<= ~i~0 9)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9278#(<= ~i~0 9)} is VALID [2018-11-14 18:49:59,377 INFO L273 TraceCheckUtils]: 74: Hoare triple {9278#(<= ~i~0 9)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9288#(<= ~i~0 10)} is VALID [2018-11-14 18:49:59,377 INFO L273 TraceCheckUtils]: 75: Hoare triple {9288#(<= ~i~0 10)} assume true; {9288#(<= ~i~0 10)} is VALID [2018-11-14 18:49:59,378 INFO L273 TraceCheckUtils]: 76: Hoare triple {9288#(<= ~i~0 10)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9288#(<= ~i~0 10)} is VALID [2018-11-14 18:49:59,378 INFO L273 TraceCheckUtils]: 77: Hoare triple {9288#(<= ~i~0 10)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9298#(<= ~i~0 11)} is VALID [2018-11-14 18:49:59,379 INFO L273 TraceCheckUtils]: 78: Hoare triple {9298#(<= ~i~0 11)} assume true; {9298#(<= ~i~0 11)} is VALID [2018-11-14 18:49:59,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {9298#(<= ~i~0 11)} assume !!(~i~0 < 50000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9298#(<= ~i~0 11)} is VALID [2018-11-14 18:49:59,380 INFO L273 TraceCheckUtils]: 80: Hoare triple {9298#(<= ~i~0 11)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9308#(<= ~i~0 12)} is VALID [2018-11-14 18:49:59,381 INFO L273 TraceCheckUtils]: 81: Hoare triple {9308#(<= ~i~0 12)} assume true; {9308#(<= ~i~0 12)} is VALID [2018-11-14 18:49:59,381 INFO L273 TraceCheckUtils]: 82: Hoare triple {9308#(<= ~i~0 12)} assume !(~i~0 < 50000); {9037#false} is VALID [2018-11-14 18:49:59,382 INFO L273 TraceCheckUtils]: 83: Hoare triple {9037#false} ~i~0 := 0; {9037#false} is VALID [2018-11-14 18:49:59,382 INFO L273 TraceCheckUtils]: 84: Hoare triple {9037#false} assume true; {9037#false} is VALID [2018-11-14 18:49:59,382 INFO L273 TraceCheckUtils]: 85: Hoare triple {9037#false} assume !!(~i~0 < 50000);call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4); {9037#false} is VALID [2018-11-14 18:49:59,382 INFO L256 TraceCheckUtils]: 86: Hoare triple {9037#false} call __VERIFIER_assert((if #t~mem4.base != 0 || #t~mem4.offset != 0 then 1 else 0)); {9037#false} is VALID [2018-11-14 18:49:59,382 INFO L273 TraceCheckUtils]: 87: Hoare triple {9037#false} ~cond := #in~cond; {9037#false} is VALID [2018-11-14 18:49:59,383 INFO L273 TraceCheckUtils]: 88: Hoare triple {9037#false} assume ~cond == 0; {9037#false} is VALID [2018-11-14 18:49:59,383 INFO L273 TraceCheckUtils]: 89: Hoare triple {9037#false} assume !false; {9037#false} is VALID [2018-11-14 18:49:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-14 18:49:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:49:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-11-14 18:49:59,416 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 90 [2018-11-14 18:49:59,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:49:59,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:49:59,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:49:59,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:49:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:49:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:49:59,544 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 30 states.