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-examples/standard_init5_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:55:38,271 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:55:38,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:55:38,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:55:38,290 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:55:38,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:55:38,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:55:38,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:55:38,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:55:38,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:55:38,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:55:38,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:55:38,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:55:38,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:55:38,301 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:55:38,302 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:55:38,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:55:38,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:55:38,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:55:38,309 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:55:38,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:55:38,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:55:38,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:55:38,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:55:38,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:55:38,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:55:38,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:55:38,317 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:55:38,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:55:38,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:55:38,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:55:38,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:55:38,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:55:38,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:55:38,321 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:55:38,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:55:38,322 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 16:55:38,344 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:55:38,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:55:38,346 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:55:38,346 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:55:38,347 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:55:38,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:55:38,347 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:55:38,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:55:38,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:55:38,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:55:38,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:55:38,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:55:38,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:55:38,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:55:38,350 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:55:38,350 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:55:38,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:55:38,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:38,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:55:38,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:55:38,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:55:38,353 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:55:38,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:55:38,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:55:38,353 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:55:38,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:55:38,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:55:38,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:55:38,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:55:38,429 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:55:38,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init5_true-unreach-call_ground.i [2018-11-14 16:55:38,502 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f330f0e67/9f983e5161d84a39b2c3d13c7aab77eb/FLAGef73f16bc [2018-11-14 16:55:38,991 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:55:38,992 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init5_true-unreach-call_ground.i [2018-11-14 16:55:38,999 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f330f0e67/9f983e5161d84a39b2c3d13c7aab77eb/FLAGef73f16bc [2018-11-14 16:55:39,020 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f330f0e67/9f983e5161d84a39b2c3d13c7aab77eb [2018-11-14 16:55:39,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:55:39,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:55:39,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:39,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:55:39,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:55:39,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6142b27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39, skipping insertion in model container [2018-11-14 16:55:39,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:55:39,086 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:55:39,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:39,327 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:55:39,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:55:39,387 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:55:39,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39 WrapperNode [2018-11-14 16:55:39,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:55:39,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:55:39,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:55:39,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:55:39,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... [2018-11-14 16:55:39,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:55:39,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:55:39,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:55:39,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:55:39,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:55:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:55:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:55:39,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:55:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:55:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:55:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:55:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:55:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:55:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:55:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:55:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:55:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:55:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:55:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:55:40,404 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:55:40,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:40 BoogieIcfgContainer [2018-11-14 16:55:40,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:55:40,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:55:40,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:55:40,410 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:55:40,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:55:39" (1/3) ... [2018-11-14 16:55:40,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2813f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:40, skipping insertion in model container [2018-11-14 16:55:40,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:55:39" (2/3) ... [2018-11-14 16:55:40,412 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2813f28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:55:40, skipping insertion in model container [2018-11-14 16:55:40,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:55:40" (3/3) ... [2018-11-14 16:55:40,414 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init5_true-unreach-call_ground.i [2018-11-14 16:55:40,425 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:55:40,435 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:55:40,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:55:40,493 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:55:40,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:55:40,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:55:40,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:55:40,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:55:40,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:55:40,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:55:40,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:55:40,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:55:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-14 16:55:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:55:40,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:40,524 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] [2018-11-14 16:55:40,527 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:40,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:40,534 INFO L82 PathProgramCache]: Analyzing trace with hash -33995203, now seen corresponding path program 1 times [2018-11-14 16:55:40,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:40,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:40,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:40,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:40,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-14 16:55:40,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-14 16:55:40,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-14 16:55:40,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #106#return; {40#true} is VALID [2018-11-14 16:55:40,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret2 := main(); {40#true} is VALID [2018-11-14 16:55:40,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {40#true} is VALID [2018-11-14 16:55:40,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-14 16:55:40,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-14 16:55:40,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 16:55:40,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-14 16:55:40,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 16:55:40,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-14 16:55:40,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 16:55:40,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2018-11-14 16:55:40,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-14 16:55:40,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} havoc ~x~0;~x~0 := 0; {41#false} is VALID [2018-11-14 16:55:40,745 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume true; {41#false} is VALID [2018-11-14 16:55:40,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {41#false} is VALID [2018-11-14 16:55:40,746 INFO L256 TraceCheckUtils]: 18: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {41#false} is VALID [2018-11-14 16:55:40,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-14 16:55:40,746 INFO L273 TraceCheckUtils]: 20: Hoare triple {41#false} assume ~cond == 0; {41#false} is VALID [2018-11-14 16:55:40,747 INFO L273 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-14 16:55:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:40,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:55:40,760 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:55:40,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:40,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:55:40,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:40,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:55:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:55:40,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:55:40,956 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-14 16:55:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,209 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2018-11-14 16:55:41,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:55:41,210 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 16:55:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-14 16:55:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:55:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 89 transitions. [2018-11-14 16:55:41,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 89 transitions. [2018-11-14 16:55:41,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:41,528 INFO L225 Difference]: With dead ends: 66 [2018-11-14 16:55:41,528 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:55:41,532 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 16:55:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:55:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 16:55:41,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:41,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:41,600 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:41,600 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,605 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 16:55:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:55:41,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:41,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:41,606 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:41,607 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 16:55:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:41,611 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 16:55:41,612 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:55:41,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:41,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:41,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:41,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:55:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-14 16:55:41,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2018-11-14 16:55:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:41,619 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-14 16:55:41,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:55:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 16:55:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:55:41,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:41,620 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, 1, 1, 1, 1] [2018-11-14 16:55:41,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:41,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash 147159816, now seen corresponding path program 1 times [2018-11-14 16:55:41,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:41,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:41,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:41,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:41,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-14 16:55:41,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {237#true} is VALID [2018-11-14 16:55:41,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-14 16:55:41,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #106#return; {237#true} is VALID [2018-11-14 16:55:41,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret2 := main(); {237#true} is VALID [2018-11-14 16:55:41,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {239#(= main_~i~0 0)} is VALID [2018-11-14 16:55:41,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(= main_~i~0 0)} assume true; {239#(= main_~i~0 0)} is VALID [2018-11-14 16:55:41,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(= main_~i~0 0)} assume !(~i~0 < 100000); {238#false} is VALID [2018-11-14 16:55:41,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {238#false} ~i~0 := 0; {238#false} is VALID [2018-11-14 16:55:41,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 16:55:41,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !(~i~0 < 100000); {238#false} is VALID [2018-11-14 16:55:41,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#false} ~i~0 := 0; {238#false} is VALID [2018-11-14 16:55:41,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 16:55:41,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {238#false} assume !(~i~0 < 100000); {238#false} is VALID [2018-11-14 16:55:41,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~i~0 := 0; {238#false} is VALID [2018-11-14 16:55:41,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 16:55:41,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !(~i~0 < 100000); {238#false} is VALID [2018-11-14 16:55:41,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {238#false} ~i~0 := 0; {238#false} is VALID [2018-11-14 16:55:41,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 16:55:41,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {238#false} assume !(~i~0 < 100000); {238#false} is VALID [2018-11-14 16:55:41,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {238#false} havoc ~x~0;~x~0 := 0; {238#false} is VALID [2018-11-14 16:55:41,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-14 16:55:41,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {238#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {238#false} is VALID [2018-11-14 16:55:41,753 INFO L256 TraceCheckUtils]: 23: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {238#false} is VALID [2018-11-14 16:55:41,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-14 16:55:41,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {238#false} assume ~cond == 0; {238#false} is VALID [2018-11-14 16:55:41,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-14 16:55:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:55:41,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:55:41,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:55:41,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:55:41,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:41,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:55:41,847 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 16:55:41,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:55:41,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:55:41,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:55:41,849 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-11-14 16:55:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,367 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-14 16:55:42,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:55:42,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 16:55:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-14 16:55:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:55:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-14 16:55:42,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2018-11-14 16:55:42,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:42,581 INFO L225 Difference]: With dead ends: 66 [2018-11-14 16:55:42,581 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 16:55:42,582 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 16:55:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 16:55:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 16:55:42,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:42,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:42,636 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:42,636 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,640 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 16:55:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 16:55:42,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:42,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:42,641 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:42,641 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 16:55:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:42,645 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-14 16:55:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 16:55:42,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:42,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:42,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:42,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:55:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-14 16:55:42,649 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 27 [2018-11-14 16:55:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:42,650 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-14 16:55:42,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:55:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-14 16:55:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:55:42,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:42,652 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2018-11-14 16:55:42,652 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:42,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:42,652 INFO L82 PathProgramCache]: Analyzing trace with hash 322928098, now seen corresponding path program 1 times [2018-11-14 16:55:42,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:42,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-14 16:55:42,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {475#true} is VALID [2018-11-14 16:55:42,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 16:55:42,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #106#return; {475#true} is VALID [2018-11-14 16:55:42,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret2 := main(); {475#true} is VALID [2018-11-14 16:55:42,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {477#(= main_~i~0 0)} is VALID [2018-11-14 16:55:42,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {477#(= main_~i~0 0)} assume true; {477#(= main_~i~0 0)} is VALID [2018-11-14 16:55:42,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {477#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {478#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {478#(<= main_~i~0 1)} assume true; {478#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:42,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(<= main_~i~0 1)} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:42,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:42,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:42,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:42,800 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:42,800 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:42,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:42,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:42,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:42,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:42,803 INFO L273 TraceCheckUtils]: 25: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:42,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:42,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:42,805 INFO L273 TraceCheckUtils]: 30: Hoare triple {476#false} havoc ~x~0;~x~0 := 0; {476#false} is VALID [2018-11-14 16:55:42,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:42,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {476#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {476#false} is VALID [2018-11-14 16:55:42,806 INFO L256 TraceCheckUtils]: 33: Hoare triple {476#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {476#false} is VALID [2018-11-14 16:55:42,806 INFO L273 TraceCheckUtils]: 34: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-14 16:55:42,806 INFO L273 TraceCheckUtils]: 35: Hoare triple {476#false} assume ~cond == 0; {476#false} is VALID [2018-11-14 16:55:42,807 INFO L273 TraceCheckUtils]: 36: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-14 16:55:42,809 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 16:55:42,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:42,810 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 16:55:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:42,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:43,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2018-11-14 16:55:43,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {475#true} is VALID [2018-11-14 16:55:43,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2018-11-14 16:55:43,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #106#return; {475#true} is VALID [2018-11-14 16:55:43,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret2 := main(); {475#true} is VALID [2018-11-14 16:55:43,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {475#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {497#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:43,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {497#(<= main_~i~0 0)} assume true; {497#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:43,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {497#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {478#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {478#(<= main_~i~0 1)} assume true; {478#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:43,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(<= main_~i~0 1)} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:43,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:43,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:43,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:43,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:43,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:43,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:43,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:43,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:43,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,247 INFO L273 TraceCheckUtils]: 24: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:43,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {476#false} ~i~0 := 0; {476#false} is VALID [2018-11-14 16:55:43,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {476#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {476#false} is VALID [2018-11-14 16:55:43,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {476#false} assume !(~i~0 < 100000); {476#false} is VALID [2018-11-14 16:55:43,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {476#false} havoc ~x~0;~x~0 := 0; {476#false} is VALID [2018-11-14 16:55:43,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {476#false} assume true; {476#false} is VALID [2018-11-14 16:55:43,249 INFO L273 TraceCheckUtils]: 32: Hoare triple {476#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {476#false} is VALID [2018-11-14 16:55:43,249 INFO L256 TraceCheckUtils]: 33: Hoare triple {476#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {476#false} is VALID [2018-11-14 16:55:43,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {476#false} ~cond := #in~cond; {476#false} is VALID [2018-11-14 16:55:43,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {476#false} assume ~cond == 0; {476#false} is VALID [2018-11-14 16:55:43,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {476#false} assume !false; {476#false} is VALID [2018-11-14 16:55:43,253 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 16:55:43,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:43,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:55:43,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:55:43,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:43,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:55:43,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:43,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:55:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:55:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:55:43,473 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-11-14 16:55:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:43,839 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-14 16:55:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:55:43,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 16:55:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-14 16:55:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:55:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-14 16:55:43,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2018-11-14 16:55:43,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:43,988 INFO L225 Difference]: With dead ends: 84 [2018-11-14 16:55:43,989 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 16:55:43,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:55:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 16:55:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-14 16:55:44,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:44,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:44,054 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:44,054 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,059 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 16:55:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 16:55:44,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:44,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:44,064 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:44,064 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 16:55:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,068 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-14 16:55:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 16:55:44,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:44,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:44,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:44,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 16:55:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-14 16:55:44,073 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 37 [2018-11-14 16:55:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:44,076 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-14 16:55:44,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:55:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-14 16:55:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 16:55:44,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:44,081 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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] [2018-11-14 16:55:44,082 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:44,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 930084924, now seen corresponding path program 2 times [2018-11-14 16:55:44,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:44,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:44,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2018-11-14 16:55:44,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {885#true} is VALID [2018-11-14 16:55:44,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,277 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #106#return; {885#true} is VALID [2018-11-14 16:55:44,277 INFO L256 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret2 := main(); {885#true} is VALID [2018-11-14 16:55:44,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {885#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {887#(= main_~i~0 0)} is VALID [2018-11-14 16:55:44,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {887#(= main_~i~0 0)} assume true; {887#(= main_~i~0 0)} is VALID [2018-11-14 16:55:44,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {887#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {888#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(<= main_~i~0 1)} assume true; {888#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {888#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {889#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {889#(<= main_~i~0 2)} assume true; {889#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {889#(<= main_~i~0 2)} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {886#false} ~i~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {886#false} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {886#false} ~i~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,300 INFO L273 TraceCheckUtils]: 20: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {886#false} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {886#false} ~i~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {886#false} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {886#false} ~i~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,304 INFO L273 TraceCheckUtils]: 36: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,304 INFO L273 TraceCheckUtils]: 37: Hoare triple {886#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {886#false} is VALID [2018-11-14 16:55:44,305 INFO L273 TraceCheckUtils]: 38: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,305 INFO L273 TraceCheckUtils]: 39: Hoare triple {886#false} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,305 INFO L273 TraceCheckUtils]: 40: Hoare triple {886#false} havoc ~x~0;~x~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,305 INFO L273 TraceCheckUtils]: 41: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,306 INFO L273 TraceCheckUtils]: 42: Hoare triple {886#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {886#false} is VALID [2018-11-14 16:55:44,306 INFO L256 TraceCheckUtils]: 43: Hoare triple {886#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {886#false} is VALID [2018-11-14 16:55:44,306 INFO L273 TraceCheckUtils]: 44: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2018-11-14 16:55:44,306 INFO L273 TraceCheckUtils]: 45: Hoare triple {886#false} assume ~cond == 0; {886#false} is VALID [2018-11-14 16:55:44,306 INFO L273 TraceCheckUtils]: 46: Hoare triple {886#false} assume !false; {886#false} is VALID [2018-11-14 16:55:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 16:55:44,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:44,310 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 16:55:44,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:55:44,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:55:44,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:44,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:44,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {885#true} call ULTIMATE.init(); {885#true} is VALID [2018-11-14 16:55:44,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {885#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {885#true} is VALID [2018-11-14 16:55:44,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} #106#return; {885#true} is VALID [2018-11-14 16:55:44,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {885#true} call #t~ret2 := main(); {885#true} is VALID [2018-11-14 16:55:44,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {885#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {885#true} is VALID [2018-11-14 16:55:44,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {885#true} assume !(~i~0 < 100000); {885#true} is VALID [2018-11-14 16:55:44,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {885#true} ~i~0 := 0; {885#true} is VALID [2018-11-14 16:55:44,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {885#true} assume !(~i~0 < 100000); {885#true} is VALID [2018-11-14 16:55:44,483 INFO L273 TraceCheckUtils]: 19: Hoare triple {885#true} ~i~0 := 0; {885#true} is VALID [2018-11-14 16:55:44,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,484 INFO L273 TraceCheckUtils]: 25: Hoare triple {885#true} assume !(~i~0 < 100000); {885#true} is VALID [2018-11-14 16:55:44,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {885#true} ~i~0 := 0; {885#true} is VALID [2018-11-14 16:55:44,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,485 INFO L273 TraceCheckUtils]: 28: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,485 INFO L273 TraceCheckUtils]: 29: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {885#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {885#true} is VALID [2018-11-14 16:55:44,486 INFO L273 TraceCheckUtils]: 31: Hoare triple {885#true} assume true; {885#true} is VALID [2018-11-14 16:55:44,486 INFO L273 TraceCheckUtils]: 32: Hoare triple {885#true} assume !(~i~0 < 100000); {885#true} is VALID [2018-11-14 16:55:44,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {885#true} ~i~0 := 0; {992#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {992#(<= main_~i~0 0)} assume true; {992#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:44,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {992#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {888#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,494 INFO L273 TraceCheckUtils]: 36: Hoare triple {888#(<= main_~i~0 1)} assume true; {888#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:44,496 INFO L273 TraceCheckUtils]: 37: Hoare triple {888#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {889#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {889#(<= main_~i~0 2)} assume true; {889#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:44,498 INFO L273 TraceCheckUtils]: 39: Hoare triple {889#(<= main_~i~0 2)} assume !(~i~0 < 100000); {886#false} is VALID [2018-11-14 16:55:44,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {886#false} havoc ~x~0;~x~0 := 0; {886#false} is VALID [2018-11-14 16:55:44,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {886#false} assume true; {886#false} is VALID [2018-11-14 16:55:44,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {886#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {886#false} is VALID [2018-11-14 16:55:44,499 INFO L256 TraceCheckUtils]: 43: Hoare triple {886#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {886#false} is VALID [2018-11-14 16:55:44,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {886#false} ~cond := #in~cond; {886#false} is VALID [2018-11-14 16:55:44,499 INFO L273 TraceCheckUtils]: 45: Hoare triple {886#false} assume ~cond == 0; {886#false} is VALID [2018-11-14 16:55:44,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {886#false} assume !false; {886#false} is VALID [2018-11-14 16:55:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 16:55:44,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:44,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:55:44,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-14 16:55:44,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:44,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:55:44,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:44,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:55:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:55:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:55:44,652 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-11-14 16:55:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:44,979 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2018-11-14 16:55:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:55:44,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-14 16:55:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:55:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2018-11-14 16:55:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:55:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2018-11-14 16:55:44,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 100 transitions. [2018-11-14 16:55:45,103 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 16:55:45,105 INFO L225 Difference]: With dead ends: 102 [2018-11-14 16:55:45,105 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:55:45,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:55:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:55:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 16:55:45,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:45,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 16:55:45,161 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:55:45,161 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:55:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:45,164 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-14 16:55:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-14 16:55:45,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:45,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:45,165 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 16:55:45,166 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 16:55:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:45,169 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-14 16:55:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-14 16:55:45,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:45,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:45,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:45,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:45,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 16:55:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-11-14 16:55:45,173 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 47 [2018-11-14 16:55:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-14 16:55:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:55:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-11-14 16:55:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:55:45,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:45,176 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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 16:55:45,176 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash -797767146, now seen corresponding path program 3 times [2018-11-14 16:55:45,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:45,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 16:55:45,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1388#true} is VALID [2018-11-14 16:55:45,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #106#return; {1388#true} is VALID [2018-11-14 16:55:45,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret2 := main(); {1388#true} is VALID [2018-11-14 16:55:45,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1390#(= main_~i~0 0)} is VALID [2018-11-14 16:55:45,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {1390#(= main_~i~0 0)} assume true; {1390#(= main_~i~0 0)} is VALID [2018-11-14 16:55:45,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {1390#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1391#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {1391#(<= main_~i~0 1)} assume true; {1391#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {1391#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1392#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {1392#(<= main_~i~0 2)} assume true; {1392#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {1392#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1393#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {1393#(<= main_~i~0 3)} assume true; {1393#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {1393#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,352 INFO L273 TraceCheckUtils]: 17: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,355 INFO L273 TraceCheckUtils]: 24: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,355 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,355 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 28: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 30: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 31: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 32: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,357 INFO L273 TraceCheckUtils]: 34: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,357 INFO L273 TraceCheckUtils]: 36: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,357 INFO L273 TraceCheckUtils]: 37: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,358 INFO L273 TraceCheckUtils]: 39: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,359 INFO L273 TraceCheckUtils]: 44: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,360 INFO L273 TraceCheckUtils]: 45: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,360 INFO L273 TraceCheckUtils]: 46: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,360 INFO L273 TraceCheckUtils]: 47: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,360 INFO L273 TraceCheckUtils]: 48: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,361 INFO L273 TraceCheckUtils]: 49: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,361 INFO L273 TraceCheckUtils]: 50: Hoare triple {1389#false} havoc ~x~0;~x~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,361 INFO L273 TraceCheckUtils]: 51: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,361 INFO L273 TraceCheckUtils]: 52: Hoare triple {1389#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1389#false} is VALID [2018-11-14 16:55:45,362 INFO L256 TraceCheckUtils]: 53: Hoare triple {1389#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1389#false} is VALID [2018-11-14 16:55:45,362 INFO L273 TraceCheckUtils]: 54: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-14 16:55:45,362 INFO L273 TraceCheckUtils]: 55: Hoare triple {1389#false} assume ~cond == 0; {1389#false} is VALID [2018-11-14 16:55:45,362 INFO L273 TraceCheckUtils]: 56: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 16:55:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-14 16:55:45,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:45,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:55:45,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:55:45,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:55:45,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:45,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:45,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {1388#true} call ULTIMATE.init(); {1388#true} is VALID [2018-11-14 16:55:45,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {1388#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1388#true} is VALID [2018-11-14 16:55:45,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1388#true} {1388#true} #106#return; {1388#true} is VALID [2018-11-14 16:55:45,609 INFO L256 TraceCheckUtils]: 4: Hoare triple {1388#true} call #t~ret2 := main(); {1388#true} is VALID [2018-11-14 16:55:45,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {1388#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1388#true} is VALID [2018-11-14 16:55:45,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {1388#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1388#true} is VALID [2018-11-14 16:55:45,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {1388#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1388#true} is VALID [2018-11-14 16:55:45,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {1388#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1388#true} is VALID [2018-11-14 16:55:45,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {1388#true} assume true; {1388#true} is VALID [2018-11-14 16:55:45,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {1388#true} assume !(~i~0 < 100000); {1388#true} is VALID [2018-11-14 16:55:45,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {1388#true} ~i~0 := 0; {1439#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {1439#(<= main_~i~0 0)} assume true; {1439#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:45,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {1439#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1391#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {1391#(<= main_~i~0 1)} assume true; {1391#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:45,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {1391#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1392#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1392#(<= main_~i~0 2)} assume true; {1392#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:45,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {1392#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1393#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {1393#(<= main_~i~0 3)} assume true; {1393#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:45,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {1393#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,624 INFO L273 TraceCheckUtils]: 27: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,624 INFO L273 TraceCheckUtils]: 28: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,624 INFO L273 TraceCheckUtils]: 29: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,624 INFO L273 TraceCheckUtils]: 30: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,625 INFO L273 TraceCheckUtils]: 31: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,625 INFO L273 TraceCheckUtils]: 33: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,625 INFO L273 TraceCheckUtils]: 34: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,626 INFO L273 TraceCheckUtils]: 36: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,626 INFO L273 TraceCheckUtils]: 37: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {1389#false} ~i~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,627 INFO L273 TraceCheckUtils]: 42: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,627 INFO L273 TraceCheckUtils]: 44: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 45: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 46: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {1389#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 49: Hoare triple {1389#false} assume !(~i~0 < 100000); {1389#false} is VALID [2018-11-14 16:55:45,628 INFO L273 TraceCheckUtils]: 50: Hoare triple {1389#false} havoc ~x~0;~x~0 := 0; {1389#false} is VALID [2018-11-14 16:55:45,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {1389#false} assume true; {1389#false} is VALID [2018-11-14 16:55:45,629 INFO L273 TraceCheckUtils]: 52: Hoare triple {1389#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1389#false} is VALID [2018-11-14 16:55:45,629 INFO L256 TraceCheckUtils]: 53: Hoare triple {1389#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1389#false} is VALID [2018-11-14 16:55:45,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {1389#false} ~cond := #in~cond; {1389#false} is VALID [2018-11-14 16:55:45,629 INFO L273 TraceCheckUtils]: 55: Hoare triple {1389#false} assume ~cond == 0; {1389#false} is VALID [2018-11-14 16:55:45,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {1389#false} assume !false; {1389#false} is VALID [2018-11-14 16:55:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-14 16:55:45,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:45,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:55:45,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-14 16:55:45,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:45,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:55:45,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:45,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:55:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:55:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:55:45,711 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 7 states. [2018-11-14 16:55:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,021 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-11-14 16:55:46,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:55:46,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-11-14 16:55:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 16:55:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:55:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2018-11-14 16:55:46,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2018-11-14 16:55:46,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:46,192 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:55:46,192 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 16:55:46,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:55:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 16:55:46,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-14 16:55:46,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:46,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-14 16:55:46,307 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:55:46,307 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:55:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,310 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-14 16:55:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-14 16:55:46,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:46,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:46,311 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 16:55:46,311 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 16:55:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:46,314 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-14 16:55:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-14 16:55:46,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:46,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:46,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:46,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 16:55:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-11-14 16:55:46,319 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 57 [2018-11-14 16:55:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:46,319 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-14 16:55:46,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:55:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-14 16:55:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 16:55:46,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:46,321 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:55:46,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:46,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:46,322 INFO L82 PathProgramCache]: Analyzing trace with hash 878498672, now seen corresponding path program 4 times [2018-11-14 16:55:46,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:46,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:46,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:46,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1984#true} is VALID [2018-11-14 16:55:46,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {1984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1984#true} is VALID [2018-11-14 16:55:46,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2018-11-14 16:55:46,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #106#return; {1984#true} is VALID [2018-11-14 16:55:46,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret2 := main(); {1984#true} is VALID [2018-11-14 16:55:46,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {1984#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1986#(= main_~i~0 0)} is VALID [2018-11-14 16:55:46,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {1986#(= main_~i~0 0)} assume true; {1986#(= main_~i~0 0)} is VALID [2018-11-14 16:55:46,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {1986#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1987#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:46,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {1987#(<= main_~i~0 1)} assume true; {1987#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:46,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {1987#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1988#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:46,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {1988#(<= main_~i~0 2)} assume true; {1988#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:46,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {1988#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1989#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:46,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#(<= main_~i~0 3)} assume true; {1989#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:46,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1990#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:46,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {1990#(<= main_~i~0 4)} assume true; {1990#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:46,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {1990#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,500 INFO L273 TraceCheckUtils]: 19: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,502 INFO L273 TraceCheckUtils]: 31: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,504 INFO L273 TraceCheckUtils]: 39: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,505 INFO L273 TraceCheckUtils]: 45: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,507 INFO L273 TraceCheckUtils]: 53: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,507 INFO L273 TraceCheckUtils]: 54: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,508 INFO L273 TraceCheckUtils]: 55: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,508 INFO L273 TraceCheckUtils]: 56: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,508 INFO L273 TraceCheckUtils]: 59: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,509 INFO L273 TraceCheckUtils]: 60: Hoare triple {1985#false} havoc ~x~0;~x~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,509 INFO L273 TraceCheckUtils]: 61: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {1985#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1985#false} is VALID [2018-11-14 16:55:46,509 INFO L256 TraceCheckUtils]: 63: Hoare triple {1985#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1985#false} is VALID [2018-11-14 16:55:46,509 INFO L273 TraceCheckUtils]: 64: Hoare triple {1985#false} ~cond := #in~cond; {1985#false} is VALID [2018-11-14 16:55:46,510 INFO L273 TraceCheckUtils]: 65: Hoare triple {1985#false} assume ~cond == 0; {1985#false} is VALID [2018-11-14 16:55:46,510 INFO L273 TraceCheckUtils]: 66: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2018-11-14 16:55:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:55:46,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:46,514 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 16:55:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:55:46,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:55:46,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:46,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:46,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {1984#true} call ULTIMATE.init(); {1984#true} is VALID [2018-11-14 16:55:46,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {1984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1984#true} is VALID [2018-11-14 16:55:46,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {1984#true} assume true; {1984#true} is VALID [2018-11-14 16:55:46,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1984#true} {1984#true} #106#return; {1984#true} is VALID [2018-11-14 16:55:46,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {1984#true} call #t~ret2 := main(); {1984#true} is VALID [2018-11-14 16:55:46,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {1984#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2009#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:46,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {2009#(<= main_~i~0 0)} assume true; {2009#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:46,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {2009#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1987#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:46,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1987#(<= main_~i~0 1)} assume true; {1987#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:46,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1987#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1988#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:46,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {1988#(<= main_~i~0 2)} assume true; {1988#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:46,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {1988#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1989#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:46,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {1989#(<= main_~i~0 3)} assume true; {1989#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:46,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {1989#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1990#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:46,813 INFO L273 TraceCheckUtils]: 14: Hoare triple {1990#(<= main_~i~0 4)} assume true; {1990#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:46,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {1990#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,815 INFO L273 TraceCheckUtils]: 20: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,816 INFO L273 TraceCheckUtils]: 22: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,817 INFO L273 TraceCheckUtils]: 27: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,818 INFO L273 TraceCheckUtils]: 29: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,820 INFO L273 TraceCheckUtils]: 39: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,820 INFO L273 TraceCheckUtils]: 40: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,820 INFO L273 TraceCheckUtils]: 43: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 46: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 47: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 48: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,821 INFO L273 TraceCheckUtils]: 49: Hoare triple {1985#false} ~i~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 53: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 54: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,822 INFO L273 TraceCheckUtils]: 55: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,823 INFO L273 TraceCheckUtils]: 57: Hoare triple {1985#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1985#false} is VALID [2018-11-14 16:55:46,823 INFO L273 TraceCheckUtils]: 58: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,823 INFO L273 TraceCheckUtils]: 59: Hoare triple {1985#false} assume !(~i~0 < 100000); {1985#false} is VALID [2018-11-14 16:55:46,823 INFO L273 TraceCheckUtils]: 60: Hoare triple {1985#false} havoc ~x~0;~x~0 := 0; {1985#false} is VALID [2018-11-14 16:55:46,824 INFO L273 TraceCheckUtils]: 61: Hoare triple {1985#false} assume true; {1985#false} is VALID [2018-11-14 16:55:46,824 INFO L273 TraceCheckUtils]: 62: Hoare triple {1985#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1985#false} is VALID [2018-11-14 16:55:46,824 INFO L256 TraceCheckUtils]: 63: Hoare triple {1985#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {1985#false} is VALID [2018-11-14 16:55:46,824 INFO L273 TraceCheckUtils]: 64: Hoare triple {1985#false} ~cond := #in~cond; {1985#false} is VALID [2018-11-14 16:55:46,825 INFO L273 TraceCheckUtils]: 65: Hoare triple {1985#false} assume ~cond == 0; {1985#false} is VALID [2018-11-14 16:55:46,825 INFO L273 TraceCheckUtils]: 66: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2018-11-14 16:55:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:55:46,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:46,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:55:46,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-11-14 16:55:46,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:46,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:55:46,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:46,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:55:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:55:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:55:46,921 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 8 states. [2018-11-14 16:55:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:47,522 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-11-14 16:55:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:55:47,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-11-14 16:55:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-14 16:55:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:55:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2018-11-14 16:55:47,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 120 transitions. [2018-11-14 16:55:47,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:47,808 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:55:47,809 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 16:55:47,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:55:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 16:55:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-14 16:55:47,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:47,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-14 16:55:47,878 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 16:55:47,878 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 16:55:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:47,881 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-14 16:55:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-14 16:55:47,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:47,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:47,882 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 16:55:47,882 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 16:55:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:47,886 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-14 16:55:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-14 16:55:47,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:47,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:47,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:47,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:55:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-14 16:55:47,890 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 67 [2018-11-14 16:55:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:47,890 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-14 16:55:47,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:55:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-14 16:55:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 16:55:47,892 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:47,892 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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 16:55:47,892 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:47,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:47,893 INFO L82 PathProgramCache]: Analyzing trace with hash -432442294, now seen corresponding path program 5 times [2018-11-14 16:55:47,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:47,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:48,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {2673#true} call ULTIMATE.init(); {2673#true} is VALID [2018-11-14 16:55:48,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {2673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2673#true} is VALID [2018-11-14 16:55:48,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:48,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2673#true} {2673#true} #106#return; {2673#true} is VALID [2018-11-14 16:55:48,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {2673#true} call #t~ret2 := main(); {2673#true} is VALID [2018-11-14 16:55:48,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {2673#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2675#(= main_~i~0 0)} is VALID [2018-11-14 16:55:48,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {2675#(= main_~i~0 0)} assume true; {2675#(= main_~i~0 0)} is VALID [2018-11-14 16:55:48,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {2675#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2676#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:48,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {2676#(<= main_~i~0 1)} assume true; {2676#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:48,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {2676#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2677#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:48,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {2677#(<= main_~i~0 2)} assume true; {2677#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:48,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {2677#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2678#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:48,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {2678#(<= main_~i~0 3)} assume true; {2678#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:48,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2678#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2679#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:48,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2679#(<= main_~i~0 4)} assume true; {2679#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:48,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {2679#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2680#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:48,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {2680#(<= main_~i~0 5)} assume true; {2680#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:48,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {2680#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:48,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {2674#false} ~i~0 := 0; {2674#false} is VALID [2018-11-14 16:55:48,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {2674#false} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:48,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {2674#false} ~i~0 := 0; {2674#false} is VALID [2018-11-14 16:55:48,331 INFO L273 TraceCheckUtils]: 32: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,331 INFO L273 TraceCheckUtils]: 34: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,331 INFO L273 TraceCheckUtils]: 35: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 38: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 40: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {2674#false} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:48,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {2674#false} ~i~0 := 0; {2674#false} is VALID [2018-11-14 16:55:48,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,334 INFO L273 TraceCheckUtils]: 49: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,334 INFO L273 TraceCheckUtils]: 50: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,335 INFO L273 TraceCheckUtils]: 51: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,335 INFO L273 TraceCheckUtils]: 53: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {2674#false} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:48,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {2674#false} ~i~0 := 0; {2674#false} is VALID [2018-11-14 16:55:48,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,337 INFO L273 TraceCheckUtils]: 63: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,337 INFO L273 TraceCheckUtils]: 64: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,338 INFO L273 TraceCheckUtils]: 66: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,338 INFO L273 TraceCheckUtils]: 67: Hoare triple {2674#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2674#false} is VALID [2018-11-14 16:55:48,338 INFO L273 TraceCheckUtils]: 68: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,338 INFO L273 TraceCheckUtils]: 69: Hoare triple {2674#false} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:48,338 INFO L273 TraceCheckUtils]: 70: Hoare triple {2674#false} havoc ~x~0;~x~0 := 0; {2674#false} is VALID [2018-11-14 16:55:48,339 INFO L273 TraceCheckUtils]: 71: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:48,339 INFO L273 TraceCheckUtils]: 72: Hoare triple {2674#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2674#false} is VALID [2018-11-14 16:55:48,339 INFO L256 TraceCheckUtils]: 73: Hoare triple {2674#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2674#false} is VALID [2018-11-14 16:55:48,339 INFO L273 TraceCheckUtils]: 74: Hoare triple {2674#false} ~cond := #in~cond; {2674#false} is VALID [2018-11-14 16:55:48,339 INFO L273 TraceCheckUtils]: 75: Hoare triple {2674#false} assume ~cond == 0; {2674#false} is VALID [2018-11-14 16:55:48,340 INFO L273 TraceCheckUtils]: 76: Hoare triple {2674#false} assume !false; {2674#false} is VALID [2018-11-14 16:55:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-14 16:55:48,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:48,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:48,357 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:55:54,454 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:55:54,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:54,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:54,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {2673#true} call ULTIMATE.init(); {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {2673#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2673#true} {2673#true} #106#return; {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {2673#true} call #t~ret2 := main(); {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {2673#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 8: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 15: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 17: Hoare triple {2673#true} assume !(~i~0 < 100000); {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {2673#true} ~i~0 := 0; {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,622 INFO L273 TraceCheckUtils]: 24: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 28: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 29: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 30: Hoare triple {2673#true} assume !(~i~0 < 100000); {2673#true} is VALID [2018-11-14 16:55:54,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {2673#true} ~i~0 := 0; {2673#true} is VALID [2018-11-14 16:55:54,624 INFO L273 TraceCheckUtils]: 32: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,624 INFO L273 TraceCheckUtils]: 33: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 37: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {2673#true} assume !(~i~0 < 100000); {2673#true} is VALID [2018-11-14 16:55:54,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {2673#true} ~i~0 := 0; {2673#true} is VALID [2018-11-14 16:55:54,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,626 INFO L273 TraceCheckUtils]: 46: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,626 INFO L273 TraceCheckUtils]: 47: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 48: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 49: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 52: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,627 INFO L273 TraceCheckUtils]: 54: Hoare triple {2673#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2673#true} is VALID [2018-11-14 16:55:54,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {2673#true} assume true; {2673#true} is VALID [2018-11-14 16:55:54,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {2673#true} assume !(~i~0 < 100000); {2673#true} is VALID [2018-11-14 16:55:54,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {2673#true} ~i~0 := 0; {2855#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:54,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {2855#(<= main_~i~0 0)} assume true; {2855#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:54,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {2855#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2676#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:54,632 INFO L273 TraceCheckUtils]: 60: Hoare triple {2676#(<= main_~i~0 1)} assume true; {2676#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:54,634 INFO L273 TraceCheckUtils]: 61: Hoare triple {2676#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2677#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:54,634 INFO L273 TraceCheckUtils]: 62: Hoare triple {2677#(<= main_~i~0 2)} assume true; {2677#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:54,636 INFO L273 TraceCheckUtils]: 63: Hoare triple {2677#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2678#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:54,636 INFO L273 TraceCheckUtils]: 64: Hoare triple {2678#(<= main_~i~0 3)} assume true; {2678#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:54,638 INFO L273 TraceCheckUtils]: 65: Hoare triple {2678#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2679#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:54,638 INFO L273 TraceCheckUtils]: 66: Hoare triple {2679#(<= main_~i~0 4)} assume true; {2679#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:54,640 INFO L273 TraceCheckUtils]: 67: Hoare triple {2679#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2680#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:54,643 INFO L273 TraceCheckUtils]: 68: Hoare triple {2680#(<= main_~i~0 5)} assume true; {2680#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:54,643 INFO L273 TraceCheckUtils]: 69: Hoare triple {2680#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2674#false} is VALID [2018-11-14 16:55:54,643 INFO L273 TraceCheckUtils]: 70: Hoare triple {2674#false} havoc ~x~0;~x~0 := 0; {2674#false} is VALID [2018-11-14 16:55:54,643 INFO L273 TraceCheckUtils]: 71: Hoare triple {2674#false} assume true; {2674#false} is VALID [2018-11-14 16:55:54,644 INFO L273 TraceCheckUtils]: 72: Hoare triple {2674#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2674#false} is VALID [2018-11-14 16:55:54,644 INFO L256 TraceCheckUtils]: 73: Hoare triple {2674#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {2674#false} is VALID [2018-11-14 16:55:54,644 INFO L273 TraceCheckUtils]: 74: Hoare triple {2674#false} ~cond := #in~cond; {2674#false} is VALID [2018-11-14 16:55:54,644 INFO L273 TraceCheckUtils]: 75: Hoare triple {2674#false} assume ~cond == 0; {2674#false} is VALID [2018-11-14 16:55:54,644 INFO L273 TraceCheckUtils]: 76: Hoare triple {2674#false} assume !false; {2674#false} is VALID [2018-11-14 16:55:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-14 16:55:54,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:54,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:55:54,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-11-14 16:55:54,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:54,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:55:54,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:54,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:55:54,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:55:54,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:54,734 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 9 states. [2018-11-14 16:55:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,239 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-11-14 16:55:55,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:55:55,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-11-14 16:55:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2018-11-14 16:55:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:55:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2018-11-14 16:55:55,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 130 transitions. [2018-11-14 16:55:55,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:55,489 INFO L225 Difference]: With dead ends: 156 [2018-11-14 16:55:55,489 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:55:55,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:55:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:55:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-14 16:55:55,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:55,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2018-11-14 16:55:55,531 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 16:55:55,531 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 16:55:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,535 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-14 16:55:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-14 16:55:55,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:55,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:55,536 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2018-11-14 16:55:55,536 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2018-11-14 16:55:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:55,539 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-14 16:55:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-14 16:55:55,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:55,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:55,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:55,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 16:55:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-11-14 16:55:55,544 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 77 [2018-11-14 16:55:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:55,544 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-11-14 16:55:55,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:55:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-14 16:55:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-14 16:55:55,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:55,546 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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 16:55:55,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:55,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1208814756, now seen corresponding path program 6 times [2018-11-14 16:55:55,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:55,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:55,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:55,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:55,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {3455#true} call ULTIMATE.init(); {3455#true} is VALID [2018-11-14 16:55:55,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {3455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3455#true} is VALID [2018-11-14 16:55:55,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:55,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3455#true} {3455#true} #106#return; {3455#true} is VALID [2018-11-14 16:55:55,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {3455#true} call #t~ret2 := main(); {3455#true} is VALID [2018-11-14 16:55:55,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {3455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3457#(= main_~i~0 0)} is VALID [2018-11-14 16:55:55,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {3457#(= main_~i~0 0)} assume true; {3457#(= main_~i~0 0)} is VALID [2018-11-14 16:55:55,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {3457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3458#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:55,713 INFO L273 TraceCheckUtils]: 8: Hoare triple {3458#(<= main_~i~0 1)} assume true; {3458#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:55,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {3458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3459#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:55,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {3459#(<= main_~i~0 2)} assume true; {3459#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:55,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {3459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3460#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:55,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {3460#(<= main_~i~0 3)} assume true; {3460#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:55,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {3460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3461#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:55,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {3461#(<= main_~i~0 4)} assume true; {3461#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:55,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {3461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3462#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:55,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {3462#(<= main_~i~0 5)} assume true; {3462#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:55,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {3462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3463#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:55,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {3463#(<= main_~i~0 6)} assume true; {3463#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:55,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {3463#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:55,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {3456#false} ~i~0 := 0; {3456#false} is VALID [2018-11-14 16:55:55,721 INFO L273 TraceCheckUtils]: 21: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,724 INFO L273 TraceCheckUtils]: 28: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,724 INFO L273 TraceCheckUtils]: 29: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,724 INFO L273 TraceCheckUtils]: 31: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,725 INFO L273 TraceCheckUtils]: 33: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,725 INFO L273 TraceCheckUtils]: 34: Hoare triple {3456#false} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:55,725 INFO L273 TraceCheckUtils]: 35: Hoare triple {3456#false} ~i~0 := 0; {3456#false} is VALID [2018-11-14 16:55:55,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 40: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 41: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,726 INFO L273 TraceCheckUtils]: 42: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,727 INFO L273 TraceCheckUtils]: 43: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,727 INFO L273 TraceCheckUtils]: 47: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,728 INFO L273 TraceCheckUtils]: 48: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,728 INFO L273 TraceCheckUtils]: 49: Hoare triple {3456#false} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:55,728 INFO L273 TraceCheckUtils]: 50: Hoare triple {3456#false} ~i~0 := 0; {3456#false} is VALID [2018-11-14 16:55:55,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,729 INFO L273 TraceCheckUtils]: 53: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,729 INFO L273 TraceCheckUtils]: 55: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,729 INFO L273 TraceCheckUtils]: 56: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,729 INFO L273 TraceCheckUtils]: 57: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 58: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 59: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 60: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 62: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,730 INFO L273 TraceCheckUtils]: 63: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,731 INFO L273 TraceCheckUtils]: 64: Hoare triple {3456#false} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:55,731 INFO L273 TraceCheckUtils]: 65: Hoare triple {3456#false} ~i~0 := 0; {3456#false} is VALID [2018-11-14 16:55:55,731 INFO L273 TraceCheckUtils]: 66: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 69: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 70: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 71: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 72: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 73: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,733 INFO L273 TraceCheckUtils]: 75: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,733 INFO L273 TraceCheckUtils]: 76: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,733 INFO L273 TraceCheckUtils]: 77: Hoare triple {3456#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3456#false} is VALID [2018-11-14 16:55:55,733 INFO L273 TraceCheckUtils]: 78: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,733 INFO L273 TraceCheckUtils]: 79: Hoare triple {3456#false} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:55,734 INFO L273 TraceCheckUtils]: 80: Hoare triple {3456#false} havoc ~x~0;~x~0 := 0; {3456#false} is VALID [2018-11-14 16:55:55,734 INFO L273 TraceCheckUtils]: 81: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:55,734 INFO L273 TraceCheckUtils]: 82: Hoare triple {3456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3456#false} is VALID [2018-11-14 16:55:55,734 INFO L256 TraceCheckUtils]: 83: Hoare triple {3456#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {3456#false} is VALID [2018-11-14 16:55:55,734 INFO L273 TraceCheckUtils]: 84: Hoare triple {3456#false} ~cond := #in~cond; {3456#false} is VALID [2018-11-14 16:55:55,735 INFO L273 TraceCheckUtils]: 85: Hoare triple {3456#false} assume ~cond == 0; {3456#false} is VALID [2018-11-14 16:55:55,735 INFO L273 TraceCheckUtils]: 86: Hoare triple {3456#false} assume !false; {3456#false} is VALID [2018-11-14 16:55:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-14 16:55:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:55,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:55,761 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:55:57,401 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:55:57,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:55:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:57,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:57,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {3455#true} call ULTIMATE.init(); {3455#true} is VALID [2018-11-14 16:55:57,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {3455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3455#true} is VALID [2018-11-14 16:55:57,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3455#true} {3455#true} #106#return; {3455#true} is VALID [2018-11-14 16:55:57,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {3455#true} call #t~ret2 := main(); {3455#true} is VALID [2018-11-14 16:55:57,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {3455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3455#true} is VALID [2018-11-14 16:55:57,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 13: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {3518#(<= main_~i~0 100000)} assume true; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {3518#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 20: Hoare triple {3455#true} ~i~0 := 0; {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 21: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 23: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 27: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 28: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 29: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,926 INFO L273 TraceCheckUtils]: 31: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {3518#(<= main_~i~0 100000)} assume true; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {3518#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {3455#true} is VALID [2018-11-14 16:55:57,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {3455#true} ~i~0 := 0; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 37: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 44: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 45: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 46: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 47: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 48: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 49: Hoare triple {3455#true} assume !(~i~0 < 100000); {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 50: Hoare triple {3455#true} ~i~0 := 0; {3455#true} is VALID [2018-11-14 16:55:57,929 INFO L273 TraceCheckUtils]: 51: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 52: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 53: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 55: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 56: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 57: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 58: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,930 INFO L273 TraceCheckUtils]: 59: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,931 INFO L273 TraceCheckUtils]: 60: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3455#true} is VALID [2018-11-14 16:55:57,931 INFO L273 TraceCheckUtils]: 61: Hoare triple {3455#true} assume true; {3455#true} is VALID [2018-11-14 16:55:57,932 INFO L273 TraceCheckUtils]: 62: Hoare triple {3455#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,934 INFO L273 TraceCheckUtils]: 63: Hoare triple {3518#(<= main_~i~0 100000)} assume true; {3518#(<= main_~i~0 100000)} is VALID [2018-11-14 16:55:57,934 INFO L273 TraceCheckUtils]: 64: Hoare triple {3518#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {3455#true} is VALID [2018-11-14 16:55:57,934 INFO L273 TraceCheckUtils]: 65: Hoare triple {3455#true} ~i~0 := 0; {3663#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:57,935 INFO L273 TraceCheckUtils]: 66: Hoare triple {3663#(<= main_~i~0 0)} assume true; {3663#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:57,936 INFO L273 TraceCheckUtils]: 67: Hoare triple {3663#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3458#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:57,936 INFO L273 TraceCheckUtils]: 68: Hoare triple {3458#(<= main_~i~0 1)} assume true; {3458#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:57,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {3458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3459#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:57,937 INFO L273 TraceCheckUtils]: 70: Hoare triple {3459#(<= main_~i~0 2)} assume true; {3459#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:57,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {3459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3460#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:57,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {3460#(<= main_~i~0 3)} assume true; {3460#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:57,939 INFO L273 TraceCheckUtils]: 73: Hoare triple {3460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3461#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:57,940 INFO L273 TraceCheckUtils]: 74: Hoare triple {3461#(<= main_~i~0 4)} assume true; {3461#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:57,941 INFO L273 TraceCheckUtils]: 75: Hoare triple {3461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3462#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:57,941 INFO L273 TraceCheckUtils]: 76: Hoare triple {3462#(<= main_~i~0 5)} assume true; {3462#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:57,958 INFO L273 TraceCheckUtils]: 77: Hoare triple {3462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3463#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:57,967 INFO L273 TraceCheckUtils]: 78: Hoare triple {3463#(<= main_~i~0 6)} assume true; {3463#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:57,980 INFO L273 TraceCheckUtils]: 79: Hoare triple {3463#(<= main_~i~0 6)} assume !(~i~0 < 100000); {3456#false} is VALID [2018-11-14 16:55:57,980 INFO L273 TraceCheckUtils]: 80: Hoare triple {3456#false} havoc ~x~0;~x~0 := 0; {3456#false} is VALID [2018-11-14 16:55:57,980 INFO L273 TraceCheckUtils]: 81: Hoare triple {3456#false} assume true; {3456#false} is VALID [2018-11-14 16:55:57,981 INFO L273 TraceCheckUtils]: 82: Hoare triple {3456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3456#false} is VALID [2018-11-14 16:55:57,981 INFO L256 TraceCheckUtils]: 83: Hoare triple {3456#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {3456#false} is VALID [2018-11-14 16:55:57,981 INFO L273 TraceCheckUtils]: 84: Hoare triple {3456#false} ~cond := #in~cond; {3456#false} is VALID [2018-11-14 16:55:57,981 INFO L273 TraceCheckUtils]: 85: Hoare triple {3456#false} assume ~cond == 0; {3456#false} is VALID [2018-11-14 16:55:57,981 INFO L273 TraceCheckUtils]: 86: Hoare triple {3456#false} assume !false; {3456#false} is VALID [2018-11-14 16:55:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-14 16:55:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:58,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-14 16:55:58,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-11-14 16:55:58,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:58,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:55:58,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:58,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:55:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:55:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:58,124 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 11 states. [2018-11-14 16:55:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:58,753 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-11-14 16:55:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:55:58,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-11-14 16:55:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:55:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2018-11-14 16:55:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:55:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2018-11-14 16:55:58,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 140 transitions. [2018-11-14 16:55:58,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:58,966 INFO L225 Difference]: With dead ends: 174 [2018-11-14 16:55:58,966 INFO L226 Difference]: Without dead ends: 102 [2018-11-14 16:55:58,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-14 16:55:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-14 16:55:59,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:55:59,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 102 states. [2018-11-14 16:55:59,007 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-14 16:55:59,007 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-14 16:55:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:59,011 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 16:55:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 16:55:59,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:59,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:59,011 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 102 states. [2018-11-14 16:55:59,011 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 102 states. [2018-11-14 16:55:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:55:59,015 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-14 16:55:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 16:55:59,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:55:59,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:55:59,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:55:59,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:55:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-14 16:55:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-11-14 16:55:59,019 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 87 [2018-11-14 16:55:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:55:59,019 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-11-14 16:55:59,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:55:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-11-14 16:55:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 16:55:59,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:55:59,021 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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 16:55:59,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:55:59,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:55:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -858538882, now seen corresponding path program 7 times [2018-11-14 16:55:59,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:55:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:55:59,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:59,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:55:59,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:55:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:59,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {4331#true} call ULTIMATE.init(); {4331#true} is VALID [2018-11-14 16:55:59,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {4331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4331#true} is VALID [2018-11-14 16:55:59,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {4331#true} assume true; {4331#true} is VALID [2018-11-14 16:55:59,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4331#true} {4331#true} #106#return; {4331#true} is VALID [2018-11-14 16:55:59,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {4331#true} call #t~ret2 := main(); {4331#true} is VALID [2018-11-14 16:55:59,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {4331#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4333#(= main_~i~0 0)} is VALID [2018-11-14 16:55:59,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {4333#(= main_~i~0 0)} assume true; {4333#(= main_~i~0 0)} is VALID [2018-11-14 16:55:59,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {4333#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4334#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {4334#(<= main_~i~0 1)} assume true; {4334#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {4334#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4335#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {4335#(<= main_~i~0 2)} assume true; {4335#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {4335#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4336#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {4336#(<= main_~i~0 3)} assume true; {4336#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {4336#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4337#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {4337#(<= main_~i~0 4)} assume true; {4337#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4338#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {4338#(<= main_~i~0 5)} assume true; {4338#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {4338#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4339#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {4339#(<= main_~i~0 6)} assume true; {4339#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {4339#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4340#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {4340#(<= main_~i~0 7)} assume true; {4340#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {4340#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,413 INFO L273 TraceCheckUtils]: 30: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 41: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 42: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 43: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 52: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 56: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 57: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 60: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 61: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 64: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 65: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 66: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 72: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 73: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 74: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 75: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 76: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 77: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 79: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 81: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 82: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 83: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 84: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 85: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 87: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,421 INFO L273 TraceCheckUtils]: 88: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {4332#false} havoc ~x~0;~x~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {4332#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L256 TraceCheckUtils]: 93: Hoare triple {4332#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 94: Hoare triple {4332#false} ~cond := #in~cond; {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 95: Hoare triple {4332#false} assume ~cond == 0; {4332#false} is VALID [2018-11-14 16:55:59,422 INFO L273 TraceCheckUtils]: 96: Hoare triple {4332#false} assume !false; {4332#false} is VALID [2018-11-14 16:55:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-14 16:55:59,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:55:59,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:55:59,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:55:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:55:59,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:55:59,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {4331#true} call ULTIMATE.init(); {4331#true} is VALID [2018-11-14 16:55:59,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {4331#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4331#true} is VALID [2018-11-14 16:55:59,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {4331#true} assume true; {4331#true} is VALID [2018-11-14 16:55:59,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4331#true} {4331#true} #106#return; {4331#true} is VALID [2018-11-14 16:55:59,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {4331#true} call #t~ret2 := main(); {4331#true} is VALID [2018-11-14 16:55:59,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {4331#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4359#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:59,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {4359#(<= main_~i~0 0)} assume true; {4359#(<= main_~i~0 0)} is VALID [2018-11-14 16:55:59,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {4359#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4334#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {4334#(<= main_~i~0 1)} assume true; {4334#(<= main_~i~0 1)} is VALID [2018-11-14 16:55:59,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {4334#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4335#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {4335#(<= main_~i~0 2)} assume true; {4335#(<= main_~i~0 2)} is VALID [2018-11-14 16:55:59,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {4335#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4336#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {4336#(<= main_~i~0 3)} assume true; {4336#(<= main_~i~0 3)} is VALID [2018-11-14 16:55:59,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {4336#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4337#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {4337#(<= main_~i~0 4)} assume true; {4337#(<= main_~i~0 4)} is VALID [2018-11-14 16:55:59,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {4337#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4338#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {4338#(<= main_~i~0 5)} assume true; {4338#(<= main_~i~0 5)} is VALID [2018-11-14 16:55:59,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {4338#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4339#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {4339#(<= main_~i~0 6)} assume true; {4339#(<= main_~i~0 6)} is VALID [2018-11-14 16:55:59,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {4339#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4340#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {4340#(<= main_~i~0 7)} assume true; {4340#(<= main_~i~0 7)} is VALID [2018-11-14 16:55:59,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {4340#(<= main_~i~0 7)} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,640 INFO L273 TraceCheckUtils]: 24: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,642 INFO L273 TraceCheckUtils]: 31: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,642 INFO L273 TraceCheckUtils]: 32: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 35: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 50: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,644 INFO L273 TraceCheckUtils]: 51: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 54: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 55: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 56: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 57: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,645 INFO L273 TraceCheckUtils]: 59: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 62: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 63: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 64: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,646 INFO L273 TraceCheckUtils]: 67: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 69: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 70: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 72: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {4332#false} ~i~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,648 INFO L273 TraceCheckUtils]: 75: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,648 INFO L273 TraceCheckUtils]: 76: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,648 INFO L273 TraceCheckUtils]: 77: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,648 INFO L273 TraceCheckUtils]: 78: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,648 INFO L273 TraceCheckUtils]: 79: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 80: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 81: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 82: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 83: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 84: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,649 INFO L273 TraceCheckUtils]: 85: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {4332#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 88: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 89: Hoare triple {4332#false} assume !(~i~0 < 100000); {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 90: Hoare triple {4332#false} havoc ~x~0;~x~0 := 0; {4332#false} is VALID [2018-11-14 16:55:59,650 INFO L273 TraceCheckUtils]: 91: Hoare triple {4332#false} assume true; {4332#false} is VALID [2018-11-14 16:55:59,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {4332#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4332#false} is VALID [2018-11-14 16:55:59,651 INFO L256 TraceCheckUtils]: 93: Hoare triple {4332#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {4332#false} is VALID [2018-11-14 16:55:59,651 INFO L273 TraceCheckUtils]: 94: Hoare triple {4332#false} ~cond := #in~cond; {4332#false} is VALID [2018-11-14 16:55:59,651 INFO L273 TraceCheckUtils]: 95: Hoare triple {4332#false} assume ~cond == 0; {4332#false} is VALID [2018-11-14 16:55:59,651 INFO L273 TraceCheckUtils]: 96: Hoare triple {4332#false} assume !false; {4332#false} is VALID [2018-11-14 16:55:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-14 16:55:59,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:55:59,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:55:59,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-11-14 16:55:59,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:55:59,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:55:59,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:55:59,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:55:59,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:55:59,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:55:59,738 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 11 states. [2018-11-14 16:56:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:00,225 INFO L93 Difference]: Finished difference Result 192 states and 206 transitions. [2018-11-14 16:56:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:56:00,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-11-14 16:56:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:56:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2018-11-14 16:56:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:56:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2018-11-14 16:56:00,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 150 transitions. [2018-11-14 16:56:00,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:00,418 INFO L225 Difference]: With dead ends: 192 [2018-11-14 16:56:00,418 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 16:56:00,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:56:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 16:56:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-11-14 16:56:01,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:01,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 112 states. [2018-11-14 16:56:01,104 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-14 16:56:01,104 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-14 16:56:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:01,107 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-14 16:56:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-11-14 16:56:01,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:01,108 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 112 states. [2018-11-14 16:56:01,108 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 112 states. [2018-11-14 16:56:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:01,112 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-11-14 16:56:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-11-14 16:56:01,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:01,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:01,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:01,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-14 16:56:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2018-11-14 16:56:01,117 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 97 [2018-11-14 16:56:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:01,117 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2018-11-14 16:56:01,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:56:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2018-11-14 16:56:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-14 16:56:01,119 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:01,119 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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 16:56:01,119 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:01,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1434344488, now seen corresponding path program 8 times [2018-11-14 16:56:01,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:56:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:01,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2018-11-14 16:56:01,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {5299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5299#true} is VALID [2018-11-14 16:56:01,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2018-11-14 16:56:01,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #106#return; {5299#true} is VALID [2018-11-14 16:56:01,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret2 := main(); {5299#true} is VALID [2018-11-14 16:56:01,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {5299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5301#(= main_~i~0 0)} is VALID [2018-11-14 16:56:01,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {5301#(= main_~i~0 0)} assume true; {5301#(= main_~i~0 0)} is VALID [2018-11-14 16:56:01,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {5301#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:01,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {5302#(<= main_~i~0 1)} assume true; {5302#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:01,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {5302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:01,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {5303#(<= main_~i~0 2)} assume true; {5303#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:01,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {5303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:01,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {5304#(<= main_~i~0 3)} assume true; {5304#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:01,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {5304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:01,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {5305#(<= main_~i~0 4)} assume true; {5305#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:01,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {5305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:01,904 INFO L273 TraceCheckUtils]: 16: Hoare triple {5306#(<= main_~i~0 5)} assume true; {5306#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:01,905 INFO L273 TraceCheckUtils]: 17: Hoare triple {5306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:01,906 INFO L273 TraceCheckUtils]: 18: Hoare triple {5307#(<= main_~i~0 6)} assume true; {5307#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:01,907 INFO L273 TraceCheckUtils]: 19: Hoare triple {5307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:01,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {5308#(<= main_~i~0 7)} assume true; {5308#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:01,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {5308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:01,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {5309#(<= main_~i~0 8)} assume true; {5309#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:01,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {5309#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:01,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:01,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,911 INFO L273 TraceCheckUtils]: 28: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,912 INFO L273 TraceCheckUtils]: 31: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,914 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,914 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,914 INFO L273 TraceCheckUtils]: 40: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 41: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 43: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,915 INFO L273 TraceCheckUtils]: 46: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 50: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 51: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 52: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 54: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 55: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 56: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 57: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 58: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 60: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 61: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 62: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 63: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,919 INFO L273 TraceCheckUtils]: 67: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,919 INFO L273 TraceCheckUtils]: 68: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,920 INFO L273 TraceCheckUtils]: 73: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,920 INFO L273 TraceCheckUtils]: 74: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,920 INFO L273 TraceCheckUtils]: 75: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,921 INFO L273 TraceCheckUtils]: 76: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,921 INFO L273 TraceCheckUtils]: 77: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,921 INFO L273 TraceCheckUtils]: 80: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:01,922 INFO L273 TraceCheckUtils]: 81: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:01,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,922 INFO L273 TraceCheckUtils]: 83: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,922 INFO L273 TraceCheckUtils]: 84: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,923 INFO L273 TraceCheckUtils]: 86: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,923 INFO L273 TraceCheckUtils]: 87: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,923 INFO L273 TraceCheckUtils]: 88: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,923 INFO L273 TraceCheckUtils]: 89: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,923 INFO L273 TraceCheckUtils]: 90: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,924 INFO L273 TraceCheckUtils]: 91: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,924 INFO L273 TraceCheckUtils]: 92: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,924 INFO L273 TraceCheckUtils]: 93: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,924 INFO L273 TraceCheckUtils]: 94: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,925 INFO L273 TraceCheckUtils]: 95: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,925 INFO L273 TraceCheckUtils]: 96: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,925 INFO L273 TraceCheckUtils]: 97: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:01,925 INFO L273 TraceCheckUtils]: 98: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,925 INFO L273 TraceCheckUtils]: 99: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:01,926 INFO L273 TraceCheckUtils]: 100: Hoare triple {5300#false} havoc ~x~0;~x~0 := 0; {5300#false} is VALID [2018-11-14 16:56:01,926 INFO L273 TraceCheckUtils]: 101: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:01,926 INFO L273 TraceCheckUtils]: 102: Hoare triple {5300#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5300#false} is VALID [2018-11-14 16:56:01,926 INFO L256 TraceCheckUtils]: 103: Hoare triple {5300#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {5300#false} is VALID [2018-11-14 16:56:01,926 INFO L273 TraceCheckUtils]: 104: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2018-11-14 16:56:01,927 INFO L273 TraceCheckUtils]: 105: Hoare triple {5300#false} assume ~cond == 0; {5300#false} is VALID [2018-11-14 16:56:01,927 INFO L273 TraceCheckUtils]: 106: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2018-11-14 16:56:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 16:56:01,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:01,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:01,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:56:02,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:56:02,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:02,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:02,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {5299#true} call ULTIMATE.init(); {5299#true} is VALID [2018-11-14 16:56:02,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {5299#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5299#true} is VALID [2018-11-14 16:56:02,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {5299#true} assume true; {5299#true} is VALID [2018-11-14 16:56:02,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5299#true} {5299#true} #106#return; {5299#true} is VALID [2018-11-14 16:56:02,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {5299#true} call #t~ret2 := main(); {5299#true} is VALID [2018-11-14 16:56:02,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {5299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5328#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:02,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {5328#(<= main_~i~0 0)} assume true; {5328#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:02,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {5328#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:02,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {5302#(<= main_~i~0 1)} assume true; {5302#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:02,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {5302#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:02,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {5303#(<= main_~i~0 2)} assume true; {5303#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:02,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {5303#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:02,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {5304#(<= main_~i~0 3)} assume true; {5304#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:02,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {5304#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:02,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {5305#(<= main_~i~0 4)} assume true; {5305#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:02,449 INFO L273 TraceCheckUtils]: 15: Hoare triple {5305#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:02,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {5306#(<= main_~i~0 5)} assume true; {5306#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:02,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {5306#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:02,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {5307#(<= main_~i~0 6)} assume true; {5307#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:02,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {5307#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:02,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {5308#(<= main_~i~0 7)} assume true; {5308#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:02,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {5308#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:02,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {5309#(<= main_~i~0 8)} assume true; {5309#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:02,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {5309#(<= main_~i~0 8)} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:02,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:02,456 INFO L273 TraceCheckUtils]: 25: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,457 INFO L273 TraceCheckUtils]: 27: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,458 INFO L273 TraceCheckUtils]: 32: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,459 INFO L273 TraceCheckUtils]: 35: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 37: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 39: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 41: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 54: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,462 INFO L273 TraceCheckUtils]: 55: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 56: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 58: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 60: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 61: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:02,463 INFO L273 TraceCheckUtils]: 62: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 67: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,464 INFO L273 TraceCheckUtils]: 68: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 69: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 70: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 71: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 72: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 73: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 74: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,465 INFO L273 TraceCheckUtils]: 75: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 76: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 77: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 78: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 79: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 80: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:02,466 INFO L273 TraceCheckUtils]: 81: Hoare triple {5300#false} ~i~0 := 0; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 82: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 83: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 84: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 85: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 86: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 87: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,467 INFO L273 TraceCheckUtils]: 88: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 89: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 90: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 92: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 93: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,468 INFO L273 TraceCheckUtils]: 94: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 95: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 96: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 97: Hoare triple {5300#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 98: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 99: Hoare triple {5300#false} assume !(~i~0 < 100000); {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 100: Hoare triple {5300#false} havoc ~x~0;~x~0 := 0; {5300#false} is VALID [2018-11-14 16:56:02,469 INFO L273 TraceCheckUtils]: 101: Hoare triple {5300#false} assume true; {5300#false} is VALID [2018-11-14 16:56:02,470 INFO L273 TraceCheckUtils]: 102: Hoare triple {5300#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5300#false} is VALID [2018-11-14 16:56:02,470 INFO L256 TraceCheckUtils]: 103: Hoare triple {5300#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {5300#false} is VALID [2018-11-14 16:56:02,470 INFO L273 TraceCheckUtils]: 104: Hoare triple {5300#false} ~cond := #in~cond; {5300#false} is VALID [2018-11-14 16:56:02,470 INFO L273 TraceCheckUtils]: 105: Hoare triple {5300#false} assume ~cond == 0; {5300#false} is VALID [2018-11-14 16:56:02,470 INFO L273 TraceCheckUtils]: 106: Hoare triple {5300#false} assume !false; {5300#false} is VALID [2018-11-14 16:56:02,479 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-14 16:56:02,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:02,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:56:02,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-11-14 16:56:02,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:02,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:56:02,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:56:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:56:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:56:02,554 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand 12 states. [2018-11-14 16:56:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,578 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-11-14 16:56:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:56:03,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-11-14 16:56:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:56:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2018-11-14 16:56:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:56:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2018-11-14 16:56:03,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2018-11-14 16:56:03,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:03,793 INFO L225 Difference]: With dead ends: 210 [2018-11-14 16:56:03,793 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:56:03,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:56:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:56:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-11-14 16:56:03,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:03,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 122 states. [2018-11-14 16:56:03,923 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:56:03,924 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:56:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,926 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-14 16:56:03,927 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-14 16:56:03,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:03,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:03,927 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states. [2018-11-14 16:56:03,927 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states. [2018-11-14 16:56:03,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:03,930 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-14 16:56:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-14 16:56:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:03,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:03,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:56:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-11-14 16:56:03,932 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 107 [2018-11-14 16:56:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:03,933 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-11-14 16:56:03,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:56:03,933 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-11-14 16:56:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:56:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:03,934 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 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 16:56:03,934 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:03,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:03,934 INFO L82 PathProgramCache]: Analyzing trace with hash 201515698, now seen corresponding path program 9 times [2018-11-14 16:56:03,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:03,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:03,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:03,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:04,243 INFO L256 TraceCheckUtils]: 0: Hoare triple {6360#true} call ULTIMATE.init(); {6360#true} is VALID [2018-11-14 16:56:04,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {6360#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6360#true} is VALID [2018-11-14 16:56:04,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:04,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6360#true} {6360#true} #106#return; {6360#true} is VALID [2018-11-14 16:56:04,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {6360#true} call #t~ret2 := main(); {6360#true} is VALID [2018-11-14 16:56:04,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {6360#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6362#(= main_~i~0 0)} is VALID [2018-11-14 16:56:04,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {6362#(= main_~i~0 0)} assume true; {6362#(= main_~i~0 0)} is VALID [2018-11-14 16:56:04,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {6362#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6363#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {6363#(<= main_~i~0 1)} assume true; {6363#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:04,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {6363#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6364#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {6364#(<= main_~i~0 2)} assume true; {6364#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:04,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {6364#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6365#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {6365#(<= main_~i~0 3)} assume true; {6365#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:04,249 INFO L273 TraceCheckUtils]: 13: Hoare triple {6365#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6366#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {6366#(<= main_~i~0 4)} assume true; {6366#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:04,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {6366#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6367#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {6367#(<= main_~i~0 5)} assume true; {6367#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:04,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {6367#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6368#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {6368#(<= main_~i~0 6)} assume true; {6368#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:04,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {6368#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6369#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6369#(<= main_~i~0 7)} assume true; {6369#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:04,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {6369#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6370#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {6370#(<= main_~i~0 8)} assume true; {6370#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:04,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {6370#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6371#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {6371#(<= main_~i~0 9)} assume true; {6371#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:04,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {6371#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:04,258 INFO L273 TraceCheckUtils]: 26: Hoare triple {6361#false} ~i~0 := 0; {6361#false} is VALID [2018-11-14 16:56:04,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,259 INFO L273 TraceCheckUtils]: 30: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,259 INFO L273 TraceCheckUtils]: 31: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,259 INFO L273 TraceCheckUtils]: 32: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 35: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 39: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 40: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 41: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,260 INFO L273 TraceCheckUtils]: 42: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 43: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 44: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 45: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {6361#false} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {6361#false} ~i~0 := 0; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 48: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,261 INFO L273 TraceCheckUtils]: 49: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 50: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 51: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 52: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 53: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 54: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,262 INFO L273 TraceCheckUtils]: 55: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 56: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 57: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 58: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 59: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 60: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,263 INFO L273 TraceCheckUtils]: 61: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,264 INFO L273 TraceCheckUtils]: 62: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,264 INFO L273 TraceCheckUtils]: 63: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,264 INFO L273 TraceCheckUtils]: 64: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,264 INFO L273 TraceCheckUtils]: 65: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,264 INFO L273 TraceCheckUtils]: 66: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 67: Hoare triple {6361#false} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 68: Hoare triple {6361#false} ~i~0 := 0; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 69: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 70: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 71: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 72: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,265 INFO L273 TraceCheckUtils]: 73: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 74: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 75: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 76: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 77: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 78: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 80: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,266 INFO L273 TraceCheckUtils]: 81: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 82: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 83: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 84: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 85: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 86: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 87: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 88: Hoare triple {6361#false} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:04,267 INFO L273 TraceCheckUtils]: 89: Hoare triple {6361#false} ~i~0 := 0; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 90: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 92: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 93: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,268 INFO L273 TraceCheckUtils]: 95: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 97: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 98: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 99: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 100: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,269 INFO L273 TraceCheckUtils]: 101: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 102: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 103: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 106: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,270 INFO L273 TraceCheckUtils]: 107: Hoare triple {6361#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L273 TraceCheckUtils]: 108: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L273 TraceCheckUtils]: 109: Hoare triple {6361#false} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L273 TraceCheckUtils]: 110: Hoare triple {6361#false} havoc ~x~0;~x~0 := 0; {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L273 TraceCheckUtils]: 111: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L273 TraceCheckUtils]: 112: Hoare triple {6361#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6361#false} is VALID [2018-11-14 16:56:04,271 INFO L256 TraceCheckUtils]: 113: Hoare triple {6361#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {6361#false} is VALID [2018-11-14 16:56:04,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {6361#false} ~cond := #in~cond; {6361#false} is VALID [2018-11-14 16:56:04,272 INFO L273 TraceCheckUtils]: 115: Hoare triple {6361#false} assume ~cond == 0; {6361#false} is VALID [2018-11-14 16:56:04,272 INFO L273 TraceCheckUtils]: 116: Hoare triple {6361#false} assume !false; {6361#false} is VALID [2018-11-14 16:56:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-11-14 16:56:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:04,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:56:09,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:56:09,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:09,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:09,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {6360#true} call ULTIMATE.init(); {6360#true} is VALID [2018-11-14 16:56:09,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {6360#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6360#true} is VALID [2018-11-14 16:56:09,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6360#true} {6360#true} #106#return; {6360#true} is VALID [2018-11-14 16:56:09,455 INFO L256 TraceCheckUtils]: 4: Hoare triple {6360#true} call #t~ret2 := main(); {6360#true} is VALID [2018-11-14 16:56:09,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {6360#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6360#true} is VALID [2018-11-14 16:56:09,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 21: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {6360#true} assume !(~i~0 < 100000); {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {6360#true} ~i~0 := 0; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 28: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 29: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 30: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 32: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 34: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 35: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 36: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,459 INFO L273 TraceCheckUtils]: 37: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,460 INFO L273 TraceCheckUtils]: 38: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,460 INFO L273 TraceCheckUtils]: 39: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,460 INFO L273 TraceCheckUtils]: 40: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,460 INFO L273 TraceCheckUtils]: 41: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,460 INFO L273 TraceCheckUtils]: 42: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 43: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 46: Hoare triple {6360#true} assume !(~i~0 < 100000); {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {6360#true} ~i~0 := 0; {6360#true} is VALID [2018-11-14 16:56:09,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 50: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 51: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,462 INFO L273 TraceCheckUtils]: 54: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 56: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 58: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 59: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,463 INFO L273 TraceCheckUtils]: 60: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,464 INFO L273 TraceCheckUtils]: 61: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,464 INFO L273 TraceCheckUtils]: 62: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,464 INFO L273 TraceCheckUtils]: 63: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,478 INFO L273 TraceCheckUtils]: 65: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6570#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:09,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {6570#(<= main_~i~0 100000)} assume true; {6570#(<= main_~i~0 100000)} is VALID [2018-11-14 16:56:09,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {6570#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 68: Hoare triple {6360#true} ~i~0 := 0; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 69: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 70: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 71: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 72: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 73: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 74: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,479 INFO L273 TraceCheckUtils]: 75: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 76: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 77: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 78: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 79: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 80: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,480 INFO L273 TraceCheckUtils]: 83: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,481 INFO L273 TraceCheckUtils]: 84: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,481 INFO L273 TraceCheckUtils]: 85: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,481 INFO L273 TraceCheckUtils]: 86: Hoare triple {6360#true} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6360#true} is VALID [2018-11-14 16:56:09,481 INFO L273 TraceCheckUtils]: 87: Hoare triple {6360#true} assume true; {6360#true} is VALID [2018-11-14 16:56:09,481 INFO L273 TraceCheckUtils]: 88: Hoare triple {6360#true} assume !(~i~0 < 100000); {6360#true} is VALID [2018-11-14 16:56:09,482 INFO L273 TraceCheckUtils]: 89: Hoare triple {6360#true} ~i~0 := 0; {6643#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:09,482 INFO L273 TraceCheckUtils]: 90: Hoare triple {6643#(<= main_~i~0 0)} assume true; {6643#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:09,485 INFO L273 TraceCheckUtils]: 91: Hoare triple {6643#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6363#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:09,485 INFO L273 TraceCheckUtils]: 92: Hoare triple {6363#(<= main_~i~0 1)} assume true; {6363#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:09,487 INFO L273 TraceCheckUtils]: 93: Hoare triple {6363#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6364#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:09,487 INFO L273 TraceCheckUtils]: 94: Hoare triple {6364#(<= main_~i~0 2)} assume true; {6364#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:09,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {6364#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6365#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:09,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {6365#(<= main_~i~0 3)} assume true; {6365#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:09,491 INFO L273 TraceCheckUtils]: 97: Hoare triple {6365#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6366#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:09,494 INFO L273 TraceCheckUtils]: 98: Hoare triple {6366#(<= main_~i~0 4)} assume true; {6366#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:09,494 INFO L273 TraceCheckUtils]: 99: Hoare triple {6366#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6367#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:09,495 INFO L273 TraceCheckUtils]: 100: Hoare triple {6367#(<= main_~i~0 5)} assume true; {6367#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:09,495 INFO L273 TraceCheckUtils]: 101: Hoare triple {6367#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6368#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:09,496 INFO L273 TraceCheckUtils]: 102: Hoare triple {6368#(<= main_~i~0 6)} assume true; {6368#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:09,496 INFO L273 TraceCheckUtils]: 103: Hoare triple {6368#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6369#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:09,496 INFO L273 TraceCheckUtils]: 104: Hoare triple {6369#(<= main_~i~0 7)} assume true; {6369#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:09,497 INFO L273 TraceCheckUtils]: 105: Hoare triple {6369#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6370#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:09,497 INFO L273 TraceCheckUtils]: 106: Hoare triple {6370#(<= main_~i~0 8)} assume true; {6370#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:09,498 INFO L273 TraceCheckUtils]: 107: Hoare triple {6370#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6371#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:09,499 INFO L273 TraceCheckUtils]: 108: Hoare triple {6371#(<= main_~i~0 9)} assume true; {6371#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:09,499 INFO L273 TraceCheckUtils]: 109: Hoare triple {6371#(<= main_~i~0 9)} assume !(~i~0 < 100000); {6361#false} is VALID [2018-11-14 16:56:09,500 INFO L273 TraceCheckUtils]: 110: Hoare triple {6361#false} havoc ~x~0;~x~0 := 0; {6361#false} is VALID [2018-11-14 16:56:09,500 INFO L273 TraceCheckUtils]: 111: Hoare triple {6361#false} assume true; {6361#false} is VALID [2018-11-14 16:56:09,500 INFO L273 TraceCheckUtils]: 112: Hoare triple {6361#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6361#false} is VALID [2018-11-14 16:56:09,500 INFO L256 TraceCheckUtils]: 113: Hoare triple {6361#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {6361#false} is VALID [2018-11-14 16:56:09,501 INFO L273 TraceCheckUtils]: 114: Hoare triple {6361#false} ~cond := #in~cond; {6361#false} is VALID [2018-11-14 16:56:09,501 INFO L273 TraceCheckUtils]: 115: Hoare triple {6361#false} assume ~cond == 0; {6361#false} is VALID [2018-11-14 16:56:09,501 INFO L273 TraceCheckUtils]: 116: Hoare triple {6361#false} assume !false; {6361#false} is VALID [2018-11-14 16:56:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 18 proven. 90 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-11-14 16:56:09,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:09,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 14 [2018-11-14 16:56:09,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 16:56:09,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:09,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:56:09,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:09,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:56:09,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:56:09,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:09,607 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 14 states. [2018-11-14 16:56:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:10,174 INFO L93 Difference]: Finished difference Result 228 states and 242 transitions. [2018-11-14 16:56:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:56:10,174 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-11-14 16:56:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2018-11-14 16:56:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2018-11-14 16:56:10,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 170 transitions. [2018-11-14 16:56:10,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:10,401 INFO L225 Difference]: With dead ends: 228 [2018-11-14 16:56:10,401 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 16:56:10,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 16:56:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-14 16:56:10,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:10,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 132 states. [2018-11-14 16:56:10,457 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-14 16:56:10,457 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-14 16:56:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:10,461 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-14 16:56:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-11-14 16:56:10,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:10,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:10,462 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-14 16:56:10,462 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-14 16:56:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:10,465 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2018-11-14 16:56:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-11-14 16:56:10,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:10,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:10,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:10,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-14 16:56:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2018-11-14 16:56:10,469 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 117 [2018-11-14 16:56:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:10,469 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2018-11-14 16:56:10,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:56:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2018-11-14 16:56:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-14 16:56:10,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:10,471 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 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 16:56:10,471 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:10,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1019504372, now seen corresponding path program 10 times [2018-11-14 16:56:10,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:10,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:10,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:10,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:11,093 INFO L256 TraceCheckUtils]: 0: Hoare triple {7515#true} call ULTIMATE.init(); {7515#true} is VALID [2018-11-14 16:56:11,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {7515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7515#true} is VALID [2018-11-14 16:56:11,093 INFO L273 TraceCheckUtils]: 2: Hoare triple {7515#true} assume true; {7515#true} is VALID [2018-11-14 16:56:11,093 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7515#true} {7515#true} #106#return; {7515#true} is VALID [2018-11-14 16:56:11,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {7515#true} call #t~ret2 := main(); {7515#true} is VALID [2018-11-14 16:56:11,094 INFO L273 TraceCheckUtils]: 5: Hoare triple {7515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7517#(= main_~i~0 0)} is VALID [2018-11-14 16:56:11,094 INFO L273 TraceCheckUtils]: 6: Hoare triple {7517#(= main_~i~0 0)} assume true; {7517#(= main_~i~0 0)} is VALID [2018-11-14 16:56:11,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {7517#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7518#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {7518#(<= main_~i~0 1)} assume true; {7518#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {7518#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7519#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {7519#(<= main_~i~0 2)} assume true; {7519#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {7519#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7520#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {7520#(<= main_~i~0 3)} assume true; {7520#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {7520#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7521#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {7521#(<= main_~i~0 4)} assume true; {7521#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {7521#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7522#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {7522#(<= main_~i~0 5)} assume true; {7522#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,103 INFO L273 TraceCheckUtils]: 17: Hoare triple {7522#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7523#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,104 INFO L273 TraceCheckUtils]: 18: Hoare triple {7523#(<= main_~i~0 6)} assume true; {7523#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,105 INFO L273 TraceCheckUtils]: 19: Hoare triple {7523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7524#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:11,105 INFO L273 TraceCheckUtils]: 20: Hoare triple {7524#(<= main_~i~0 7)} assume true; {7524#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:11,106 INFO L273 TraceCheckUtils]: 21: Hoare triple {7524#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7525#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:11,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {7525#(<= main_~i~0 8)} assume true; {7525#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:11,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {7525#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7526#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:11,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {7526#(<= main_~i~0 9)} assume true; {7526#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:11,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {7526#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7527#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:11,110 INFO L273 TraceCheckUtils]: 26: Hoare triple {7527#(<= main_~i~0 10)} assume true; {7527#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:11,110 INFO L273 TraceCheckUtils]: 27: Hoare triple {7527#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,111 INFO L273 TraceCheckUtils]: 28: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,111 INFO L273 TraceCheckUtils]: 29: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,111 INFO L273 TraceCheckUtils]: 31: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,111 INFO L273 TraceCheckUtils]: 32: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,112 INFO L273 TraceCheckUtils]: 33: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,112 INFO L273 TraceCheckUtils]: 34: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,112 INFO L273 TraceCheckUtils]: 35: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,112 INFO L273 TraceCheckUtils]: 36: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,113 INFO L273 TraceCheckUtils]: 38: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,113 INFO L273 TraceCheckUtils]: 41: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,114 INFO L273 TraceCheckUtils]: 43: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,115 INFO L273 TraceCheckUtils]: 48: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,115 INFO L273 TraceCheckUtils]: 49: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,115 INFO L273 TraceCheckUtils]: 51: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,115 INFO L273 TraceCheckUtils]: 52: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 53: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 54: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 55: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 56: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 57: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 58: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 59: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 63: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 64: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 65: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 66: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 67: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 68: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,117 INFO L273 TraceCheckUtils]: 69: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 70: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 71: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 72: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 73: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 74: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 75: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 76: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 77: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,118 INFO L273 TraceCheckUtils]: 78: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 79: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 80: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 81: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 82: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 83: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 84: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 85: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,119 INFO L273 TraceCheckUtils]: 86: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 87: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 88: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 89: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 90: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 91: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 92: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 93: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 94: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,120 INFO L273 TraceCheckUtils]: 95: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 96: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 97: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 98: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 99: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 100: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 101: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,121 INFO L273 TraceCheckUtils]: 102: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 103: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 104: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 105: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 106: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 107: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 108: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 109: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,122 INFO L273 TraceCheckUtils]: 110: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 111: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 112: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 113: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 114: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 115: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 116: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 117: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,123 INFO L273 TraceCheckUtils]: 118: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 119: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 120: Hoare triple {7516#false} havoc ~x~0;~x~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 121: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 122: Hoare triple {7516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L256 TraceCheckUtils]: 123: Hoare triple {7516#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 124: Hoare triple {7516#false} ~cond := #in~cond; {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 125: Hoare triple {7516#false} assume ~cond == 0; {7516#false} is VALID [2018-11-14 16:56:11,124 INFO L273 TraceCheckUtils]: 126: Hoare triple {7516#false} assume !false; {7516#false} is VALID [2018-11-14 16:56:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-14 16:56:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:11,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:11,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:56:11,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:56:11,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:56:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:11,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:56:11,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {7515#true} call ULTIMATE.init(); {7515#true} is VALID [2018-11-14 16:56:11,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {7515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7515#true} is VALID [2018-11-14 16:56:11,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {7515#true} assume true; {7515#true} is VALID [2018-11-14 16:56:11,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7515#true} {7515#true} #106#return; {7515#true} is VALID [2018-11-14 16:56:11,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {7515#true} call #t~ret2 := main(); {7515#true} is VALID [2018-11-14 16:56:11,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {7515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7546#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:11,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {7546#(<= main_~i~0 0)} assume true; {7546#(<= main_~i~0 0)} is VALID [2018-11-14 16:56:11,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {7546#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7518#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {7518#(<= main_~i~0 1)} assume true; {7518#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:11,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {7518#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7519#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {7519#(<= main_~i~0 2)} assume true; {7519#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:11,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {7519#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7520#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,629 INFO L273 TraceCheckUtils]: 12: Hoare triple {7520#(<= main_~i~0 3)} assume true; {7520#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:11,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {7520#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7521#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {7521#(<= main_~i~0 4)} assume true; {7521#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:11,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {7521#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7522#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {7522#(<= main_~i~0 5)} assume true; {7522#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:11,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {7522#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7523#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {7523#(<= main_~i~0 6)} assume true; {7523#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:11,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {7523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7524#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:11,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {7524#(<= main_~i~0 7)} assume true; {7524#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:11,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {7524#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7525#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:11,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {7525#(<= main_~i~0 8)} assume true; {7525#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:11,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {7525#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7526#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:11,638 INFO L273 TraceCheckUtils]: 24: Hoare triple {7526#(<= main_~i~0 9)} assume true; {7526#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:11,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {7526#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7527#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:11,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {7527#(<= main_~i~0 10)} assume true; {7527#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:11,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {7527#(<= main_~i~0 10)} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,641 INFO L273 TraceCheckUtils]: 29: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,641 INFO L273 TraceCheckUtils]: 30: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,641 INFO L273 TraceCheckUtils]: 31: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 47: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 48: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,644 INFO L273 TraceCheckUtils]: 49: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 54: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 55: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 56: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 57: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,645 INFO L273 TraceCheckUtils]: 58: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 59: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 60: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 61: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 62: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 63: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 64: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 65: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,646 INFO L273 TraceCheckUtils]: 66: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 67: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 68: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 69: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 70: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 71: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 72: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 73: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,647 INFO L273 TraceCheckUtils]: 75: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 76: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 77: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 78: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 79: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 80: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 81: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 82: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 84: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 85: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 86: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 87: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 88: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 89: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 90: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 91: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,649 INFO L273 TraceCheckUtils]: 92: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 93: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 94: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 95: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 96: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {7516#false} ~i~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 99: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,650 INFO L273 TraceCheckUtils]: 100: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,651 INFO L273 TraceCheckUtils]: 101: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 102: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 103: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 104: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 105: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 106: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 107: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 108: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,652 INFO L273 TraceCheckUtils]: 109: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 110: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 111: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 112: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 113: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 114: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 115: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 116: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,653 INFO L273 TraceCheckUtils]: 117: Hoare triple {7516#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 118: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 119: Hoare triple {7516#false} assume !(~i~0 < 100000); {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 120: Hoare triple {7516#false} havoc ~x~0;~x~0 := 0; {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 121: Hoare triple {7516#false} assume true; {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 122: Hoare triple {7516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L256 TraceCheckUtils]: 123: Hoare triple {7516#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 124: Hoare triple {7516#false} ~cond := #in~cond; {7516#false} is VALID [2018-11-14 16:56:11,654 INFO L273 TraceCheckUtils]: 125: Hoare triple {7516#false} assume ~cond == 0; {7516#false} is VALID [2018-11-14 16:56:11,655 INFO L273 TraceCheckUtils]: 126: Hoare triple {7516#false} assume !false; {7516#false} is VALID [2018-11-14 16:56:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-11-14 16:56:11,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:56:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 16:56:11,684 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-11-14 16:56:11,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:56:11,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:56:11,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:11,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:56:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:56:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:11,733 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 14 states. [2018-11-14 16:56:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:12,973 INFO L93 Difference]: Finished difference Result 246 states and 260 transitions. [2018-11-14 16:56:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:56:12,973 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 127 [2018-11-14 16:56:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:56:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2018-11-14 16:56:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:56:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 180 transitions. [2018-11-14 16:56:12,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 180 transitions. [2018-11-14 16:56:13,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:56:13,727 INFO L225 Difference]: With dead ends: 246 [2018-11-14 16:56:13,727 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 16:56:13,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:56:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 16:56:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-14 16:56:13,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:56:13,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 142 states. [2018-11-14 16:56:13,907 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-14 16:56:13,907 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-14 16:56:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:13,910 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-11-14 16:56:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-11-14 16:56:13,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:13,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:13,911 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 142 states. [2018-11-14 16:56:13,911 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 142 states. [2018-11-14 16:56:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:56:13,914 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-11-14 16:56:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-11-14 16:56:13,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:56:13,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:56:13,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:56:13,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:56:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-14 16:56:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 147 transitions. [2018-11-14 16:56:13,918 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 147 transitions. Word has length 127 [2018-11-14 16:56:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:56:13,919 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 147 transitions. [2018-11-14 16:56:13,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:56:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 147 transitions. [2018-11-14 16:56:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-14 16:56:13,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:56:13,921 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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 16:56:13,921 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:56:13,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:56:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2064115430, now seen corresponding path program 11 times [2018-11-14 16:56:13,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:56:13,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:56:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:13,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:56:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:56:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:56:14,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {8762#true} call ULTIMATE.init(); {8762#true} is VALID [2018-11-14 16:56:14,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {8762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8762#true} is VALID [2018-11-14 16:56:14,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:56:14,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8762#true} {8762#true} #106#return; {8762#true} is VALID [2018-11-14 16:56:14,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {8762#true} call #t~ret2 := main(); {8762#true} is VALID [2018-11-14 16:56:14,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {8762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8764#(= main_~i~0 0)} is VALID [2018-11-14 16:56:14,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {8764#(= main_~i~0 0)} assume true; {8764#(= main_~i~0 0)} is VALID [2018-11-14 16:56:14,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {8764#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8765#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {8765#(<= main_~i~0 1)} assume true; {8765#(<= main_~i~0 1)} is VALID [2018-11-14 16:56:14,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {8765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8766#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {8766#(<= main_~i~0 2)} assume true; {8766#(<= main_~i~0 2)} is VALID [2018-11-14 16:56:14,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {8766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8767#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,635 INFO L273 TraceCheckUtils]: 12: Hoare triple {8767#(<= main_~i~0 3)} assume true; {8767#(<= main_~i~0 3)} is VALID [2018-11-14 16:56:14,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {8767#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8768#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,636 INFO L273 TraceCheckUtils]: 14: Hoare triple {8768#(<= main_~i~0 4)} assume true; {8768#(<= main_~i~0 4)} is VALID [2018-11-14 16:56:14,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {8768#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8769#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,638 INFO L273 TraceCheckUtils]: 16: Hoare triple {8769#(<= main_~i~0 5)} assume true; {8769#(<= main_~i~0 5)} is VALID [2018-11-14 16:56:14,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {8769#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8770#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,639 INFO L273 TraceCheckUtils]: 18: Hoare triple {8770#(<= main_~i~0 6)} assume true; {8770#(<= main_~i~0 6)} is VALID [2018-11-14 16:56:14,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {8770#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8771#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {8771#(<= main_~i~0 7)} assume true; {8771#(<= main_~i~0 7)} is VALID [2018-11-14 16:56:14,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {8771#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8772#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {8772#(<= main_~i~0 8)} assume true; {8772#(<= main_~i~0 8)} is VALID [2018-11-14 16:56:14,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {8772#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8773#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {8773#(<= main_~i~0 9)} assume true; {8773#(<= main_~i~0 9)} is VALID [2018-11-14 16:56:14,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {8773#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8774#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,657 INFO L273 TraceCheckUtils]: 26: Hoare triple {8774#(<= main_~i~0 10)} assume true; {8774#(<= main_~i~0 10)} is VALID [2018-11-14 16:56:14,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {8774#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8775#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {8775#(<= main_~i~0 11)} assume true; {8775#(<= main_~i~0 11)} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 29: Hoare triple {8775#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 30: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 31: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 32: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,659 INFO L273 TraceCheckUtils]: 33: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 34: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 35: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 39: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 40: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 41: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,660 INFO L273 TraceCheckUtils]: 42: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 43: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 44: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 45: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 51: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 52: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 54: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 55: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 56: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 57: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 58: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,662 INFO L273 TraceCheckUtils]: 59: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 60: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 61: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 62: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 63: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 66: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 67: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,663 INFO L273 TraceCheckUtils]: 68: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 69: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 70: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 71: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 72: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 74: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 78: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 79: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 80: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 81: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 82: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 83: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 84: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,665 INFO L273 TraceCheckUtils]: 85: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 86: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 87: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 88: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 89: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 90: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 91: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 92: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,666 INFO L273 TraceCheckUtils]: 93: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 94: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 95: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 96: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 97: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 98: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 99: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 100: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 101: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,667 INFO L273 TraceCheckUtils]: 102: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 103: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 104: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 105: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 106: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 107: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 108: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 109: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 110: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,668 INFO L273 TraceCheckUtils]: 111: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 112: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 113: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 114: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 115: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 116: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 117: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 118: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,669 INFO L273 TraceCheckUtils]: 119: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 120: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 121: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 122: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 123: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 124: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 125: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 126: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 127: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:56:14,670 INFO L273 TraceCheckUtils]: 128: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 129: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 130: Hoare triple {8763#false} havoc ~x~0;~x~0 := 0; {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 131: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 132: Hoare triple {8763#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L256 TraceCheckUtils]: 133: Hoare triple {8763#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 134: Hoare triple {8763#false} ~cond := #in~cond; {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 135: Hoare triple {8763#false} assume ~cond == 0; {8763#false} is VALID [2018-11-14 16:56:14,671 INFO L273 TraceCheckUtils]: 136: Hoare triple {8763#false} assume !false; {8763#false} is VALID [2018-11-14 16:56:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-14 16:56:14,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:56:14,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:56:14,688 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:57:19,818 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 16:57:19,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:57:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:57:19,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:57:20,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {8762#true} call ULTIMATE.init(); {8762#true} is VALID [2018-11-14 16:57:20,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {8762#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8762#true} is VALID [2018-11-14 16:57:20,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8762#true} {8762#true} #106#return; {8762#true} is VALID [2018-11-14 16:57:20,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {8762#true} call #t~ret2 := main(); {8762#true} is VALID [2018-11-14 16:57:20,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {8762#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8762#true} is VALID [2018-11-14 16:57:20,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,117 INFO L273 TraceCheckUtils]: 20: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 21: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 22: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 23: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 24: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {8762#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8762#true} is VALID [2018-11-14 16:57:20,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {8762#true} assume true; {8762#true} is VALID [2018-11-14 16:57:20,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {8762#true} assume !(~i~0 < 100000); {8762#true} is VALID [2018-11-14 16:57:20,119 INFO L273 TraceCheckUtils]: 30: Hoare triple {8762#true} ~i~0 := 0; {8869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:20,120 INFO L273 TraceCheckUtils]: 31: Hoare triple {8869#(<= main_~i~0 0)} assume true; {8869#(<= main_~i~0 0)} is VALID [2018-11-14 16:57:20,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {8869#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8765#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {8765#(<= main_~i~0 1)} assume true; {8765#(<= main_~i~0 1)} is VALID [2018-11-14 16:57:20,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {8765#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8766#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {8766#(<= main_~i~0 2)} assume true; {8766#(<= main_~i~0 2)} is VALID [2018-11-14 16:57:20,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {8766#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8767#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,123 INFO L273 TraceCheckUtils]: 37: Hoare triple {8767#(<= main_~i~0 3)} assume true; {8767#(<= main_~i~0 3)} is VALID [2018-11-14 16:57:20,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {8767#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8768#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {8768#(<= main_~i~0 4)} assume true; {8768#(<= main_~i~0 4)} is VALID [2018-11-14 16:57:20,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {8768#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8769#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {8769#(<= main_~i~0 5)} assume true; {8769#(<= main_~i~0 5)} is VALID [2018-11-14 16:57:20,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {8769#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8770#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {8770#(<= main_~i~0 6)} assume true; {8770#(<= main_~i~0 6)} is VALID [2018-11-14 16:57:20,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {8770#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8771#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,130 INFO L273 TraceCheckUtils]: 45: Hoare triple {8771#(<= main_~i~0 7)} assume true; {8771#(<= main_~i~0 7)} is VALID [2018-11-14 16:57:20,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {8771#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8772#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {8772#(<= main_~i~0 8)} assume true; {8772#(<= main_~i~0 8)} is VALID [2018-11-14 16:57:20,132 INFO L273 TraceCheckUtils]: 48: Hoare triple {8772#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8773#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,133 INFO L273 TraceCheckUtils]: 49: Hoare triple {8773#(<= main_~i~0 9)} assume true; {8773#(<= main_~i~0 9)} is VALID [2018-11-14 16:57:20,134 INFO L273 TraceCheckUtils]: 50: Hoare triple {8773#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8774#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,134 INFO L273 TraceCheckUtils]: 51: Hoare triple {8774#(<= main_~i~0 10)} assume true; {8774#(<= main_~i~0 10)} is VALID [2018-11-14 16:57:20,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {8774#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(43, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8775#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:20,136 INFO L273 TraceCheckUtils]: 53: Hoare triple {8775#(<= main_~i~0 11)} assume true; {8775#(<= main_~i~0 11)} is VALID [2018-11-14 16:57:20,137 INFO L273 TraceCheckUtils]: 54: Hoare triple {8775#(<= main_~i~0 11)} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:57:20,137 INFO L273 TraceCheckUtils]: 55: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:57:20,137 INFO L273 TraceCheckUtils]: 56: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,138 INFO L273 TraceCheckUtils]: 57: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,138 INFO L273 TraceCheckUtils]: 58: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,138 INFO L273 TraceCheckUtils]: 61: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,139 INFO L273 TraceCheckUtils]: 62: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,139 INFO L273 TraceCheckUtils]: 63: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,139 INFO L273 TraceCheckUtils]: 64: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,139 INFO L273 TraceCheckUtils]: 65: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,140 INFO L273 TraceCheckUtils]: 66: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,140 INFO L273 TraceCheckUtils]: 67: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,140 INFO L273 TraceCheckUtils]: 69: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 70: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 71: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 72: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 74: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,141 INFO L273 TraceCheckUtils]: 75: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 76: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 77: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(44, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 78: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 79: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 80: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 81: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,142 INFO L273 TraceCheckUtils]: 82: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 83: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 84: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 85: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 86: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 87: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,143 INFO L273 TraceCheckUtils]: 88: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 89: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 90: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 91: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 92: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 93: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 94: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,144 INFO L273 TraceCheckUtils]: 95: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 96: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 97: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 98: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 99: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 100: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,145 INFO L273 TraceCheckUtils]: 101: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 102: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(45, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 103: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 104: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 105: Hoare triple {8763#false} ~i~0 := 0; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 106: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 107: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,146 INFO L273 TraceCheckUtils]: 108: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 109: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 110: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 111: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 112: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 113: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,147 INFO L273 TraceCheckUtils]: 114: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 115: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 116: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 117: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 118: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 119: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 120: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,148 INFO L273 TraceCheckUtils]: 121: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 122: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 123: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 124: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 125: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 126: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 127: Hoare triple {8763#false} assume !!(~i~0 < 100000);call write~int(46, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8763#false} is VALID [2018-11-14 16:57:20,149 INFO L273 TraceCheckUtils]: 128: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L273 TraceCheckUtils]: 129: Hoare triple {8763#false} assume !(~i~0 < 100000); {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L273 TraceCheckUtils]: 130: Hoare triple {8763#false} havoc ~x~0;~x~0 := 0; {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L273 TraceCheckUtils]: 131: Hoare triple {8763#false} assume true; {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L273 TraceCheckUtils]: 132: Hoare triple {8763#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L256 TraceCheckUtils]: 133: Hoare triple {8763#false} call __VERIFIER_assert((if #t~mem1 == 46 then 1 else 0)); {8763#false} is VALID [2018-11-14 16:57:20,150 INFO L273 TraceCheckUtils]: 134: Hoare triple {8763#false} ~cond := #in~cond; {8763#false} is VALID [2018-11-14 16:57:20,151 INFO L273 TraceCheckUtils]: 135: Hoare triple {8763#false} assume ~cond == 0; {8763#false} is VALID [2018-11-14 16:57:20,151 INFO L273 TraceCheckUtils]: 136: Hoare triple {8763#false} assume !false; {8763#false} is VALID [2018-11-14 16:57:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-11-14 16:57:20,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:57:20,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:57:20,199 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-11-14 16:57:20,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:57:20,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:57:20,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:57:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:57:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:57:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:57:20,311 INFO L87 Difference]: Start difference. First operand 142 states and 147 transitions. Second operand 15 states.