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.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:00:32,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:00:32,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:00:32,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:00:32,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:00:32,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:00:32,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:00:32,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:00:32,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:00:32,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:00:32,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:00:32,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:00:32,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:00:32,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:00:32,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:00:32,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:00:32,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:00:32,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:00:32,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:00:32,440 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:00:32,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:00:32,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:00:32,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:00:32,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:00:32,445 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:00:32,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:00:32,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:00:32,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:00:32,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:00:32,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:00:32,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:00:32,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:00:32,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:00:32,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:00:32,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:00:32,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:00:32,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:00:32,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:00:32,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:00:32,477 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:00:32,477 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:00:32,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:00:32,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:00:32,479 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:00:32,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:00:32,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:00:32,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:00:32,480 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:00:32,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:00:32,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:00:32,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:00:32,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:00:32,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:00:32,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:00:32,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:00:32,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:00:32,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:00:32,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:00:32,484 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:00:32,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:00:32,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:00:32,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:00:32,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:00:32,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:00:32,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:00:32,558 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:00:32,558 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:00:32,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:00:32,623 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0d0455/1483a5dc1c114126bc1e2e287ff6e746/FLAG7cb0d1325 [2018-11-14 17:00:33,100 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:00:33,100 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:00:33,107 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0d0455/1483a5dc1c114126bc1e2e287ff6e746/FLAG7cb0d1325 [2018-11-14 17:00:33,120 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90a0d0455/1483a5dc1c114126bc1e2e287ff6e746 [2018-11-14 17:00:33,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:00:33,131 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:00:33,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:00:33,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:00:33,139 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:00:33,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cda7369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33, skipping insertion in model container [2018-11-14 17:00:33,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:00:33,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:00:33,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:00:33,431 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:00:33,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:00:33,476 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:00:33,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33 WrapperNode [2018-11-14 17:00:33,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:00:33,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:00:33,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:00:33,478 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:00:33,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... [2018-11-14 17:00:33,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:00:33,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:00:33,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:00:33,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:00:33,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:00:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:00:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:00:33,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:00:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-14 17:00:33,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:00:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:00:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:00:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:00:33,659 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:00:33,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:00:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:00:34,291 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:00:34,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:34 BoogieIcfgContainer [2018-11-14 17:00:34,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:00:34,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:00:34,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:00:34,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:00:34,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:00:33" (1/3) ... [2018-11-14 17:00:34,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d99f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:34, skipping insertion in model container [2018-11-14 17:00:34,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:00:33" (2/3) ... [2018-11-14 17:00:34,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d99f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:00:34, skipping insertion in model container [2018-11-14 17:00:34,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:00:34" (3/3) ... [2018-11-14 17:00:34,300 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init_true-unreach-call.i [2018-11-14 17:00:34,311 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:00:34,319 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:00:34,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:00:34,379 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:00:34,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:00:34,380 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:00:34,380 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:00:34,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:00:34,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:00:34,381 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:00:34,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:00:34,381 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:00:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 17:00:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:00:34,410 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:34,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:34,414 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:34,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1280416473, now seen corresponding path program 1 times [2018-11-14 17:00:34,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:34,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:34,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:34,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:34,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:34,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 17:00:34,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-14 17:00:34,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 17:00:34,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #79#return; {39#true} is VALID [2018-11-14 17:00:34,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2018-11-14 17:00:34,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {39#true} is VALID [2018-11-14 17:00:34,615 INFO L256 TraceCheckUtils]: 6: Hoare triple {39#true} call init(~#a~0.base, ~#a~0.offset, 100000); {39#true} is VALID [2018-11-14 17:00:34,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {39#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {39#true} is VALID [2018-11-14 17:00:34,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 17:00:34,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:00:34,624 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #83#return; {40#false} is VALID [2018-11-14 17:00:34,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~1 := 0; {40#false} is VALID [2018-11-14 17:00:34,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 17:00:34,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} ~i~1 := 0; {40#false} is VALID [2018-11-14 17:00:34,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 17:00:34,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume !!(~i~1 < 100000); {40#false} is VALID [2018-11-14 17:00:34,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {40#false} is VALID [2018-11-14 17:00:34,627 INFO L256 TraceCheckUtils]: 17: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {40#false} is VALID [2018-11-14 17:00:34,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 17:00:34,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {40#false} assume ~cond == 0; {40#false} is VALID [2018-11-14 17:00:34,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 17:00:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:34,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:34,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:00:34,648 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:00:34,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:34,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:00:34,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:34,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:00:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:00:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:00:34,894 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 17:00:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:35,059 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2018-11-14 17:00:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:00:35,059 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-14 17:00:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:00:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:00:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:00:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:00:35,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:00:35,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:35,328 INFO L225 Difference]: With dead ends: 61 [2018-11-14 17:00:35,329 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:00:35,332 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 17:00:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:00:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 17:00:35,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:35,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 17:00:35,379 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:00:35,380 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:00:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:35,384 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:00:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:00:35,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:35,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:35,386 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 17:00:35,386 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 17:00:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:35,392 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 17:00:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:00:35,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:35,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:35,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:35,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:00:35,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:00:35,399 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 21 [2018-11-14 17:00:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:35,400 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:00:35,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:00:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:00:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:00:35,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:35,402 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:35,402 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:35,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:35,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1572312329, now seen corresponding path program 1 times [2018-11-14 17:00:35,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:35,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:35,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:35,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:35,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:35,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {223#true} is VALID [2018-11-14 17:00:35,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {223#true} is VALID [2018-11-14 17:00:35,539 INFO L273 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 17:00:35,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} #79#return; {223#true} is VALID [2018-11-14 17:00:35,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {223#true} call #t~ret6 := main(); {223#true} is VALID [2018-11-14 17:00:35,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {223#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {223#true} is VALID [2018-11-14 17:00:35,540 INFO L256 TraceCheckUtils]: 6: Hoare triple {223#true} call init(~#a~0.base, ~#a~0.offset, 100000); {223#true} is VALID [2018-11-14 17:00:35,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {223#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {223#true} is VALID [2018-11-14 17:00:35,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 17:00:35,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#true} assume !(~i~0 < ~size); {223#true} is VALID [2018-11-14 17:00:35,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 17:00:35,542 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {223#true} {223#true} #83#return; {223#true} is VALID [2018-11-14 17:00:35,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {223#true} ~i~1 := 0; {225#(= main_~i~1 0)} is VALID [2018-11-14 17:00:35,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {225#(= main_~i~1 0)} assume true; {225#(= main_~i~1 0)} is VALID [2018-11-14 17:00:35,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {225#(= main_~i~1 0)} assume !(~i~1 < 100000); {224#false} is VALID [2018-11-14 17:00:35,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {224#false} ~i~1 := 0; {224#false} is VALID [2018-11-14 17:00:35,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {224#false} assume true; {224#false} is VALID [2018-11-14 17:00:35,549 INFO L273 TraceCheckUtils]: 17: Hoare triple {224#false} assume !!(~i~1 < 100000); {224#false} is VALID [2018-11-14 17:00:35,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {224#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {224#false} is VALID [2018-11-14 17:00:35,550 INFO L256 TraceCheckUtils]: 19: Hoare triple {224#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {224#false} is VALID [2018-11-14 17:00:35,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {224#false} ~cond := #in~cond; {224#false} is VALID [2018-11-14 17:00:35,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {224#false} assume ~cond == 0; {224#false} is VALID [2018-11-14 17:00:35,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {224#false} assume !false; {224#false} is VALID [2018-11-14 17:00:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:00:35,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 17:00:35,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:35,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:00:35,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:35,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:00:35,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:00:35,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:00:35,633 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-14 17:00:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,163 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 17:00:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:00:36,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-14 17:00:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 17:00:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-14 17:00:36,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-14 17:00:36,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:36,276 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:00:36,277 INFO L226 Difference]: Without dead ends: 41 [2018-11-14 17:00:36,278 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 17:00:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-14 17:00:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-11-14 17:00:36,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:36,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2018-11-14 17:00:36,297 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2018-11-14 17:00:36,298 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2018-11-14 17:00:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,303 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 17:00:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-14 17:00:36,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:36,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:36,305 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2018-11-14 17:00:36,305 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2018-11-14 17:00:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,309 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 17:00:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-14 17:00:36,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:36,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:36,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:36,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:00:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:00:36,314 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2018-11-14 17:00:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:36,315 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:00:36,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:00:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:00:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:00:36,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:36,317 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:36,317 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:36,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash -544729024, now seen corresponding path program 1 times [2018-11-14 17:00:36,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:36,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:36,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:36,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:36,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:36,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {426#true} call ULTIMATE.init(); {426#true} is VALID [2018-11-14 17:00:36,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {426#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {426#true} is VALID [2018-11-14 17:00:36,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 17:00:36,525 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {426#true} {426#true} #79#return; {426#true} is VALID [2018-11-14 17:00:36,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {426#true} call #t~ret6 := main(); {426#true} is VALID [2018-11-14 17:00:36,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {426#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {426#true} is VALID [2018-11-14 17:00:36,526 INFO L256 TraceCheckUtils]: 6: Hoare triple {426#true} call init(~#a~0.base, ~#a~0.offset, 100000); {426#true} is VALID [2018-11-14 17:00:36,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {426#true} is VALID [2018-11-14 17:00:36,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 17:00:36,527 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#true} assume !(~i~0 < ~size); {426#true} is VALID [2018-11-14 17:00:36,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 17:00:36,527 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {426#true} {426#true} #83#return; {426#true} is VALID [2018-11-14 17:00:36,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {426#true} ~i~1 := 0; {426#true} is VALID [2018-11-14 17:00:36,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {426#true} assume true; {426#true} is VALID [2018-11-14 17:00:36,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#true} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {426#true} is VALID [2018-11-14 17:00:36,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#true} assume #t~mem3.base != 0 || #t~mem3.offset != 0;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1; {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#(= main_~flag~0 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {428#(= main_~flag~0 1)} assume true; {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {428#(= main_~flag~0 1)} assume !(~i~1 < 100000); {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,541 INFO L273 TraceCheckUtils]: 19: Hoare triple {428#(= main_~flag~0 1)} ~i~1 := 0; {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,542 INFO L273 TraceCheckUtils]: 20: Hoare triple {428#(= main_~flag~0 1)} assume true; {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,542 INFO L273 TraceCheckUtils]: 21: Hoare triple {428#(= main_~flag~0 1)} assume !!(~i~1 < 100000); {428#(= main_~flag~0 1)} is VALID [2018-11-14 17:00:36,543 INFO L273 TraceCheckUtils]: 22: Hoare triple {428#(= main_~flag~0 1)} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {427#false} is VALID [2018-11-14 17:00:36,543 INFO L256 TraceCheckUtils]: 23: Hoare triple {427#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {427#false} is VALID [2018-11-14 17:00:36,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {427#false} ~cond := #in~cond; {427#false} is VALID [2018-11-14 17:00:36,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {427#false} assume ~cond == 0; {427#false} is VALID [2018-11-14 17:00:36,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {427#false} assume !false; {427#false} is VALID [2018-11-14 17:00:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:36,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:00:36,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:00:36,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 17:00:36,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:36,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:00:36,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:36,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:00:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:00:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:00:36,653 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:00:36,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,792 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-14 17:00:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:00:36,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 17:00:36,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:00:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:00:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:00:36,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:00:36,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:36,962 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:00:36,962 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:00:36,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:00:36,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:00:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 17:00:36,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:36,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 17:00:36,990 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:00:36,990 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:00:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,992 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 17:00:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:00:36,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:36,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:36,994 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:00:36,994 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:00:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:36,996 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 17:00:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:00:36,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:36,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:36,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:36,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:00:37,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 17:00:37,000 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2018-11-14 17:00:37,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:37,001 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 17:00:37,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:00:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:00:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:00:37,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:37,002 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:37,002 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:37,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash -286563586, now seen corresponding path program 1 times [2018-11-14 17:00:37,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:37,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:37,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-14 17:00:37,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-14 17:00:37,116 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-14 17:00:37,116 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #79#return; {613#true} is VALID [2018-11-14 17:00:37,116 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-14 17:00:37,116 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {613#true} is VALID [2018-11-14 17:00:37,117 INFO L256 TraceCheckUtils]: 6: Hoare triple {613#true} call init(~#a~0.base, ~#a~0.offset, 100000); {613#true} is VALID [2018-11-14 17:00:37,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {613#true} is VALID [2018-11-14 17:00:37,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-14 17:00:37,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {613#true} assume !(~i~0 < ~size); {613#true} is VALID [2018-11-14 17:00:37,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-14 17:00:37,118 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {613#true} {613#true} #83#return; {613#true} is VALID [2018-11-14 17:00:37,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#true} ~i~1 := 0; {615#(= main_~i~1 0)} is VALID [2018-11-14 17:00:37,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {615#(= main_~i~1 0)} assume true; {615#(= main_~i~1 0)} is VALID [2018-11-14 17:00:37,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {615#(= main_~i~1 0)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {615#(= main_~i~1 0)} is VALID [2018-11-14 17:00:37,126 INFO L273 TraceCheckUtils]: 15: Hoare triple {615#(= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {615#(= main_~i~1 0)} is VALID [2018-11-14 17:00:37,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {615#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {616#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:37,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {616#(<= main_~i~1 1)} assume true; {616#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:37,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {616#(<= main_~i~1 1)} assume !(~i~1 < 100000); {614#false} is VALID [2018-11-14 17:00:37,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {614#false} ~i~1 := 0; {614#false} is VALID [2018-11-14 17:00:37,130 INFO L273 TraceCheckUtils]: 20: Hoare triple {614#false} assume true; {614#false} is VALID [2018-11-14 17:00:37,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} assume !!(~i~1 < 100000); {614#false} is VALID [2018-11-14 17:00:37,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {614#false} is VALID [2018-11-14 17:00:37,131 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {614#false} is VALID [2018-11-14 17:00:37,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-14 17:00:37,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume ~cond == 0; {614#false} is VALID [2018-11-14 17:00:37,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-14 17:00:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:00:37,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:00:37,134 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 17:00:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:37,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:37,523 INFO L256 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2018-11-14 17:00:37,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {613#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {613#true} is VALID [2018-11-14 17:00:37,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2018-11-14 17:00:37,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #79#return; {613#true} is VALID [2018-11-14 17:00:37,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret6 := main(); {613#true} is VALID [2018-11-14 17:00:37,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {613#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {613#true} is VALID [2018-11-14 17:00:37,525 INFO L256 TraceCheckUtils]: 6: Hoare triple {613#true} call init(~#a~0.base, ~#a~0.offset, 100000); {613#true} is VALID [2018-11-14 17:00:37,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {613#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {641#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:37,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {641#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume true; {641#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:37,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume !(~i~0 < ~size); {648#(<= |init_#in~size| 0)} is VALID [2018-11-14 17:00:37,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#(<= |init_#in~size| 0)} assume true; {648#(<= |init_#in~size| 0)} is VALID [2018-11-14 17:00:37,533 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {648#(<= |init_#in~size| 0)} {613#true} #83#return; {614#false} is VALID [2018-11-14 17:00:37,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {614#false} ~i~1 := 0; {614#false} is VALID [2018-11-14 17:00:37,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {614#false} assume true; {614#false} is VALID [2018-11-14 17:00:37,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {614#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {614#false} is VALID [2018-11-14 17:00:37,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {614#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {614#false} is VALID [2018-11-14 17:00:37,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {614#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {614#false} is VALID [2018-11-14 17:00:37,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {614#false} assume true; {614#false} is VALID [2018-11-14 17:00:37,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {614#false} assume !(~i~1 < 100000); {614#false} is VALID [2018-11-14 17:00:37,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {614#false} ~i~1 := 0; {614#false} is VALID [2018-11-14 17:00:37,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {614#false} assume true; {614#false} is VALID [2018-11-14 17:00:37,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {614#false} assume !!(~i~1 < 100000); {614#false} is VALID [2018-11-14 17:00:37,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {614#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {614#false} is VALID [2018-11-14 17:00:37,537 INFO L256 TraceCheckUtils]: 23: Hoare triple {614#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {614#false} is VALID [2018-11-14 17:00:37,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2018-11-14 17:00:37,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {614#false} assume ~cond == 0; {614#false} is VALID [2018-11-14 17:00:37,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {614#false} assume !false; {614#false} is VALID [2018-11-14 17:00:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:00:37,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:00:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-14 17:00:37,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-14 17:00:37,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:37,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:00:37,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:37,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:00:37,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:00:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:00:37,704 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2018-11-14 17:00:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:38,208 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:00:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:00:38,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-14 17:00:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:00:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-14 17:00:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:00:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2018-11-14 17:00:38,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2018-11-14 17:00:38,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:38,457 INFO L225 Difference]: With dead ends: 76 [2018-11-14 17:00:38,457 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:00:38,458 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:00:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:00:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-14 17:00:38,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:38,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 39 states. [2018-11-14 17:00:38,495 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 39 states. [2018-11-14 17:00:38,495 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 39 states. [2018-11-14 17:00:38,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:38,498 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 17:00:38,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-14 17:00:38,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:38,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:38,500 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 54 states. [2018-11-14 17:00:38,500 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 54 states. [2018-11-14 17:00:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:38,503 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 17:00:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-14 17:00:38,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:38,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:38,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:38,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:00:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-14 17:00:38,508 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 27 [2018-11-14 17:00:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:38,509 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-14 17:00:38,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:00:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-14 17:00:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:00:38,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:38,510 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:38,511 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:38,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -100072505, now seen corresponding path program 1 times [2018-11-14 17:00:38,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:38,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:38,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:38,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:38,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:38,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2018-11-14 17:00:38,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {961#true} is VALID [2018-11-14 17:00:38,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:00:38,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #79#return; {961#true} is VALID [2018-11-14 17:00:38,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret6 := main(); {961#true} is VALID [2018-11-14 17:00:38,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {961#true} is VALID [2018-11-14 17:00:38,614 INFO L256 TraceCheckUtils]: 6: Hoare triple {961#true} call init(~#a~0.base, ~#a~0.offset, 100000); {961#true} is VALID [2018-11-14 17:00:38,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {961#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {961#true} is VALID [2018-11-14 17:00:38,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:00:38,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {961#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {961#true} is VALID [2018-11-14 17:00:38,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {961#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {961#true} is VALID [2018-11-14 17:00:38,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:00:38,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {961#true} assume !(~i~0 < ~size); {961#true} is VALID [2018-11-14 17:00:38,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:00:38,616 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {961#true} {961#true} #83#return; {961#true} is VALID [2018-11-14 17:00:38,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {961#true} ~i~1 := 0; {963#(= main_~i~1 0)} is VALID [2018-11-14 17:00:38,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {963#(= main_~i~1 0)} assume true; {963#(= main_~i~1 0)} is VALID [2018-11-14 17:00:38,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {963#(= main_~i~1 0)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {963#(= main_~i~1 0)} is VALID [2018-11-14 17:00:38,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {963#(= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {963#(= main_~i~1 0)} is VALID [2018-11-14 17:00:38,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {963#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {964#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:38,623 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#(<= main_~i~1 1)} assume true; {964#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:38,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {964#(<= main_~i~1 1)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {964#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:38,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {964#(<= main_~i~1 1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {964#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:38,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {964#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {965#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:38,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {965#(<= main_~i~1 2)} assume true; {965#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:38,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {965#(<= main_~i~1 2)} assume !(~i~1 < 100000); {962#false} is VALID [2018-11-14 17:00:38,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {962#false} ~i~1 := 0; {962#false} is VALID [2018-11-14 17:00:38,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {962#false} assume true; {962#false} is VALID [2018-11-14 17:00:38,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {962#false} assume !!(~i~1 < 100000); {962#false} is VALID [2018-11-14 17:00:38,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {962#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {962#false} is VALID [2018-11-14 17:00:38,636 INFO L256 TraceCheckUtils]: 30: Hoare triple {962#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {962#false} is VALID [2018-11-14 17:00:38,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {962#false} ~cond := #in~cond; {962#false} is VALID [2018-11-14 17:00:38,636 INFO L273 TraceCheckUtils]: 32: Hoare triple {962#false} assume ~cond == 0; {962#false} is VALID [2018-11-14 17:00:38,637 INFO L273 TraceCheckUtils]: 33: Hoare triple {962#false} assume !false; {962#false} is VALID [2018-11-14 17:00:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:00:38,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:00:38,640 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 17:00:38,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:38,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:38,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {961#true} call ULTIMATE.init(); {961#true} is VALID [2018-11-14 17:00:38,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {961#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {961#true} is VALID [2018-11-14 17:00:38,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {961#true} assume true; {961#true} is VALID [2018-11-14 17:00:38,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {961#true} {961#true} #79#return; {961#true} is VALID [2018-11-14 17:00:38,918 INFO L256 TraceCheckUtils]: 4: Hoare triple {961#true} call #t~ret6 := main(); {961#true} is VALID [2018-11-14 17:00:38,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {961#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {961#true} is VALID [2018-11-14 17:00:38,919 INFO L256 TraceCheckUtils]: 6: Hoare triple {961#true} call init(~#a~0.base, ~#a~0.offset, 100000); {961#true} is VALID [2018-11-14 17:00:38,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {961#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:38,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume true; {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:38,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:38,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {990#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1000#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2018-11-14 17:00:38,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {1000#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume true; {1000#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2018-11-14 17:00:38,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {1000#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !(~i~0 < ~size); {1007#(<= |init_#in~size| 1)} is VALID [2018-11-14 17:00:38,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {1007#(<= |init_#in~size| 1)} assume true; {1007#(<= |init_#in~size| 1)} is VALID [2018-11-14 17:00:38,926 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1007#(<= |init_#in~size| 1)} {961#true} #83#return; {962#false} is VALID [2018-11-14 17:00:38,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {962#false} ~i~1 := 0; {962#false} is VALID [2018-11-14 17:00:38,927 INFO L273 TraceCheckUtils]: 16: Hoare triple {962#false} assume true; {962#false} is VALID [2018-11-14 17:00:38,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {962#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {962#false} is VALID [2018-11-14 17:00:38,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {962#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {962#false} is VALID [2018-11-14 17:00:38,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {962#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {962#false} is VALID [2018-11-14 17:00:38,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {962#false} assume true; {962#false} is VALID [2018-11-14 17:00:38,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {962#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {962#false} is VALID [2018-11-14 17:00:38,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {962#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {962#false} is VALID [2018-11-14 17:00:38,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {962#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {962#false} is VALID [2018-11-14 17:00:38,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {962#false} assume true; {962#false} is VALID [2018-11-14 17:00:38,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {962#false} assume !(~i~1 < 100000); {962#false} is VALID [2018-11-14 17:00:38,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {962#false} ~i~1 := 0; {962#false} is VALID [2018-11-14 17:00:38,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {962#false} assume true; {962#false} is VALID [2018-11-14 17:00:38,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {962#false} assume !!(~i~1 < 100000); {962#false} is VALID [2018-11-14 17:00:38,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {962#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {962#false} is VALID [2018-11-14 17:00:38,931 INFO L256 TraceCheckUtils]: 30: Hoare triple {962#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {962#false} is VALID [2018-11-14 17:00:38,931 INFO L273 TraceCheckUtils]: 31: Hoare triple {962#false} ~cond := #in~cond; {962#false} is VALID [2018-11-14 17:00:38,931 INFO L273 TraceCheckUtils]: 32: Hoare triple {962#false} assume ~cond == 0; {962#false} is VALID [2018-11-14 17:00:38,931 INFO L273 TraceCheckUtils]: 33: Hoare triple {962#false} assume !false; {962#false} is VALID [2018-11-14 17:00:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:00:38,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:00:38,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 17:00:38,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-14 17:00:38,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:38,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:00:39,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:39,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:00:39,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:00:39,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:00:39,011 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 8 states. [2018-11-14 17:00:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:39,407 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-11-14 17:00:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:00:39,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-14 17:00:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:00:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-14 17:00:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:00:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-14 17:00:39,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2018-11-14 17:00:39,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:39,589 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:00:39,589 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:00:39,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:00:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:00:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-14 17:00:39,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:39,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2018-11-14 17:00:39,612 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2018-11-14 17:00:39,613 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2018-11-14 17:00:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:39,616 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-14 17:00:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-14 17:00:39,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:39,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:39,618 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2018-11-14 17:00:39,618 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2018-11-14 17:00:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:39,622 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-14 17:00:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-11-14 17:00:39,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:39,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:39,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:39,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:00:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-14 17:00:39,627 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 34 [2018-11-14 17:00:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:39,627 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-14 17:00:39,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:00:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-14 17:00:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 17:00:39,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:39,628 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:39,629 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:39,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1644158644, now seen corresponding path program 2 times [2018-11-14 17:00:39,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:00:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:39,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {1389#true} call ULTIMATE.init(); {1389#true} is VALID [2018-11-14 17:00:39,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {1389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1389#true} is VALID [2018-11-14 17:00:39,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:39,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1389#true} {1389#true} #79#return; {1389#true} is VALID [2018-11-14 17:00:39,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {1389#true} call #t~ret6 := main(); {1389#true} is VALID [2018-11-14 17:00:39,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {1389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1389#true} is VALID [2018-11-14 17:00:39,784 INFO L256 TraceCheckUtils]: 6: Hoare triple {1389#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1389#true} is VALID [2018-11-14 17:00:39,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {1389#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1389#true} is VALID [2018-11-14 17:00:39,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:39,785 INFO L273 TraceCheckUtils]: 9: Hoare triple {1389#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1389#true} is VALID [2018-11-14 17:00:39,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {1389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1389#true} is VALID [2018-11-14 17:00:39,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:39,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {1389#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1389#true} is VALID [2018-11-14 17:00:39,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {1389#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1389#true} is VALID [2018-11-14 17:00:39,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:39,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {1389#true} assume !(~i~0 < ~size); {1389#true} is VALID [2018-11-14 17:00:39,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:39,787 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1389#true} {1389#true} #83#return; {1389#true} is VALID [2018-11-14 17:00:39,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {1389#true} ~i~1 := 0; {1391#(= main_~i~1 0)} is VALID [2018-11-14 17:00:39,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {1391#(= main_~i~1 0)} assume true; {1391#(= main_~i~1 0)} is VALID [2018-11-14 17:00:39,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {1391#(= main_~i~1 0)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1391#(= main_~i~1 0)} is VALID [2018-11-14 17:00:39,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {1391#(= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1391#(= main_~i~1 0)} is VALID [2018-11-14 17:00:39,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1391#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1392#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:39,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {1392#(<= main_~i~1 1)} assume true; {1392#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:39,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {1392#(<= main_~i~1 1)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1392#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:39,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {1392#(<= main_~i~1 1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1392#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:39,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1392#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1393#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:39,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {1393#(<= main_~i~1 2)} assume true; {1393#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:39,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {1393#(<= main_~i~1 2)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1393#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:39,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {1393#(<= main_~i~1 2)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1393#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:39,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {1393#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1394#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:39,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {1394#(<= main_~i~1 3)} assume true; {1394#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:39,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {1394#(<= main_~i~1 3)} assume !(~i~1 < 100000); {1390#false} is VALID [2018-11-14 17:00:39,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {1390#false} ~i~1 := 0; {1390#false} is VALID [2018-11-14 17:00:39,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:39,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {1390#false} assume !!(~i~1 < 100000); {1390#false} is VALID [2018-11-14 17:00:39,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {1390#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1390#false} is VALID [2018-11-14 17:00:39,837 INFO L256 TraceCheckUtils]: 37: Hoare triple {1390#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1390#false} is VALID [2018-11-14 17:00:39,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {1390#false} ~cond := #in~cond; {1390#false} is VALID [2018-11-14 17:00:39,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {1390#false} assume ~cond == 0; {1390#false} is VALID [2018-11-14 17:00:39,839 INFO L273 TraceCheckUtils]: 40: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2018-11-14 17:00:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-14 17:00:39,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:00:39,842 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 17:00:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:00:39,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:00:39,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:00:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:39,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:40,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {1389#true} call ULTIMATE.init(); {1389#true} is VALID [2018-11-14 17:00:40,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1389#true} is VALID [2018-11-14 17:00:40,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {1389#true} assume true; {1389#true} is VALID [2018-11-14 17:00:40,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1389#true} {1389#true} #79#return; {1389#true} is VALID [2018-11-14 17:00:40,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {1389#true} call #t~ret6 := main(); {1389#true} is VALID [2018-11-14 17:00:40,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {1389#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1389#true} is VALID [2018-11-14 17:00:40,237 INFO L256 TraceCheckUtils]: 6: Hoare triple {1389#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1389#true} is VALID [2018-11-14 17:00:40,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {1389#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:40,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume true; {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:40,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} is VALID [2018-11-14 17:00:40,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {1419#(and (<= |init_#in~size| init_~size) (<= init_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2018-11-14 17:00:40,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume true; {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2018-11-14 17:00:40,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2018-11-14 17:00:40,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {1429#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1439#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2018-11-14 17:00:40,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {1439#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume true; {1439#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2018-11-14 17:00:40,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume !(~i~0 < ~size); {1446#(<= |init_#in~size| 2)} is VALID [2018-11-14 17:00:40,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(<= |init_#in~size| 2)} assume true; {1446#(<= |init_#in~size| 2)} is VALID [2018-11-14 17:00:40,249 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {1446#(<= |init_#in~size| 2)} {1389#true} #83#return; {1390#false} is VALID [2018-11-14 17:00:40,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1390#false} ~i~1 := 0; {1390#false} is VALID [2018-11-14 17:00:40,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:40,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {1390#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1390#false} is VALID [2018-11-14 17:00:40,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {1390#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1390#false} is VALID [2018-11-14 17:00:40,250 INFO L273 TraceCheckUtils]: 22: Hoare triple {1390#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1390#false} is VALID [2018-11-14 17:00:40,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:40,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {1390#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1390#false} is VALID [2018-11-14 17:00:40,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {1390#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1390#false} is VALID [2018-11-14 17:00:40,251 INFO L273 TraceCheckUtils]: 26: Hoare triple {1390#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1390#false} is VALID [2018-11-14 17:00:40,252 INFO L273 TraceCheckUtils]: 27: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:40,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {1390#false} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1390#false} is VALID [2018-11-14 17:00:40,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {1390#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1390#false} is VALID [2018-11-14 17:00:40,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {1390#false} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1390#false} is VALID [2018-11-14 17:00:40,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:40,253 INFO L273 TraceCheckUtils]: 32: Hoare triple {1390#false} assume !(~i~1 < 100000); {1390#false} is VALID [2018-11-14 17:00:40,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {1390#false} ~i~1 := 0; {1390#false} is VALID [2018-11-14 17:00:40,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {1390#false} assume true; {1390#false} is VALID [2018-11-14 17:00:40,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {1390#false} assume !!(~i~1 < 100000); {1390#false} is VALID [2018-11-14 17:00:40,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {1390#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1390#false} is VALID [2018-11-14 17:00:40,254 INFO L256 TraceCheckUtils]: 37: Hoare triple {1390#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1390#false} is VALID [2018-11-14 17:00:40,254 INFO L273 TraceCheckUtils]: 38: Hoare triple {1390#false} ~cond := #in~cond; {1390#false} is VALID [2018-11-14 17:00:40,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {1390#false} assume ~cond == 0; {1390#false} is VALID [2018-11-14 17:00:40,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2018-11-14 17:00:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:00:40,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:00:40,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 17:00:40,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 17:00:40,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:40,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:00:40,335 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 17:00:40,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:00:40,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:00:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:00:40,336 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 10 states. [2018-11-14 17:00:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:41,093 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-11-14 17:00:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:00:41,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-14 17:00:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:00:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-14 17:00:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:00:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2018-11-14 17:00:41,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2018-11-14 17:00:41,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:41,297 INFO L225 Difference]: With dead ends: 110 [2018-11-14 17:00:41,298 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 17:00:41,299 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:00:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 17:00:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 53. [2018-11-14 17:00:41,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:41,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 53 states. [2018-11-14 17:00:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 53 states. [2018-11-14 17:00:41,323 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 53 states. [2018-11-14 17:00:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:41,328 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-14 17:00:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-11-14 17:00:41,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:41,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:41,329 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 80 states. [2018-11-14 17:00:41,329 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 80 states. [2018-11-14 17:00:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:41,333 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-14 17:00:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-11-14 17:00:41,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:41,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:41,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:41,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:00:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-14 17:00:41,337 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 41 [2018-11-14 17:00:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:41,337 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-14 17:00:41,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:00:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-11-14 17:00:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 17:00:41,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:00:41,339 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:00:41,339 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:00:41,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:00:41,339 INFO L82 PathProgramCache]: Analyzing trace with hash -300658795, now seen corresponding path program 3 times [2018-11-14 17:00:41,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:00:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:00:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:41,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:00:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:00:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:41,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {1897#true} call ULTIMATE.init(); {1897#true} is VALID [2018-11-14 17:00:41,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {1897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1897#true} is VALID [2018-11-14 17:00:41,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1897#true} {1897#true} #79#return; {1897#true} is VALID [2018-11-14 17:00:41,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {1897#true} call #t~ret6 := main(); {1897#true} is VALID [2018-11-14 17:00:41,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {1897#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L256 TraceCheckUtils]: 6: Hoare triple {1897#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {1897#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {1897#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L273 TraceCheckUtils]: 10: Hoare triple {1897#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1897#true} is VALID [2018-11-14 17:00:41,514 INFO L273 TraceCheckUtils]: 11: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,515 INFO L273 TraceCheckUtils]: 12: Hoare triple {1897#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1897#true} is VALID [2018-11-14 17:00:41,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {1897#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1897#true} is VALID [2018-11-14 17:00:41,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {1897#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1897#true} is VALID [2018-11-14 17:00:41,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {1897#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1897#true} is VALID [2018-11-14 17:00:41,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {1897#true} assume !(~i~0 < ~size); {1897#true} is VALID [2018-11-14 17:00:41,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:41,516 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1897#true} {1897#true} #83#return; {1897#true} is VALID [2018-11-14 17:00:41,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {1897#true} ~i~1 := 0; {1899#(= main_~i~1 0)} is VALID [2018-11-14 17:00:41,518 INFO L273 TraceCheckUtils]: 22: Hoare triple {1899#(= main_~i~1 0)} assume true; {1899#(= main_~i~1 0)} is VALID [2018-11-14 17:00:41,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {1899#(= main_~i~1 0)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1899#(= main_~i~1 0)} is VALID [2018-11-14 17:00:41,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {1899#(= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1899#(= main_~i~1 0)} is VALID [2018-11-14 17:00:41,519 INFO L273 TraceCheckUtils]: 25: Hoare triple {1899#(= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1900#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:41,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {1900#(<= main_~i~1 1)} assume true; {1900#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:41,520 INFO L273 TraceCheckUtils]: 27: Hoare triple {1900#(<= main_~i~1 1)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1900#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:41,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {1900#(<= main_~i~1 1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1900#(<= main_~i~1 1)} is VALID [2018-11-14 17:00:41,522 INFO L273 TraceCheckUtils]: 29: Hoare triple {1900#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1901#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:41,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {1901#(<= main_~i~1 2)} assume true; {1901#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:41,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {1901#(<= main_~i~1 2)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1901#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:41,524 INFO L273 TraceCheckUtils]: 32: Hoare triple {1901#(<= main_~i~1 2)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1901#(<= main_~i~1 2)} is VALID [2018-11-14 17:00:41,524 INFO L273 TraceCheckUtils]: 33: Hoare triple {1901#(<= main_~i~1 2)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1902#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:41,525 INFO L273 TraceCheckUtils]: 34: Hoare triple {1902#(<= main_~i~1 3)} assume true; {1902#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:41,526 INFO L273 TraceCheckUtils]: 35: Hoare triple {1902#(<= main_~i~1 3)} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1902#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:41,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {1902#(<= main_~i~1 3)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1902#(<= main_~i~1 3)} is VALID [2018-11-14 17:00:41,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {1902#(<= main_~i~1 3)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1903#(<= main_~i~1 4)} is VALID [2018-11-14 17:00:41,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {1903#(<= main_~i~1 4)} assume true; {1903#(<= main_~i~1 4)} is VALID [2018-11-14 17:00:41,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {1903#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1898#false} is VALID [2018-11-14 17:00:41,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {1898#false} ~i~1 := 0; {1898#false} is VALID [2018-11-14 17:00:41,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {1898#false} assume true; {1898#false} is VALID [2018-11-14 17:00:41,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {1898#false} assume !!(~i~1 < 100000); {1898#false} is VALID [2018-11-14 17:00:41,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {1898#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1898#false} is VALID [2018-11-14 17:00:41,539 INFO L256 TraceCheckUtils]: 44: Hoare triple {1898#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1898#false} is VALID [2018-11-14 17:00:41,539 INFO L273 TraceCheckUtils]: 45: Hoare triple {1898#false} ~cond := #in~cond; {1898#false} is VALID [2018-11-14 17:00:41,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {1898#false} assume ~cond == 0; {1898#false} is VALID [2018-11-14 17:00:41,540 INFO L273 TraceCheckUtils]: 47: Hoare triple {1898#false} assume !false; {1898#false} is VALID [2018-11-14 17:00:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:00:41,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:00:41,543 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 17:00:41,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:00:41,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:00:41,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:00:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:00:41,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:00:42,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 17:00:42,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 17:00:42,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:00:42,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:00:42,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:00:42,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-14 17:00:42,107 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:00:42,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-14 17:00:42,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2018-11-14 17:00:42,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 17:00:42,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:00:43,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 17:00:43,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:20 [2018-11-14 17:00:43,168 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:00:43,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {1897#true} call ULTIMATE.init(); {1897#true} is VALID [2018-11-14 17:00:43,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {1897#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1897#true} is VALID [2018-11-14 17:00:43,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {1897#true} assume true; {1897#true} is VALID [2018-11-14 17:00:43,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1897#true} {1897#true} #79#return; {1897#true} is VALID [2018-11-14 17:00:43,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {1897#true} call #t~ret6 := main(); {1897#true} is VALID [2018-11-14 17:00:43,257 INFO L273 TraceCheckUtils]: 5: Hoare triple {1897#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1897#true} is VALID [2018-11-14 17:00:43,257 INFO L256 TraceCheckUtils]: 6: Hoare triple {1897#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1897#true} is VALID [2018-11-14 17:00:43,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {1897#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume true; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume true; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,268 INFO L273 TraceCheckUtils]: 14: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume true; {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2018-11-14 17:00:43,270 INFO L273 TraceCheckUtils]: 15: Hoare triple {1928#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + ~i~0 * 4 + 0, 4); {1953#(and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 init_~i~0))) 0)) (= |init_#in~size| init_~size) (< init_~i~0 init_~size))} is VALID [2018-11-14 17:00:43,271 INFO L273 TraceCheckUtils]: 16: Hoare triple {1953#(and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* 4 init_~i~0))) 0)) (= |init_#in~size| init_~size) (< init_~i~0 init_~size))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1957#(and (= |init_#in~size| init_~size) (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (< v_init_~i~0_10 init_~size) (<= init_~i~0 (+ v_init_~i~0_10 1)))))} is VALID [2018-11-14 17:00:43,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {1957#(and (= |init_#in~size| init_~size) (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (< v_init_~i~0_10 init_~size) (<= init_~i~0 (+ v_init_~i~0_10 1)))))} assume true; {1957#(and (= |init_#in~size| init_~size) (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (< v_init_~i~0_10 init_~size) (<= init_~i~0 (+ v_init_~i~0_10 1)))))} is VALID [2018-11-14 17:00:43,274 INFO L273 TraceCheckUtils]: 18: Hoare triple {1957#(and (= |init_#in~size| init_~size) (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (< v_init_~i~0_10 init_~size) (<= init_~i~0 (+ v_init_~i~0_10 1)))))} assume !(~i~0 < ~size); {1964#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (<= |init_#in~size| (+ v_init_~i~0_10 1)) (< v_init_~i~0_10 |init_#in~size|)))} is VALID [2018-11-14 17:00:43,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {1964#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (<= |init_#in~size| (+ v_init_~i~0_10 1)) (< v_init_~i~0_10 |init_#in~size|)))} assume true; {1964#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (<= |init_#in~size| (+ v_init_~i~0_10 1)) (< v_init_~i~0_10 |init_#in~size|)))} is VALID [2018-11-14 17:00:43,284 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1964#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (<= |init_#in~size| (+ v_init_~i~0_10 1)) (< v_init_~i~0_10 |init_#in~size|)))} {1897#true} #83#return; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} ~i~1 := 0; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume true; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume true; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume true; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,300 INFO L273 TraceCheckUtils]: 32: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume true; {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} is VALID [2018-11-14 17:00:43,302 INFO L273 TraceCheckUtils]: 35: Hoare triple {1971#(exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {2017#(or (and (not (= |main_#t~mem3.base| 0)) (< main_~i~1 100000)) (<= main_~i~1 99998))} is VALID [2018-11-14 17:00:43,303 INFO L273 TraceCheckUtils]: 36: Hoare triple {2017#(or (and (not (= |main_#t~mem3.base| 0)) (< main_~i~1 100000)) (<= main_~i~1 99998))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2021#(<= main_~i~1 99998)} is VALID [2018-11-14 17:00:43,303 INFO L273 TraceCheckUtils]: 37: Hoare triple {2021#(<= main_~i~1 99998)} #t~post2 := ~i~1;~i~1 := #t~post2 + 1;havoc #t~post2; {2025#(<= main_~i~1 99999)} is VALID [2018-11-14 17:00:43,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {2025#(<= main_~i~1 99999)} assume true; {2025#(<= main_~i~1 99999)} is VALID [2018-11-14 17:00:43,304 INFO L273 TraceCheckUtils]: 39: Hoare triple {2025#(<= main_~i~1 99999)} assume !(~i~1 < 100000); {1898#false} is VALID [2018-11-14 17:00:43,304 INFO L273 TraceCheckUtils]: 40: Hoare triple {1898#false} ~i~1 := 0; {1898#false} is VALID [2018-11-14 17:00:43,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {1898#false} assume true; {1898#false} is VALID [2018-11-14 17:00:43,305 INFO L273 TraceCheckUtils]: 42: Hoare triple {1898#false} assume !!(~i~1 < 100000); {1898#false} is VALID [2018-11-14 17:00:43,305 INFO L273 TraceCheckUtils]: 43: Hoare triple {1898#false} assume ~flag~0 == 0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + ~i~1 * 4 + 0, 4); {1898#false} is VALID [2018-11-14 17:00:43,305 INFO L256 TraceCheckUtils]: 44: Hoare triple {1898#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1898#false} is VALID [2018-11-14 17:00:43,305 INFO L273 TraceCheckUtils]: 45: Hoare triple {1898#false} ~cond := #in~cond; {1898#false} is VALID [2018-11-14 17:00:43,306 INFO L273 TraceCheckUtils]: 46: Hoare triple {1898#false} assume ~cond == 0; {1898#false} is VALID [2018-11-14 17:00:43,306 INFO L273 TraceCheckUtils]: 47: Hoare triple {1898#false} assume !false; {1898#false} is VALID [2018-11-14 17:00:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-14 17:00:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:00:43,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-14 17:00:43,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-14 17:00:43,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:00:43,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:00:43,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:43,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:00:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:00:43,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:00:43,424 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 15 states. [2018-11-14 17:00:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:44,360 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-14 17:00:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 17:00:44,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-11-14 17:00:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:00:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:00:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 61 transitions. [2018-11-14 17:00:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:00:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 61 transitions. [2018-11-14 17:00:44,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 61 transitions. [2018-11-14 17:00:44,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:00:44,473 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:00:44,473 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:00:44,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:00:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:00:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:00:44,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:00:44,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:00:44,475 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:00:44,475 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:00:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:44,476 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:00:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:00:44,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:44,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:44,477 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:00:44,477 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:00:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:00:44,477 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:00:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:00:44,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:44,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:00:44,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:00:44,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:00:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:00:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:00:44,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-14 17:00:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:00:44,478 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:00:44,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:00:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:00:44,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:00:44,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:00:44,676 INFO L428 ceAbstractionStarter]: At program point initENTRY(lines 9 16) the Hoare annotation is: true [2018-11-14 17:00:44,676 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2018-11-14 17:00:44,676 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 15) no Hoare annotation was computed. [2018-11-14 17:00:44,676 INFO L425 ceAbstractionStarter]: For program point L12-3(lines 12 15) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L421 ceAbstractionStarter]: At program point L12-4(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (<= init_~i~0 0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* 4 v_init_~i~0_10) |init_#in~a.offset|)) 0)) (< v_init_~i~0_10 init_~size) (<= init_~i~0 (+ v_init_~i~0_10 1)))) .cse2))) [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point L12-5(lines 9 16) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:00:44,677 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-11-14 17:00:44,677 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L31-3(lines 31 35) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L421 ceAbstractionStarter]: At program point L31-4(lines 31 35) the Hoare annotation is: (= main_~flag~0 1) [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L31-5(lines 31 35) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L428 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L421 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: false [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 17 37) the Hoare annotation is: true [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-11-14 17:00:44,678 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 30) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 24 30) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L421 ceAbstractionStarter]: At program point L24-4(lines 24 30) the Hoare annotation is: (or (and (<= main_~i~1 99999) (exists ((v_init_~i~0_10 Int)) (and (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* 4 v_init_~i~0_10) |main_~#a~0.offset|)) 0)) (< v_init_~i~0_10 100000) (<= 99999 v_init_~i~0_10)))) (= main_~flag~0 1)) [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point L24-5(lines 24 30) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point L4-3(line 4) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 17:00:44,679 INFO L425 ceAbstractionStarter]: For program point L4-1(line 4) no Hoare annotation was computed. [2018-11-14 17:00:44,681 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: L12-5 has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:00:44,682 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L24-5 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L24-5 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-14 17:00:44,683 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-5 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2018-11-14 17:00:44,684 WARN L170 areAnnotationChecker]: L31-5 has no Hoare annotation [2018-11-14 17:00:44,685 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 17:00:44,685 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 17:00:44,685 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:00:44,685 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-14 17:00:44,685 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:00:44,685 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:00:44,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,694 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,696 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,697 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,699 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,700 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,702 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:00:44 BoogieIcfgContainer [2018-11-14 17:00:44,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:00:44,706 INFO L168 Benchmark]: Toolchain (without parser) took 11574.99 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -705.5 MB). Peak memory consumption was 155.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:00:44,707 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:00:44,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:00:44,708 INFO L168 Benchmark]: Boogie Preprocessor took 47.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:00:44,709 INFO L168 Benchmark]: RCFGBuilder took 765.92 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:00:44,710 INFO L168 Benchmark]: TraceAbstraction took 10412.04 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.6 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:00:44,713 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 765.92 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10412.04 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.6 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: flag == 1 - InvariantResult [Line: 24]: Loop Invariant [2018-11-14 17:00:44,721 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,721 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,722 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,722 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,722 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,723 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,723 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (i <= 99999 && (\exists v_init_~i~0_10 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_10 + a] == 0) && v_init_~i~0_10 < 100000) && 99999 <= v_init_~i~0_10)) || flag == 1 - InvariantResult [Line: 12]: Loop Invariant [2018-11-14 17:00:44,723 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,724 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,724 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-14 17:00:44,725 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-14 17:00:44,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,725 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,726 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_10,QUANTIFIED] [2018-11-14 17:00:44,726 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((i <= 0 && a == a) && \old(size) == size) && a == a) || (((a == a && \old(size) == size) && (\exists v_init_~i~0_10 : int :: (!(#memory_$Pointer$[a][4 * v_init_~i~0_10 + a] == 0) && v_init_~i~0_10 < size) && i <= v_init_~i~0_10 + 1)) && a == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 7 OverallIterations, 5 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 131 SDslu, 520 SDs, 0 SdLazy, 261 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 17 PreInvPairs, 29 NumberOfFragments, 85 HoareAnnotationTreeSize, 17 FomulaSimplifications, 76 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 147 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 371 NumberOfCodeBlocks, 353 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 19 QuantifiedInterpolants, 43310 SizeOfPredicates, 15 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 79/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...