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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:35,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:35,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:35,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:35,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:35,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:35,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:35,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:35,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:35,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:35,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:35,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:35,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:35,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:35,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:35,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:35,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:35,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:35,155 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:35,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:35,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:35,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:35,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:35,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:35,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:35,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:35,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:35,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:35,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:35,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:35,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:35,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:35,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:35,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:35,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:35,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:35,179 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-23 13:12:35,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:35,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:35,203 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:35,203 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:35,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:35,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:35,204 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:35,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:35,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:35,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:35,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:35,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:35,207 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:35,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:35,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:35,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:35,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:35,208 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:35,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:35,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:35,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:35,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:35,209 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:35,209 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:35,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:35,209 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:35,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:35,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:35,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:35,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:35,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:35,274 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-23 13:12:35,334 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae6b9a7c/bee3c7bf389543d59b9d0f4d14abd4d3/FLAG67a6a24d9 [2018-11-23 13:12:35,762 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:35,763 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-23 13:12:35,772 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae6b9a7c/bee3c7bf389543d59b9d0f4d14abd4d3/FLAG67a6a24d9 [2018-11-23 13:12:36,115 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae6b9a7c/bee3c7bf389543d59b9d0f4d14abd4d3 [2018-11-23 13:12:36,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:36,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:36,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:36,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:36,130 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:36,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274907e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36, skipping insertion in model container [2018-11-23 13:12:36,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:36,164 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:36,369 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:36,381 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:36,405 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:36,425 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:36,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36 WrapperNode [2018-11-23 13:12:36,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:36,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:36,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:36,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:36,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:36,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:36,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:36,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:36,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (1/1) ... [2018-11-23 13:12:36,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:36,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:36,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:36,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:36,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (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-23 13:12:36,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:12:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:12:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:12:36,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:36,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:36,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:37,101 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:37,102 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:12:37,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:37 BoogieIcfgContainer [2018-11-23 13:12:37,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:37,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:37,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:37,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:37,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:36" (1/3) ... [2018-11-23 13:12:37,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5096eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:37, skipping insertion in model container [2018-11-23 13:12:37,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:36" (2/3) ... [2018-11-23 13:12:37,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5096eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:37, skipping insertion in model container [2018-11-23 13:12:37,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:37" (3/3) ... [2018-11-23 13:12:37,110 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-11-23 13:12:37,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:37,129 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:37,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:37,182 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:37,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:37,183 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:37,183 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:37,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:37,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:37,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:37,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:37,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 13:12:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:37,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:37,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:37,215 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:37,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1448943433, now seen corresponding path program 1 times [2018-11-23 13:12:37,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:37,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:37,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:37,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:37,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:37,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 13:12:37,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 13:12:37,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 13:12:37,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2018-11-23 13:12:37,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2018-11-23 13:12:37,399 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2018-11-23 13:12:37,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {28#true} is VALID [2018-11-23 13:12:37,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 13:12:37,401 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} ~i~1 := 0; {29#false} is VALID [2018-11-23 13:12:37,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29#false} is VALID [2018-11-23 13:12:37,402 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29#false} is VALID [2018-11-23 13:12:37,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 13:12:37,402 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2018-11-23 13:12:37,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 13:12:37,406 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-23 13:12:37,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:37,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:37,412 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:12:37,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:37,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:37,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:37,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:37,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:37,534 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 13:12:37,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:37,725 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 13:12:37,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:37,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:12:37,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:12:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 13:12:37,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 13:12:38,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:38,294 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:12:38,295 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:12:38,298 INFO L631 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-23 13:12:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:12:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:12:38,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:38,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:38,334 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:38,335 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:38,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:38,338 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:12:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:12:38,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:38,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:38,340 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:38,340 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:12:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:38,343 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:12:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:12:38,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:38,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:38,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:38,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:12:38,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 13:12:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:38,349 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:12:38,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:12:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:38,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:38,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:38,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:38,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1815969073, now seen corresponding path program 1 times [2018-11-23 13:12:38,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:38,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 13:12:38,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {152#true} is VALID [2018-11-23 13:12:38,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 13:12:38,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #53#return; {152#true} is VALID [2018-11-23 13:12:38,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret6 := main(); {152#true} is VALID [2018-11-23 13:12:38,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {152#true} is VALID [2018-11-23 13:12:38,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {152#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {154#(= main_~i~0 0)} is VALID [2018-11-23 13:12:38,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {155#(<= main_~n~0 0)} is VALID [2018-11-23 13:12:38,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {155#(<= main_~n~0 0)} ~i~1 := 0; {156#(and (<= main_~n~0 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:38,632 INFO L273 TraceCheckUtils]: 9: Hoare triple {156#(and (<= main_~n~0 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {153#false} is VALID [2018-11-23 13:12:38,633 INFO L256 TraceCheckUtils]: 10: Hoare triple {153#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {153#false} is VALID [2018-11-23 13:12:38,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2018-11-23 13:12:38,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2018-11-23 13:12:38,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 13:12:38,636 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-23 13:12:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:38,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:12:38,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:38,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:38,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:38,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:38,699 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-23 13:12:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:38,962 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 13:12:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:38,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:12:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:12:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 13:12:38,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 13:12:39,334 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-23 13:12:39,337 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:12:39,338 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:12:39,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:12:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:12:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:12:39,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:39,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:39,378 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:39,379 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:12:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,381 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 13:12:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 13:12:39,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,382 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:12:39,382 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:12:39,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,385 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 13:12:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 13:12:39,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:39,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:39,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:39,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:12:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:12:39,388 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-23 13:12:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:39,389 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:12:39,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:12:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:39,390 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:39,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:39,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:39,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1419508495, now seen corresponding path program 1 times [2018-11-23 13:12:39,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:39,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,024 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2018-11-23 13:12:40,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 13:12:40,089 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 13:12:40,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 13:12:40,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #53#return; {284#true} is VALID [2018-11-23 13:12:40,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret6 := main(); {284#true} is VALID [2018-11-23 13:12:40,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {284#true} is VALID [2018-11-23 13:12:40,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {284#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {286#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:40,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {287#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:40,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {288#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) 0)))} is VALID [2018-11-23 13:12:40,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {288#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) 0)))} assume !(~i~0 < ~n~0); {288#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) 0)))} is VALID [2018-11-23 13:12:40,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {288#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) 0)))} ~i~1 := 0; {289#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:40,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {289#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset))) (= main_~x~0.offset 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {290#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:40,098 INFO L256 TraceCheckUtils]: 12: Hoare triple {290#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {291#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:40,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {291#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {292#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:40,099 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {285#false} is VALID [2018-11-23 13:12:40,100 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 13:12:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:40,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:40,103 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-23 13:12:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:40,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:12:40,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:12:40,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 13:12:40,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:12:40,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:12:40,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:40,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 13:12:40,644 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:40,645 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, main_~x~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) main_~x~0.offset))) (and (= .cse0 |main_#t~mem5|) (= .cse0 0))) [2018-11-23 13:12:40,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:12:40,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 13:12:40,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 13:12:40,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 13:12:40,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #53#return; {284#true} is VALID [2018-11-23 13:12:40,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret6 := main(); {284#true} is VALID [2018-11-23 13:12:40,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {284#true} is VALID [2018-11-23 13:12:40,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {284#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {314#(= main_~i~0 0)} is VALID [2018-11-23 13:12:40,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2018-11-23 13:12:40,756 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2018-11-23 13:12:40,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} assume !(~i~0 < ~n~0); {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2018-11-23 13:12:40,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {318#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} ~i~1 := 0; {328#(and (= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:40,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {328#(and (= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {290#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:40,763 INFO L256 TraceCheckUtils]: 12: Hoare triple {290#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {291#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:40,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {291#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {292#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:12:40,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {292#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {285#false} is VALID [2018-11-23 13:12:40,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 13:12:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:40,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-11-23 13:12:40,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 13:12:40,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:40,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:12:40,842 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-23 13:12:40,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:12:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:12:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:40,846 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 12 states. [2018-11-23 13:12:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:41,392 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 13:12:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:41,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 13:12:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:12:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:12:41,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2018-11-23 13:12:41,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:41,575 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:12:41,575 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:12:41,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:12:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:12:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-23 13:12:41,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:41,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2018-11-23 13:12:41,618 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2018-11-23 13:12:41,618 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2018-11-23 13:12:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:41,621 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 13:12:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:12:41,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:41,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:41,623 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2018-11-23 13:12:41,623 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2018-11-23 13:12:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:41,626 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 13:12:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:12:41,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:41,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:41,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:41,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:12:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 13:12:41,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-11-23 13:12:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:41,630 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 13:12:41,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:12:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 13:12:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:12:41,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:41,631 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:41,632 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:41,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 764545094, now seen corresponding path program 1 times [2018-11-23 13:12:41,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:41,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:41,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:41,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2018-11-23 13:12:41,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {490#true} is VALID [2018-11-23 13:12:41,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:41,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #53#return; {490#true} is VALID [2018-11-23 13:12:41,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret6 := main(); {490#true} is VALID [2018-11-23 13:12:41,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {490#true} is VALID [2018-11-23 13:12:41,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {492#(= main_~i~0 0)} is VALID [2018-11-23 13:12:41,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {492#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {492#(= main_~i~0 0)} is VALID [2018-11-23 13:12:41,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {492#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {493#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:41,799 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {494#(<= main_~n~0 1)} is VALID [2018-11-23 13:12:41,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#(<= main_~n~0 1)} ~i~1 := 0; {495#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2018-11-23 13:12:41,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {495#(and (<= main_~n~0 1) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {495#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2018-11-23 13:12:41,800 INFO L256 TraceCheckUtils]: 12: Hoare triple {495#(and (<= main_~n~0 1) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {490#true} is VALID [2018-11-23 13:12:41,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2018-11-23 13:12:41,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2018-11-23 13:12:41,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:41,802 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {490#true} {495#(and (<= main_~n~0 1) (= main_~i~1 0))} #57#return; {495#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2018-11-23 13:12:41,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {495#(and (<= main_~n~0 1) (= main_~i~1 0))} havoc #t~mem5; {495#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2018-11-23 13:12:41,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {495#(and (<= main_~n~0 1) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {496#(<= main_~n~0 main_~i~1)} is VALID [2018-11-23 13:12:41,804 INFO L273 TraceCheckUtils]: 19: Hoare triple {496#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {491#false} is VALID [2018-11-23 13:12:41,804 INFO L256 TraceCheckUtils]: 20: Hoare triple {491#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {491#false} is VALID [2018-11-23 13:12:41,805 INFO L273 TraceCheckUtils]: 21: Hoare triple {491#false} ~cond := #in~cond; {491#false} is VALID [2018-11-23 13:12:41,805 INFO L273 TraceCheckUtils]: 22: Hoare triple {491#false} assume 0 == ~cond; {491#false} is VALID [2018-11-23 13:12:41,805 INFO L273 TraceCheckUtils]: 23: Hoare triple {491#false} assume !false; {491#false} is VALID [2018-11-23 13:12:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:41,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:41,807 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-23 13:12:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:41,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {490#true} call ULTIMATE.init(); {490#true} is VALID [2018-11-23 13:12:41,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {490#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {490#true} is VALID [2018-11-23 13:12:41,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:41,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {490#true} {490#true} #53#return; {490#true} is VALID [2018-11-23 13:12:41,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {490#true} call #t~ret6 := main(); {490#true} is VALID [2018-11-23 13:12:41,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {490#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {490#true} is VALID [2018-11-23 13:12:41,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {490#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {518#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:42,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {518#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {518#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:42,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {518#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {493#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:42,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {493#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {494#(<= main_~n~0 1)} is VALID [2018-11-23 13:12:42,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {494#(<= main_~n~0 1)} ~i~1 := 0; {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:42,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:42,004 INFO L256 TraceCheckUtils]: 12: Hoare triple {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {490#true} is VALID [2018-11-23 13:12:42,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {490#true} ~cond := #in~cond; {490#true} is VALID [2018-11-23 13:12:42,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {490#true} assume !(0 == ~cond); {490#true} is VALID [2018-11-23 13:12:42,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {490#true} assume true; {490#true} is VALID [2018-11-23 13:12:42,006 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {490#true} {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #57#return; {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:42,007 INFO L273 TraceCheckUtils]: 17: Hoare triple {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} havoc #t~mem5; {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:42,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {531#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {556#(and (<= 1 main_~i~1) (<= main_~n~0 1))} is VALID [2018-11-23 13:12:42,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {556#(and (<= 1 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {491#false} is VALID [2018-11-23 13:12:42,009 INFO L256 TraceCheckUtils]: 20: Hoare triple {491#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {491#false} is VALID [2018-11-23 13:12:42,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {491#false} ~cond := #in~cond; {491#false} is VALID [2018-11-23 13:12:42,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {491#false} assume 0 == ~cond; {491#false} is VALID [2018-11-23 13:12:42,011 INFO L273 TraceCheckUtils]: 23: Hoare triple {491#false} assume !false; {491#false} is VALID [2018-11-23 13:12:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:42,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:42,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 13:12:42,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:12:42,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:42,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:12:42,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:42,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:12:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:12:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:12:42,093 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-11-23 13:12:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,461 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 13:12:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:42,461 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-23 13:12:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:12:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:12:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:12:42,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2018-11-23 13:12:42,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:42,525 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:12:42,526 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:12:42,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:12:42,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:12:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 13:12:42,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:42,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 13:12:42,560 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 13:12:42,560 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 13:12:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,563 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 13:12:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:12:42,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:42,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:42,565 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 13:12:42,565 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 13:12:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:42,567 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 13:12:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 13:12:42,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:42,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:42,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:42,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:12:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 13:12:42,571 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 13:12:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:42,571 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 13:12:42,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:12:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:12:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:12:42,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:42,573 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:42,573 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:42,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2113189724, now seen corresponding path program 2 times [2018-11-23 13:12:42,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:42,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:42,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:43,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {744#true} call ULTIMATE.init(); {744#true} is VALID [2018-11-23 13:12:43,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {744#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {744#true} is VALID [2018-11-23 13:12:43,043 INFO L273 TraceCheckUtils]: 2: Hoare triple {744#true} assume true; {744#true} is VALID [2018-11-23 13:12:43,043 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {744#true} {744#true} #53#return; {744#true} is VALID [2018-11-23 13:12:43,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {744#true} call #t~ret6 := main(); {744#true} is VALID [2018-11-23 13:12:43,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {744#true} is VALID [2018-11-23 13:12:43,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {744#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {746#(= main_~i~0 0)} is VALID [2018-11-23 13:12:43,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {746#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {746#(= main_~i~0 0)} is VALID [2018-11-23 13:12:43,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {746#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {747#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:12:43,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {747#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {748#(and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 1))} is VALID [2018-11-23 13:12:43,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {748#(and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {749#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1))))} is VALID [2018-11-23 13:12:43,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {749#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1))))} assume !(~i~0 < ~n~0); {749#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1))))} is VALID [2018-11-23 13:12:43,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {749#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1))))} ~i~1 := 0; {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,068 INFO L256 TraceCheckUtils]: 14: Hoare triple {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {744#true} is VALID [2018-11-23 13:12:43,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {744#true} ~cond := #in~cond; {751#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:43,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {751#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:43,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:43,081 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} #57#return; {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,082 INFO L273 TraceCheckUtils]: 19: Hoare triple {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} havoc #t~mem5; {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {750#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 1)))) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {753#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:12:43,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {753#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {754#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:43,088 INFO L256 TraceCheckUtils]: 22: Hoare triple {754#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {752#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:43,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {752#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {755#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:43,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {755#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {745#false} is VALID [2018-11-23 13:12:43,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {745#false} assume !false; {745#false} is VALID [2018-11-23 13:12:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:43,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:43,094 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-23 13:12:43,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:43,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:43,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:43,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:43,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:12:43,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:12:43,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 13:12:43,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:12:43,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:12:43,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:43,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 13:12:43,658 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:43,658 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) 4))) (and (= |main_#t~mem5| .cse0) (= 0 .cse0))) [2018-11-23 13:12:43,659 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:12:43,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {744#true} call ULTIMATE.init(); {744#true} is VALID [2018-11-23 13:12:43,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {744#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {744#true} is VALID [2018-11-23 13:12:43,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {744#true} assume true; {744#true} is VALID [2018-11-23 13:12:43,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {744#true} {744#true} #53#return; {744#true} is VALID [2018-11-23 13:12:43,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {744#true} call #t~ret6 := main(); {744#true} is VALID [2018-11-23 13:12:43,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {744#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {744#true} is VALID [2018-11-23 13:12:43,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {744#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {777#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:43,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {777#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {777#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:43,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {777#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {784#(and (= main_~i~0 1) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:43,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(and (= main_~i~0 1) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} is VALID [2018-11-23 13:12:43,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} is VALID [2018-11-23 13:12:43,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} assume !(~i~0 < ~n~0); {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} is VALID [2018-11-23 13:12:43,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {788#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} ~i~1 := 0; {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,716 INFO L273 TraceCheckUtils]: 13: Hoare triple {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,717 INFO L256 TraceCheckUtils]: 14: Hoare triple {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} is VALID [2018-11-23 13:12:43,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} ~cond := #in~cond; {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} is VALID [2018-11-23 13:12:43,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} assume !(0 == ~cond); {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} is VALID [2018-11-23 13:12:43,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} assume true; {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} is VALID [2018-11-23 13:12:43,730 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {805#(exists ((v_main_~x~0.base_BEFORE_CALL_1 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) 4)))} {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #57#return; {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2018-11-23 13:12:43,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {824#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} is VALID [2018-11-23 13:12:43,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {824#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {754#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:43,733 INFO L256 TraceCheckUtils]: 22: Hoare triple {754#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {831#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:43,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {831#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {835#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:43,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {835#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {745#false} is VALID [2018-11-23 13:12:43,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {745#false} assume !false; {745#false} is VALID [2018-11-23 13:12:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:43,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:43,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-23 13:12:43,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:12:43,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:43,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:12:43,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:43,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:12:43,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:12:43,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:12:43,888 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 20 states. [2018-11-23 13:12:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:45,026 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 13:12:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:12:45,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:12:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2018-11-23 13:12:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2018-11-23 13:12:45,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 40 transitions. [2018-11-23 13:12:45,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:45,135 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:12:45,135 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:12:45,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:12:45,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:12:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 13:12:45,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:45,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 37 states. [2018-11-23 13:12:45,213 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 37 states. [2018-11-23 13:12:45,213 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 37 states. [2018-11-23 13:12:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:45,215 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 13:12:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 13:12:45,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:45,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:45,216 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 40 states. [2018-11-23 13:12:45,216 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 40 states. [2018-11-23 13:12:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:45,219 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 13:12:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 13:12:45,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:45,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:45,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:45,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:12:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 13:12:45,224 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2018-11-23 13:12:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:45,225 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 13:12:45,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:12:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 13:12:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:12:45,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:45,226 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:45,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:45,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1564012763, now seen corresponding path program 3 times [2018-11-23 13:12:45,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:45,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:45,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:45,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:45,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 13:12:45,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 13:12:45,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #53#return; {1048#true} is VALID [2018-11-23 13:12:45,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret6 := main(); {1048#true} is VALID [2018-11-23 13:12:45,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1048#true} is VALID [2018-11-23 13:12:45,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {1048#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1050#(= main_~i~0 0)} is VALID [2018-11-23 13:12:45,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {1050#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1050#(= main_~i~0 0)} is VALID [2018-11-23 13:12:45,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {1050#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:45,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1051#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:45,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {1051#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:45,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1053#(<= main_~n~0 2)} is VALID [2018-11-23 13:12:45,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {1053#(<= main_~n~0 2)} ~i~1 := 0; {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2018-11-23 13:12:45,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2018-11-23 13:12:45,422 INFO L256 TraceCheckUtils]: 14: Hoare triple {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1048#true} is VALID [2018-11-23 13:12:45,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2018-11-23 13:12:45,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2018-11-23 13:12:45,422 INFO L273 TraceCheckUtils]: 17: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,423 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1048#true} {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} #57#return; {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2018-11-23 13:12:45,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} havoc #t~mem5; {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2018-11-23 13:12:45,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {1054#(and (<= main_~n~0 2) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1055#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:12:45,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {1055#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1055#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:12:45,426 INFO L256 TraceCheckUtils]: 22: Hoare triple {1055#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1048#true} is VALID [2018-11-23 13:12:45,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2018-11-23 13:12:45,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2018-11-23 13:12:45,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,427 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1048#true} {1055#(<= main_~n~0 (+ main_~i~1 1))} #57#return; {1055#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:12:45,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {1055#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1055#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:12:45,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {1055#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1056#(<= main_~n~0 main_~i~1)} is VALID [2018-11-23 13:12:45,432 INFO L273 TraceCheckUtils]: 29: Hoare triple {1056#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1049#false} is VALID [2018-11-23 13:12:45,432 INFO L256 TraceCheckUtils]: 30: Hoare triple {1049#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1049#false} is VALID [2018-11-23 13:12:45,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 13:12:45,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 13:12:45,433 INFO L273 TraceCheckUtils]: 33: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 13:12:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:12:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:45,435 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-23 13:12:45,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:45,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:12:45,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:45,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:45,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 13:12:45,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1048#true} is VALID [2018-11-23 13:12:45,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #53#return; {1048#true} is VALID [2018-11-23 13:12:45,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret6 := main(); {1048#true} is VALID [2018-11-23 13:12:45,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1048#true} is VALID [2018-11-23 13:12:45,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {1048#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1078#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:45,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1078#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:45,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {1078#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1051#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:45,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {1051#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1051#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:45,703 INFO L273 TraceCheckUtils]: 10: Hoare triple {1051#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1052#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:45,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {1052#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1053#(<= main_~n~0 2)} is VALID [2018-11-23 13:12:45,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {1053#(<= main_~n~0 2)} ~i~1 := 0; {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} is VALID [2018-11-23 13:12:45,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} is VALID [2018-11-23 13:12:45,705 INFO L256 TraceCheckUtils]: 14: Hoare triple {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1048#true} is VALID [2018-11-23 13:12:45,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2018-11-23 13:12:45,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2018-11-23 13:12:45,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,706 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1048#true} {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} #57#return; {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} is VALID [2018-11-23 13:12:45,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} havoc #t~mem5; {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} is VALID [2018-11-23 13:12:45,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {1097#(and (<= 0 main_~i~1) (<= main_~n~0 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:45,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:45,709 INFO L256 TraceCheckUtils]: 22: Hoare triple {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1048#true} is VALID [2018-11-23 13:12:45,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2018-11-23 13:12:45,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2018-11-23 13:12:45,710 INFO L273 TraceCheckUtils]: 25: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 13:12:45,713 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1048#true} {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #57#return; {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:45,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} havoc #t~mem5; {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:45,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {1122#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1147#(and (<= main_~n~0 2) (<= 2 main_~i~1))} is VALID [2018-11-23 13:12:45,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {1147#(and (<= main_~n~0 2) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1049#false} is VALID [2018-11-23 13:12:45,715 INFO L256 TraceCheckUtils]: 30: Hoare triple {1049#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1049#false} is VALID [2018-11-23 13:12:45,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {1049#false} ~cond := #in~cond; {1049#false} is VALID [2018-11-23 13:12:45,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {1049#false} assume 0 == ~cond; {1049#false} is VALID [2018-11-23 13:12:45,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 13:12:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:12:45,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 13:12:45,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:12:45,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:45,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:12:45,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:45,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:12:45,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:12:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:12:45,789 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-23 13:12:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:46,431 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-11-23 13:12:46,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:46,431 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:12:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:12:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-23 13:12:46,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2018-11-23 13:12:46,530 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-23 13:12:46,532 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:12:46,532 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:12:46,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:12:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 13:12:46,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:46,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 13:12:46,614 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 13:12:46,614 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 13:12:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:46,617 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 13:12:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 13:12:46,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:46,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:46,618 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 13:12:46,618 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 13:12:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:46,620 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 13:12:46,620 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 13:12:46,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:46,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:46,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:46,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:12:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 13:12:46,623 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-23 13:12:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:46,623 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 13:12:46,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:12:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 13:12:46,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:12:46,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:46,625 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:46,625 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:46,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:46,625 INFO L82 PathProgramCache]: Analyzing trace with hash 119264185, now seen corresponding path program 4 times [2018-11-23 13:12:46,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:46,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:46,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:46,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {1391#true} call ULTIMATE.init(); {1391#true} is VALID [2018-11-23 13:12:46,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {1391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1391#true} is VALID [2018-11-23 13:12:46,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {1391#true} assume true; {1391#true} is VALID [2018-11-23 13:12:46,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1391#true} {1391#true} #53#return; {1391#true} is VALID [2018-11-23 13:12:46,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {1391#true} call #t~ret6 := main(); {1391#true} is VALID [2018-11-23 13:12:46,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {1391#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1391#true} is VALID [2018-11-23 13:12:46,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {1391#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1393#(= main_~i~0 0)} is VALID [2018-11-23 13:12:46,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {1393#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1393#(= main_~i~0 0)} is VALID [2018-11-23 13:12:46,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {1393#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1394#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:12:46,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {1394#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1394#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:12:46,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {1394#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1395#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:12:46,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {1395#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1396#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))))} is VALID [2018-11-23 13:12:46,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {1396#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1397#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1)))))} is VALID [2018-11-23 13:12:46,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {1397#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1)))))} assume !(~i~0 < ~n~0); {1397#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1)))))} is VALID [2018-11-23 13:12:46,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {1397#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1)))))} ~i~1 := 0; {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:46,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:46,989 INFO L256 TraceCheckUtils]: 16: Hoare triple {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1391#true} is VALID [2018-11-23 13:12:46,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {1391#true} ~cond := #in~cond; {1399#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:12:46,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {1399#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:46,991 INFO L273 TraceCheckUtils]: 19: Hoare triple {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:46,992 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} #57#return; {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:46,994 INFO L273 TraceCheckUtils]: 21: Hoare triple {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} havoc #t~mem5; {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} is VALID [2018-11-23 13:12:46,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {1398#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 1 1))))) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:12:46,996 INFO L273 TraceCheckUtils]: 23: Hoare triple {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:12:46,996 INFO L256 TraceCheckUtils]: 24: Hoare triple {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1391#true} is VALID [2018-11-23 13:12:46,996 INFO L273 TraceCheckUtils]: 25: Hoare triple {1391#true} ~cond := #in~cond; {1391#true} is VALID [2018-11-23 13:12:46,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {1391#true} assume !(0 == ~cond); {1391#true} is VALID [2018-11-23 13:12:46,996 INFO L273 TraceCheckUtils]: 27: Hoare triple {1391#true} assume true; {1391#true} is VALID [2018-11-23 13:12:46,998 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1391#true} {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #57#return; {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:12:46,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} havoc #t~mem5; {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:12:46,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {1401#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1402#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:12:47,000 INFO L273 TraceCheckUtils]: 31: Hoare triple {1402#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1403#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:47,001 INFO L256 TraceCheckUtils]: 32: Hoare triple {1403#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:12:47,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {1400#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1404#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:12:47,002 INFO L273 TraceCheckUtils]: 34: Hoare triple {1404#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1392#false} is VALID [2018-11-23 13:12:47,002 INFO L273 TraceCheckUtils]: 35: Hoare triple {1392#false} assume !false; {1392#false} is VALID [2018-11-23 13:12:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:12:47,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:47,007 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-23 13:12:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:12:47,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:12:47,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:47,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:47,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 13:12:47,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:12:47,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:47,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:47,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:47,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 13:12:48,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 13:12:48,020 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:12:48,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:12:48,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:12:48,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:48,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:12:48,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 13:12:48,041 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:12:48,041 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, main_~i~1, v_main_~i~0_12]. (let ((.cse0 (select |#memory_int| main_~x~0.base))) (and (= |main_#t~mem5| (select .cse0 (* 4 main_~i~1))) (<= main_~i~1 v_main_~i~0_12) (<= v_main_~i~0_12 2) (<= 2 main_~i~1) (= 0 (select .cse0 (* 4 v_main_~i~0_12))))) [2018-11-23 13:12:48,041 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:12:48,144 INFO L256 TraceCheckUtils]: 0: Hoare triple {1391#true} call ULTIMATE.init(); {1391#true} is VALID [2018-11-23 13:12:48,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {1391#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1391#true} is VALID [2018-11-23 13:12:48,145 INFO L273 TraceCheckUtils]: 2: Hoare triple {1391#true} assume true; {1391#true} is VALID [2018-11-23 13:12:48,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1391#true} {1391#true} #53#return; {1391#true} is VALID [2018-11-23 13:12:48,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {1391#true} call #t~ret6 := main(); {1391#true} is VALID [2018-11-23 13:12:48,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1391#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1391#true} is VALID [2018-11-23 13:12:48,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {1391#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1426#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:48,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {1426#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1426#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:12:48,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {1426#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1433#(and (<= main_~i~0 1) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {1433#(and (<= main_~i~0 1) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1433#(and (<= main_~i~0 1) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {1433#(and (<= main_~i~0 1) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1440#(and (<= main_~i~0 2) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {1440#(and (<= main_~i~0 2) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1444#(and (<= main_~i~0 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,230 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(and (<= main_~i~0 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1448#(and (exists ((v_main_~i~0_12 Int)) (and (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0))) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {1448#(and (exists ((v_main_~i~0_12 Int)) (and (<= main_~i~0 (+ v_main_~i~0_12 1)) (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0))) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {1452#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:12:48,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {1452#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0))} ~i~1 := 0; {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} is VALID [2018-11-23 13:12:48,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} is VALID [2018-11-23 13:12:48,262 INFO L256 TraceCheckUtils]: 16: Hoare triple {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,265 INFO L273 TraceCheckUtils]: 17: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} ~cond := #in~cond; {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} assume !(0 == ~cond); {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} assume true; {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,266 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} #57#return; {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} is VALID [2018-11-23 13:12:48,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} havoc #t~mem5; {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} is VALID [2018-11-23 13:12:48,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:48,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:48,270 INFO L256 TraceCheckUtils]: 24: Hoare triple {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} ~cond := #in~cond; {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,271 INFO L273 TraceCheckUtils]: 26: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} assume !(0 == ~cond); {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,272 INFO L273 TraceCheckUtils]: 27: Hoare triple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} assume true; {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} is VALID [2018-11-23 13:12:48,273 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1463#(exists ((v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_12 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (* 4 v_main_~i~0_12)) 0) (<= v_main_~i~0_12 2)))} {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} #57#return; {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:48,274 INFO L273 TraceCheckUtils]: 29: Hoare triple {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} havoc #t~mem5; {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} is VALID [2018-11-23 13:12:48,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {1482#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1507#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 2 main_~i~1))} is VALID [2018-11-23 13:12:48,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {1507#(and (exists ((v_main_~i~0_12 Int)) (and (<= v_main_~i~0_12 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_12))) 0) (<= main_~n~0 (+ v_main_~i~0_12 1)))) (= main_~x~0.offset 0) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1403#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:12:48,278 INFO L256 TraceCheckUtils]: 32: Hoare triple {1403#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1514#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:48,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {1514#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1518#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:48,287 INFO L273 TraceCheckUtils]: 34: Hoare triple {1518#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1392#false} is VALID [2018-11-23 13:12:48,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {1392#false} assume !false; {1392#false} is VALID [2018-11-23 13:12:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:12:48,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:48,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-11-23 13:12:48,315 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-23 13:12:48,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:48,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:12:48,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:48,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:12:48,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:12:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:12:48,389 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-11-23 13:12:53,594 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 13:12:56,044 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 13:12:58,093 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 13:13:00,145 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 13:13:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:00,539 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 13:13:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:13:00,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-11-23 13:13:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 67 transitions. [2018-11-23 13:13:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:13:00,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 67 transitions. [2018-11-23 13:13:00,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 67 transitions. [2018-11-23 13:13:00,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:00,699 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:13:00,700 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:13:00,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=315, Invalid=2337, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:13:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:13:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-11-23 13:13:00,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:00,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2018-11-23 13:13:00,785 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2018-11-23 13:13:00,785 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2018-11-23 13:13:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:00,788 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 13:13:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 13:13:00,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:00,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:00,789 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2018-11-23 13:13:00,789 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2018-11-23 13:13:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:00,792 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 13:13:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 13:13:00,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:00,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:00,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:00,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:13:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 13:13:00,795 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 36 [2018-11-23 13:13:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:00,795 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 13:13:00,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:13:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 13:13:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:13:00,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:00,797 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:00,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:00,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1605303374, now seen corresponding path program 5 times [2018-11-23 13:13:00,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:00,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:00,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:00,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:00,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:01,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2018-11-23 13:13:01,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1847#true} is VALID [2018-11-23 13:13:01,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 13:13:01,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #53#return; {1847#true} is VALID [2018-11-23 13:13:01,357 INFO L256 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret6 := main(); {1847#true} is VALID [2018-11-23 13:13:01,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {1847#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1847#true} is VALID [2018-11-23 13:13:01,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1849#(= main_~i~0 0)} is VALID [2018-11-23 13:13:01,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {1849#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1849#(= main_~i~0 0)} is VALID [2018-11-23 13:13:01,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {1849#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1850#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:01,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {1850#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1850#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:01,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {1850#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1851#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:01,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {1851#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1851#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:01,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {1851#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1852#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:01,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {1852#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1853#(and (<= main_~i~0 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:01,365 INFO L273 TraceCheckUtils]: 14: Hoare triple {1853#(and (<= main_~i~0 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1)))))} is VALID [2018-11-23 13:13:01,365 INFO L273 TraceCheckUtils]: 15: Hoare triple {1854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1)))))} assume !(~i~0 < ~n~0); {1854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1)))))} is VALID [2018-11-23 13:13:01,366 INFO L273 TraceCheckUtils]: 16: Hoare triple {1854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1)))))} ~i~1 := 0; {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} is VALID [2018-11-23 13:13:01,367 INFO L273 TraceCheckUtils]: 17: Hoare triple {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} is VALID [2018-11-23 13:13:01,367 INFO L256 TraceCheckUtils]: 18: Hoare triple {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1847#true} is VALID [2018-11-23 13:13:01,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {1847#true} ~cond := #in~cond; {1856#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:13:01,369 INFO L273 TraceCheckUtils]: 20: Hoare triple {1856#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:01,369 INFO L273 TraceCheckUtils]: 21: Hoare triple {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:01,370 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} #57#return; {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} is VALID [2018-11-23 13:13:01,371 INFO L273 TraceCheckUtils]: 23: Hoare triple {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} havoc #t~mem5; {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} is VALID [2018-11-23 13:13:01,372 INFO L273 TraceCheckUtils]: 24: Hoare triple {1855#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ 2 1))))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} is VALID [2018-11-23 13:13:01,373 INFO L273 TraceCheckUtils]: 25: Hoare triple {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} is VALID [2018-11-23 13:13:01,373 INFO L256 TraceCheckUtils]: 26: Hoare triple {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1847#true} is VALID [2018-11-23 13:13:01,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {1847#true} ~cond := #in~cond; {1847#true} is VALID [2018-11-23 13:13:01,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {1847#true} assume !(0 == ~cond); {1847#true} is VALID [2018-11-23 13:13:01,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 13:13:01,375 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1847#true} {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} #57#return; {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} is VALID [2018-11-23 13:13:01,376 INFO L273 TraceCheckUtils]: 31: Hoare triple {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} havoc #t~mem5; {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} is VALID [2018-11-23 13:13:01,376 INFO L273 TraceCheckUtils]: 32: Hoare triple {1858#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ (+ main_~i~1 1) 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:01,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:01,377 INFO L256 TraceCheckUtils]: 34: Hoare triple {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1847#true} is VALID [2018-11-23 13:13:01,377 INFO L273 TraceCheckUtils]: 35: Hoare triple {1847#true} ~cond := #in~cond; {1847#true} is VALID [2018-11-23 13:13:01,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {1847#true} assume !(0 == ~cond); {1847#true} is VALID [2018-11-23 13:13:01,377 INFO L273 TraceCheckUtils]: 37: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 13:13:01,379 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1847#true} {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #57#return; {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:01,380 INFO L273 TraceCheckUtils]: 39: Hoare triple {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} havoc #t~mem5; {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:01,381 INFO L273 TraceCheckUtils]: 40: Hoare triple {1859#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:13:01,382 INFO L273 TraceCheckUtils]: 41: Hoare triple {1860#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1861#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:13:01,383 INFO L256 TraceCheckUtils]: 42: Hoare triple {1861#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:01,384 INFO L273 TraceCheckUtils]: 43: Hoare triple {1857#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1862#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:13:01,384 INFO L273 TraceCheckUtils]: 44: Hoare triple {1862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1848#false} is VALID [2018-11-23 13:13:01,384 INFO L273 TraceCheckUtils]: 45: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2018-11-23 13:13:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:13:01,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:01,389 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-23 13:13:01,398 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:01,485 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 13:13:01,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:01,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:01,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 13:13:01,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 13:13:01,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:13:01,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:01,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:01,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 13:13:02,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:13:02,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:13:02,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:13:02,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:02,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:02,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 13:13:02,617 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:13:02,617 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) 12))) (and (= .cse0 |main_#t~mem5|) (= .cse0 0))) [2018-11-23 13:13:02,617 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:13:02,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {1847#true} call ULTIMATE.init(); {1847#true} is VALID [2018-11-23 13:13:02,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {1847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1847#true} is VALID [2018-11-23 13:13:02,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {1847#true} assume true; {1847#true} is VALID [2018-11-23 13:13:02,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1847#true} {1847#true} #53#return; {1847#true} is VALID [2018-11-23 13:13:02,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {1847#true} call #t~ret6 := main(); {1847#true} is VALID [2018-11-23 13:13:02,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {1847#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1847#true} is VALID [2018-11-23 13:13:02,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {1847#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1884#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:02,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {1884#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1884#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2018-11-23 13:13:02,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {1884#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1891#(and (= main_~i~0 1) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:13:02,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {1891#(and (= main_~i~0 1) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1891#(and (= main_~i~0 1) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:13:02,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {1891#(and (= main_~i~0 1) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1898#(and (= main_~i~0 2) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:13:02,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {1898#(and (= main_~i~0 2) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1898#(and (= main_~i~0 2) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:13:02,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {1898#(and (= main_~i~0 2) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1905#(and (= main_~i~0 3) (= main_~x~0.offset 0))} is VALID [2018-11-23 13:13:02,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1905#(and (= main_~i~0 3) (= main_~x~0.offset 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} assume !(~i~0 < ~n~0); {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {1909#(and (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} ~i~1 := 0; {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,687 INFO L256 TraceCheckUtils]: 18: Hoare triple {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} ~cond := #in~cond; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,688 INFO L273 TraceCheckUtils]: 20: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume !(0 == ~cond); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,688 INFO L273 TraceCheckUtils]: 21: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume true; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,690 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #57#return; {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,690 INFO L273 TraceCheckUtils]: 23: Hoare triple {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} havoc #t~mem5; {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,691 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,692 INFO L273 TraceCheckUtils]: 25: Hoare triple {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,694 INFO L256 TraceCheckUtils]: 26: Hoare triple {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,694 INFO L273 TraceCheckUtils]: 27: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} ~cond := #in~cond; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume !(0 == ~cond); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,703 INFO L273 TraceCheckUtils]: 29: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume true; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,704 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #57#return; {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} havoc #t~mem5; {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {1945#(and (= main_~i~1 1) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,709 INFO L256 TraceCheckUtils]: 34: Hoare triple {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} ~cond := #in~cond; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume !(0 == ~cond); {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} assume true; {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} is VALID [2018-11-23 13:13:02,718 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1926#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int)) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) 12)))} {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #57#return; {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,719 INFO L273 TraceCheckUtils]: 39: Hoare triple {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} havoc #t~mem5; {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {1970#(and (= main_~i~1 2) (= main_~x~0.offset 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1995#(and (= main_~x~0.offset 0) (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} is VALID [2018-11-23 13:13:02,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {1995#(and (= main_~x~0.offset 0) (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1861#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:13:02,721 INFO L256 TraceCheckUtils]: 42: Hoare triple {1861#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2002#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:02,721 INFO L273 TraceCheckUtils]: 43: Hoare triple {2002#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2006#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:02,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {2006#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1848#false} is VALID [2018-11-23 13:13:02,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {1848#false} assume !false; {1848#false} is VALID [2018-11-23 13:13:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:13:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:02,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-11-23 13:13:02,748 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-11-23 13:13:02,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:02,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:13:02,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:02,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:13:02,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:13:02,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:13:02,837 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 28 states. [2018-11-23 13:13:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:04,967 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 13:13:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:13:04,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-11-23 13:13:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 54 transitions. [2018-11-23 13:13:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:13:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 54 transitions. [2018-11-23 13:13:04,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 54 transitions. [2018-11-23 13:13:05,046 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-23 13:13:05,049 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:13:05,049 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:13:05,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:13:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:13:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-23 13:13:05,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:05,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2018-11-23 13:13:05,289 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2018-11-23 13:13:05,290 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2018-11-23 13:13:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:05,293 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 13:13:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 13:13:05,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:05,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:05,294 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2018-11-23 13:13:05,294 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2018-11-23 13:13:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:05,296 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 13:13:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 13:13:05,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:05,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:05,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:05,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:13:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 13:13:05,299 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-23 13:13:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:05,300 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 13:13:05,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:13:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 13:13:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 13:13:05,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:05,301 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:05,302 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:05,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:05,302 INFO L82 PathProgramCache]: Analyzing trace with hash 921393797, now seen corresponding path program 6 times [2018-11-23 13:13:05,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:05,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:05,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:05,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {2320#true} call ULTIMATE.init(); {2320#true} is VALID [2018-11-23 13:13:05,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {2320#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2320#true} is VALID [2018-11-23 13:13:05,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} #53#return; {2320#true} is VALID [2018-11-23 13:13:05,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {2320#true} call #t~ret6 := main(); {2320#true} is VALID [2018-11-23 13:13:05,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {2320#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2320#true} is VALID [2018-11-23 13:13:05,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {2320#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2322#(= main_~i~0 0)} is VALID [2018-11-23 13:13:05,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {2322#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2322#(= main_~i~0 0)} is VALID [2018-11-23 13:13:05,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {2322#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2323#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:05,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {2323#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2323#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:05,592 INFO L273 TraceCheckUtils]: 10: Hoare triple {2323#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2324#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:05,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {2324#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2324#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:05,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {2324#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:05,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {2325#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:05,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {2325#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 4)} is VALID [2018-11-23 13:13:05,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {2327#(<= main_~n~0 4)} is VALID [2018-11-23 13:13:05,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {2327#(<= main_~n~0 4)} ~i~1 := 0; {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2018-11-23 13:13:05,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2018-11-23 13:13:05,597 INFO L256 TraceCheckUtils]: 18: Hoare triple {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,597 INFO L273 TraceCheckUtils]: 20: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,598 INFO L273 TraceCheckUtils]: 21: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,599 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2320#true} {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} #57#return; {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2018-11-23 13:13:05,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} havoc #t~mem5; {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2018-11-23 13:13:05,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {2328#(and (<= main_~n~0 4) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2329#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:05,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {2329#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2329#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:05,601 INFO L256 TraceCheckUtils]: 26: Hoare triple {2329#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,601 INFO L273 TraceCheckUtils]: 27: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,602 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2320#true} {2329#(<= main_~n~0 (+ main_~i~1 3))} #57#return; {2329#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:05,603 INFO L273 TraceCheckUtils]: 31: Hoare triple {2329#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {2329#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:05,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {2329#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2330#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:05,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {2330#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2330#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:05,605 INFO L256 TraceCheckUtils]: 34: Hoare triple {2330#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,605 INFO L273 TraceCheckUtils]: 35: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,605 INFO L273 TraceCheckUtils]: 36: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,605 INFO L273 TraceCheckUtils]: 37: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,606 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2320#true} {2330#(<= main_~n~0 (+ main_~i~1 2))} #57#return; {2330#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:05,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {2330#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2330#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:05,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {2330#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2331#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:05,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {2331#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2331#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:05,608 INFO L256 TraceCheckUtils]: 42: Hoare triple {2331#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,610 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2320#true} {2331#(<= main_~n~0 (+ main_~i~1 1))} #57#return; {2331#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:05,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {2331#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2331#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:05,611 INFO L273 TraceCheckUtils]: 48: Hoare triple {2331#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2332#(<= main_~n~0 main_~i~1)} is VALID [2018-11-23 13:13:05,612 INFO L273 TraceCheckUtils]: 49: Hoare triple {2332#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2321#false} is VALID [2018-11-23 13:13:05,612 INFO L256 TraceCheckUtils]: 50: Hoare triple {2321#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2321#false} is VALID [2018-11-23 13:13:05,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {2321#false} ~cond := #in~cond; {2321#false} is VALID [2018-11-23 13:13:05,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {2321#false} assume 0 == ~cond; {2321#false} is VALID [2018-11-23 13:13:05,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2018-11-23 13:13:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:13:05,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:05,615 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-23 13:13:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:05,659 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 13:13:05,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:05,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:05,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {2320#true} call ULTIMATE.init(); {2320#true} is VALID [2018-11-23 13:13:05,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {2320#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2320#true} is VALID [2018-11-23 13:13:05,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,890 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2320#true} {2320#true} #53#return; {2320#true} is VALID [2018-11-23 13:13:05,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {2320#true} call #t~ret6 := main(); {2320#true} is VALID [2018-11-23 13:13:05,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {2320#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2320#true} is VALID [2018-11-23 13:13:05,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {2320#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2354#(<= main_~i~0 0)} is VALID [2018-11-23 13:13:05,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {2354#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2354#(<= main_~i~0 0)} is VALID [2018-11-23 13:13:05,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {2354#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2323#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:05,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {2323#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2323#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:05,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {2323#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2324#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:05,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {2324#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2324#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:05,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {2324#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:05,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {2325#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:05,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {2325#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 4)} is VALID [2018-11-23 13:13:05,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {2326#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {2327#(<= main_~n~0 4)} is VALID [2018-11-23 13:13:05,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {2327#(<= main_~n~0 4)} ~i~1 := 0; {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} is VALID [2018-11-23 13:13:05,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} is VALID [2018-11-23 13:13:05,902 INFO L256 TraceCheckUtils]: 18: Hoare triple {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,903 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2320#true} {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} #57#return; {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} is VALID [2018-11-23 13:13:05,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} havoc #t~mem5; {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} is VALID [2018-11-23 13:13:05,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {2385#(and (<= main_~n~0 4) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} is VALID [2018-11-23 13:13:05,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} is VALID [2018-11-23 13:13:05,906 INFO L256 TraceCheckUtils]: 26: Hoare triple {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,908 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2320#true} {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} #57#return; {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} is VALID [2018-11-23 13:13:05,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} havoc #t~mem5; {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} is VALID [2018-11-23 13:13:05,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {2410#(and (<= main_~n~0 4) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} is VALID [2018-11-23 13:13:05,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} is VALID [2018-11-23 13:13:05,911 INFO L256 TraceCheckUtils]: 34: Hoare triple {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,911 INFO L273 TraceCheckUtils]: 35: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,911 INFO L273 TraceCheckUtils]: 36: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,912 INFO L273 TraceCheckUtils]: 37: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,916 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2320#true} {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} #57#return; {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} is VALID [2018-11-23 13:13:05,917 INFO L273 TraceCheckUtils]: 39: Hoare triple {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} havoc #t~mem5; {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} is VALID [2018-11-23 13:13:05,917 INFO L273 TraceCheckUtils]: 40: Hoare triple {2435#(and (<= main_~n~0 4) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} is VALID [2018-11-23 13:13:05,918 INFO L273 TraceCheckUtils]: 41: Hoare triple {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} is VALID [2018-11-23 13:13:05,918 INFO L256 TraceCheckUtils]: 42: Hoare triple {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#true} is VALID [2018-11-23 13:13:05,918 INFO L273 TraceCheckUtils]: 43: Hoare triple {2320#true} ~cond := #in~cond; {2320#true} is VALID [2018-11-23 13:13:05,919 INFO L273 TraceCheckUtils]: 44: Hoare triple {2320#true} assume !(0 == ~cond); {2320#true} is VALID [2018-11-23 13:13:05,919 INFO L273 TraceCheckUtils]: 45: Hoare triple {2320#true} assume true; {2320#true} is VALID [2018-11-23 13:13:05,920 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2320#true} {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} #57#return; {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} is VALID [2018-11-23 13:13:05,920 INFO L273 TraceCheckUtils]: 47: Hoare triple {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} havoc #t~mem5; {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} is VALID [2018-11-23 13:13:05,921 INFO L273 TraceCheckUtils]: 48: Hoare triple {2460#(and (<= main_~n~0 4) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2485#(and (<= main_~n~0 4) (<= 4 main_~i~1))} is VALID [2018-11-23 13:13:05,922 INFO L273 TraceCheckUtils]: 49: Hoare triple {2485#(and (<= main_~n~0 4) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2321#false} is VALID [2018-11-23 13:13:05,922 INFO L256 TraceCheckUtils]: 50: Hoare triple {2321#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2321#false} is VALID [2018-11-23 13:13:05,922 INFO L273 TraceCheckUtils]: 51: Hoare triple {2321#false} ~cond := #in~cond; {2321#false} is VALID [2018-11-23 13:13:05,922 INFO L273 TraceCheckUtils]: 52: Hoare triple {2321#false} assume 0 == ~cond; {2321#false} is VALID [2018-11-23 13:13:05,923 INFO L273 TraceCheckUtils]: 53: Hoare triple {2321#false} assume !false; {2321#false} is VALID [2018-11-23 13:13:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:13:05,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:05,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-11-23 13:13:05,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-23 13:13:05,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:05,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:13:06,027 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-23 13:13:06,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:13:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:13:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:06,028 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-11-23 13:13:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,201 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 13:13:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:13:07,201 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-11-23 13:13:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2018-11-23 13:13:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:13:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2018-11-23 13:13:07,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2018-11-23 13:13:07,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:07,296 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:13:07,297 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:13:07,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:13:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:13:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 13:13:07,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:07,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 59 states. [2018-11-23 13:13:07,424 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 59 states. [2018-11-23 13:13:07,424 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 59 states. [2018-11-23 13:13:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,427 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 13:13:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 13:13:07,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:07,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 60 states. [2018-11-23 13:13:07,427 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 60 states. [2018-11-23 13:13:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:07,430 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 13:13:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 13:13:07,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:07,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:07,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:07,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:13:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 13:13:07,442 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-11-23 13:13:07,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:07,443 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 13:13:07,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:13:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 13:13:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:13:07,444 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:07,444 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:07,447 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:07,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash 288236131, now seen corresponding path program 7 times [2018-11-23 13:13:07,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:07,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:07,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:07,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {2841#true} call ULTIMATE.init(); {2841#true} is VALID [2018-11-23 13:13:07,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {2841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2841#true} is VALID [2018-11-23 13:13:07,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {2841#true} assume true; {2841#true} is VALID [2018-11-23 13:13:07,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2841#true} {2841#true} #53#return; {2841#true} is VALID [2018-11-23 13:13:07,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {2841#true} call #t~ret6 := main(); {2841#true} is VALID [2018-11-23 13:13:07,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {2841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2841#true} is VALID [2018-11-23 13:13:07,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {2841#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2843#(= main_~i~0 0)} is VALID [2018-11-23 13:13:07,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {2843#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2843#(= main_~i~0 0)} is VALID [2018-11-23 13:13:07,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {2843#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:07,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:07,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:07,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:07,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:07,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:07,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2847#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:13:07,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {2847#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2848#(and (<= 4 main_~i~0) (<= main_~i~0 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))))} is VALID [2018-11-23 13:13:07,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {2848#(and (<= 4 main_~i~0) (<= main_~i~0 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} is VALID [2018-11-23 13:13:07,902 INFO L273 TraceCheckUtils]: 17: Hoare triple {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} assume !(~i~0 < ~n~0); {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} is VALID [2018-11-23 13:13:07,902 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} ~i~1 := 0; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:07,903 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:07,903 INFO L256 TraceCheckUtils]: 20: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2841#true} is VALID [2018-11-23 13:13:07,903 INFO L273 TraceCheckUtils]: 21: Hoare triple {2841#true} ~cond := #in~cond; {2851#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:13:07,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {2851#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:07,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:07,905 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #57#return; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:07,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} havoc #t~mem5; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:07,907 INFO L273 TraceCheckUtils]: 26: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:13:07,908 INFO L273 TraceCheckUtils]: 27: Hoare triple {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:13:07,908 INFO L256 TraceCheckUtils]: 28: Hoare triple {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2841#true} is VALID [2018-11-23 13:13:07,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {2841#true} ~cond := #in~cond; {2841#true} is VALID [2018-11-23 13:13:07,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {2841#true} assume !(0 == ~cond); {2841#true} is VALID [2018-11-23 13:13:07,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {2841#true} assume true; {2841#true} is VALID [2018-11-23 13:13:07,910 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2841#true} {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #57#return; {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:13:07,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} havoc #t~mem5; {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:13:07,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {2853#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:13:07,912 INFO L273 TraceCheckUtils]: 35: Hoare triple {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:13:07,912 INFO L256 TraceCheckUtils]: 36: Hoare triple {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2841#true} is VALID [2018-11-23 13:13:07,912 INFO L273 TraceCheckUtils]: 37: Hoare triple {2841#true} ~cond := #in~cond; {2841#true} is VALID [2018-11-23 13:13:07,912 INFO L273 TraceCheckUtils]: 38: Hoare triple {2841#true} assume !(0 == ~cond); {2841#true} is VALID [2018-11-23 13:13:07,913 INFO L273 TraceCheckUtils]: 39: Hoare triple {2841#true} assume true; {2841#true} is VALID [2018-11-23 13:13:07,913 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2841#true} {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #57#return; {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:13:07,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} havoc #t~mem5; {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:13:07,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {2854#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:07,916 INFO L273 TraceCheckUtils]: 43: Hoare triple {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:07,916 INFO L256 TraceCheckUtils]: 44: Hoare triple {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2841#true} is VALID [2018-11-23 13:13:07,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {2841#true} ~cond := #in~cond; {2841#true} is VALID [2018-11-23 13:13:07,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {2841#true} assume !(0 == ~cond); {2841#true} is VALID [2018-11-23 13:13:07,917 INFO L273 TraceCheckUtils]: 47: Hoare triple {2841#true} assume true; {2841#true} is VALID [2018-11-23 13:13:07,917 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2841#true} {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #57#return; {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:07,918 INFO L273 TraceCheckUtils]: 49: Hoare triple {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} havoc #t~mem5; {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:13:07,919 INFO L273 TraceCheckUtils]: 50: Hoare triple {2855#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2856#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:13:07,919 INFO L273 TraceCheckUtils]: 51: Hoare triple {2856#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2857#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:13:07,920 INFO L256 TraceCheckUtils]: 52: Hoare triple {2857#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:13:07,920 INFO L273 TraceCheckUtils]: 53: Hoare triple {2852#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2858#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:13:07,921 INFO L273 TraceCheckUtils]: 54: Hoare triple {2858#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2842#false} is VALID [2018-11-23 13:13:07,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {2842#false} assume !false; {2842#false} is VALID [2018-11-23 13:13:07,928 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:13:07,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:07,928 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-23 13:13:07,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:07,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 13:13:08,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:13:08,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:13:08,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:08,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:13:08,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-11-23 13:13:08,078 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:13:08,078 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~i~0]. (and (= (store |v_#memory_int_10| main_~x~0.base (store (select |v_#memory_int_10| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset) 0)) |#memory_int|) (<= 4 main_~i~0) (<= main_~i~0 4)) [2018-11-23 13:13:08,078 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (and (<= 4 main_~i~0) (<= main_~i~0 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset)))) [2018-11-23 13:13:42,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 13:13:42,370 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:13:42,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 13:13:42,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:13:42,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:42,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:13:42,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-11-23 13:13:42,379 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:13:42,380 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, main_~x~0.offset]. (let ((.cse0 (select |#memory_int| main_~x~0.base))) (and (= |main_#t~mem5| (select .cse0 (+ main_~x~0.offset 16))) (= 0 (select .cse0 (+ main_~x~0.offset (* 4 4)))))) [2018-11-23 13:13:42,380 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:13:42,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {2841#true} call ULTIMATE.init(); {2841#true} is VALID [2018-11-23 13:13:42,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {2841#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2841#true} is VALID [2018-11-23 13:13:42,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {2841#true} assume true; {2841#true} is VALID [2018-11-23 13:13:42,438 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2841#true} {2841#true} #53#return; {2841#true} is VALID [2018-11-23 13:13:42,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {2841#true} call #t~ret6 := main(); {2841#true} is VALID [2018-11-23 13:13:42,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {2841#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2841#true} is VALID [2018-11-23 13:13:42,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {2841#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2843#(= main_~i~0 0)} is VALID [2018-11-23 13:13:42,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {2843#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2843#(= main_~i~0 0)} is VALID [2018-11-23 13:13:42,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {2843#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:42,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:13:42,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {2844#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:42,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:13:42,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {2845#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:42,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:13:42,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {2846#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2847#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:13:42,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {2847#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} is VALID [2018-11-23 13:13:42,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} is VALID [2018-11-23 13:13:42,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} assume !(~i~0 < ~n~0); {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} is VALID [2018-11-23 13:13:42,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4))))} ~i~1 := 0; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,450 INFO L256 TraceCheckUtils]: 20: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,450 INFO L273 TraceCheckUtils]: 21: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} ~cond := #in~cond; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume !(0 == ~cond); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume true; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,452 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #57#return; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} havoc #t~mem5; {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {2850#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,456 INFO L256 TraceCheckUtils]: 28: Hoare triple {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} ~cond := #in~cond; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume !(0 == ~cond); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,458 INFO L273 TraceCheckUtils]: 31: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume true; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,459 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #57#return; {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} havoc #t~mem5; {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {2941#(and (= main_~i~1 1) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,461 INFO L273 TraceCheckUtils]: 35: Hoare triple {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,462 INFO L256 TraceCheckUtils]: 36: Hoare triple {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,463 INFO L273 TraceCheckUtils]: 37: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} ~cond := #in~cond; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,463 INFO L273 TraceCheckUtils]: 38: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume !(0 == ~cond); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,464 INFO L273 TraceCheckUtils]: 39: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume true; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,465 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #57#return; {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} havoc #t~mem5; {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {2966#(and (= main_~i~1 2) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,468 INFO L256 TraceCheckUtils]: 44: Hoare triple {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} ~cond := #in~cond; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume !(0 == ~cond); {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,470 INFO L273 TraceCheckUtils]: 47: Hoare triple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} assume true; {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} is VALID [2018-11-23 13:13:42,471 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2922#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 16)) 0))} {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #57#return; {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,472 INFO L273 TraceCheckUtils]: 49: Hoare triple {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} havoc #t~mem5; {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,473 INFO L273 TraceCheckUtils]: 50: Hoare triple {2991#(and (= main_~i~1 3) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3016#(and (= main_~i~1 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} is VALID [2018-11-23 13:13:42,474 INFO L273 TraceCheckUtils]: 51: Hoare triple {3016#(and (= main_~i~1 4) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2857#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:13:42,474 INFO L256 TraceCheckUtils]: 52: Hoare triple {2857#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3023#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:13:42,475 INFO L273 TraceCheckUtils]: 53: Hoare triple {3023#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3027#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:13:42,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {3027#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2842#false} is VALID [2018-11-23 13:13:42,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {2842#false} assume !false; {2842#false} is VALID [2018-11-23 13:13:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:13:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:42,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 25 [2018-11-23 13:13:42,505 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 13:13:42,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:13:42,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:13:42,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:13:42,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:13:42,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=529, Unknown=4, NotChecked=0, Total=600 [2018-11-23 13:13:42,588 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2018-11-23 13:13:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:59,017 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-23 13:13:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:13:59,018 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-11-23 13:13:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:13:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:59,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2018-11-23 13:13:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:13:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2018-11-23 13:13:59,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 61 transitions. [2018-11-23 13:13:59,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:13:59,093 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:13:59,093 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:13:59,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=138, Invalid=1048, Unknown=4, NotChecked=0, Total=1190 [2018-11-23 13:13:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:13:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-11-23 13:13:59,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:13:59,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 67 states. [2018-11-23 13:13:59,248 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 67 states. [2018-11-23 13:13:59,248 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 67 states. [2018-11-23 13:13:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:59,251 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 13:13:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 13:13:59,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:59,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:59,251 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 70 states. [2018-11-23 13:13:59,252 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 70 states. [2018-11-23 13:13:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:59,253 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 13:13:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 13:13:59,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:13:59,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:13:59,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:13:59,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:13:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:13:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-11-23 13:13:59,255 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2018-11-23 13:13:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:13:59,256 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-11-23 13:13:59,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:13:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-11-23 13:13:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:13:59,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:13:59,257 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:13:59,257 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:13:59,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1266785178, now seen corresponding path program 8 times [2018-11-23 13:13:59,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:59,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:59,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:59,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {3389#true} call ULTIMATE.init(); {3389#true} is VALID [2018-11-23 13:13:59,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {3389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3389#true} is VALID [2018-11-23 13:13:59,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,516 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3389#true} {3389#true} #53#return; {3389#true} is VALID [2018-11-23 13:13:59,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {3389#true} call #t~ret6 := main(); {3389#true} is VALID [2018-11-23 13:13:59,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {3389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3389#true} is VALID [2018-11-23 13:13:59,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {3389#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3391#(= main_~i~0 0)} is VALID [2018-11-23 13:13:59,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {3391#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3391#(= main_~i~0 0)} is VALID [2018-11-23 13:13:59,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {3391#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3392#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:59,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {3392#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3392#(<= main_~i~0 1)} is VALID [2018-11-23 13:13:59,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {3392#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3393#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:59,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {3393#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3393#(<= main_~i~0 2)} is VALID [2018-11-23 13:13:59,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {3393#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3394#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:59,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {3394#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3394#(<= main_~i~0 3)} is VALID [2018-11-23 13:13:59,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {3394#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3395#(<= main_~i~0 4)} is VALID [2018-11-23 13:13:59,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {3395#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3395#(<= main_~i~0 4)} is VALID [2018-11-23 13:13:59,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {3395#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3396#(<= main_~i~0 5)} is VALID [2018-11-23 13:13:59,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {3396#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {3397#(<= main_~n~0 5)} is VALID [2018-11-23 13:13:59,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {3397#(<= main_~n~0 5)} ~i~1 := 0; {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2018-11-23 13:13:59,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2018-11-23 13:13:59,585 INFO L256 TraceCheckUtils]: 20: Hoare triple {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:13:59,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:13:59,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:13:59,586 INFO L273 TraceCheckUtils]: 23: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,598 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3389#true} {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} #57#return; {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2018-11-23 13:13:59,611 INFO L273 TraceCheckUtils]: 25: Hoare triple {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} havoc #t~mem5; {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2018-11-23 13:13:59,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {3398#(and (<= main_~n~0 5) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3399#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2018-11-23 13:13:59,633 INFO L273 TraceCheckUtils]: 27: Hoare triple {3399#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3399#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2018-11-23 13:13:59,633 INFO L256 TraceCheckUtils]: 28: Hoare triple {3399#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:13:59,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:13:59,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:13:59,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,643 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3389#true} {3399#(<= main_~n~0 (+ main_~i~1 4))} #57#return; {3399#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2018-11-23 13:13:59,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {3399#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {3399#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2018-11-23 13:13:59,664 INFO L273 TraceCheckUtils]: 34: Hoare triple {3399#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3400#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:59,678 INFO L273 TraceCheckUtils]: 35: Hoare triple {3400#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3400#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:59,678 INFO L256 TraceCheckUtils]: 36: Hoare triple {3400#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:13:59,678 INFO L273 TraceCheckUtils]: 37: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:13:59,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:13:59,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,688 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3389#true} {3400#(<= main_~n~0 (+ main_~i~1 3))} #57#return; {3400#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:59,700 INFO L273 TraceCheckUtils]: 41: Hoare triple {3400#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3400#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2018-11-23 13:13:59,713 INFO L273 TraceCheckUtils]: 42: Hoare triple {3400#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3401#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:59,725 INFO L273 TraceCheckUtils]: 43: Hoare triple {3401#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3401#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:59,726 INFO L256 TraceCheckUtils]: 44: Hoare triple {3401#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:13:59,726 INFO L273 TraceCheckUtils]: 45: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:13:59,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:13:59,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,741 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3389#true} {3401#(<= main_~n~0 (+ main_~i~1 2))} #57#return; {3401#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:59,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {3401#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3401#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2018-11-23 13:13:59,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {3401#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3402#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:59,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {3402#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3402#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:59,769 INFO L256 TraceCheckUtils]: 52: Hoare triple {3402#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:13:59,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:13:59,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:13:59,770 INFO L273 TraceCheckUtils]: 55: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:13:59,789 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {3389#true} {3402#(<= main_~n~0 (+ main_~i~1 1))} #57#return; {3402#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:59,797 INFO L273 TraceCheckUtils]: 57: Hoare triple {3402#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3402#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2018-11-23 13:13:59,812 INFO L273 TraceCheckUtils]: 58: Hoare triple {3402#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3403#(<= main_~n~0 main_~i~1)} is VALID [2018-11-23 13:13:59,821 INFO L273 TraceCheckUtils]: 59: Hoare triple {3403#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3390#false} is VALID [2018-11-23 13:13:59,821 INFO L256 TraceCheckUtils]: 60: Hoare triple {3390#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3390#false} is VALID [2018-11-23 13:13:59,821 INFO L273 TraceCheckUtils]: 61: Hoare triple {3390#false} ~cond := #in~cond; {3390#false} is VALID [2018-11-23 13:13:59,821 INFO L273 TraceCheckUtils]: 62: Hoare triple {3390#false} assume 0 == ~cond; {3390#false} is VALID [2018-11-23 13:13:59,821 INFO L273 TraceCheckUtils]: 63: Hoare triple {3390#false} assume !false; {3390#false} is VALID [2018-11-23 13:13:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:13:59,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:59,827 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-23 13:13:59,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:59,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:59,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:59,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:00,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {3389#true} call ULTIMATE.init(); {3389#true} is VALID [2018-11-23 13:14:00,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {3389#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3389#true} is VALID [2018-11-23 13:14:00,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3389#true} {3389#true} #53#return; {3389#true} is VALID [2018-11-23 13:14:00,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {3389#true} call #t~ret6 := main(); {3389#true} is VALID [2018-11-23 13:14:00,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {3389#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3389#true} is VALID [2018-11-23 13:14:00,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {3389#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3425#(<= main_~i~0 0)} is VALID [2018-11-23 13:14:00,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {3425#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3425#(<= main_~i~0 0)} is VALID [2018-11-23 13:14:00,332 INFO L273 TraceCheckUtils]: 8: Hoare triple {3425#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3392#(<= main_~i~0 1)} is VALID [2018-11-23 13:14:00,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {3392#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3392#(<= main_~i~0 1)} is VALID [2018-11-23 13:14:00,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {3392#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3393#(<= main_~i~0 2)} is VALID [2018-11-23 13:14:00,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {3393#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3393#(<= main_~i~0 2)} is VALID [2018-11-23 13:14:00,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {3393#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3394#(<= main_~i~0 3)} is VALID [2018-11-23 13:14:00,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {3394#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3394#(<= main_~i~0 3)} is VALID [2018-11-23 13:14:00,335 INFO L273 TraceCheckUtils]: 14: Hoare triple {3394#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3395#(<= main_~i~0 4)} is VALID [2018-11-23 13:14:00,336 INFO L273 TraceCheckUtils]: 15: Hoare triple {3395#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3395#(<= main_~i~0 4)} is VALID [2018-11-23 13:14:00,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {3395#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3396#(<= main_~i~0 5)} is VALID [2018-11-23 13:14:00,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {3396#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {3397#(<= main_~n~0 5)} is VALID [2018-11-23 13:14:00,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {3397#(<= main_~n~0 5)} ~i~1 := 0; {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:00,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:00,339 INFO L256 TraceCheckUtils]: 20: Hoare triple {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:14:00,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:14:00,339 INFO L273 TraceCheckUtils]: 22: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:14:00,340 INFO L273 TraceCheckUtils]: 23: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,340 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3389#true} {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} #57#return; {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:00,341 INFO L273 TraceCheckUtils]: 25: Hoare triple {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} havoc #t~mem5; {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:00,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {3462#(and (<= main_~n~0 5) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:00,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:00,343 INFO L256 TraceCheckUtils]: 28: Hoare triple {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:14:00,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:14:00,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:14:00,343 INFO L273 TraceCheckUtils]: 31: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,344 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3389#true} {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} #57#return; {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:00,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} havoc #t~mem5; {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:00,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {3487#(and (<= main_~n~0 5) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:00,346 INFO L273 TraceCheckUtils]: 35: Hoare triple {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:00,347 INFO L256 TraceCheckUtils]: 36: Hoare triple {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:14:00,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:14:00,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:14:00,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,360 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3389#true} {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #57#return; {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:00,361 INFO L273 TraceCheckUtils]: 41: Hoare triple {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} havoc #t~mem5; {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:00,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {3512#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:00,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:00,362 INFO L256 TraceCheckUtils]: 44: Hoare triple {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:14:00,362 INFO L273 TraceCheckUtils]: 45: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:14:00,363 INFO L273 TraceCheckUtils]: 46: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:14:00,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,363 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3389#true} {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #57#return; {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:00,364 INFO L273 TraceCheckUtils]: 49: Hoare triple {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} havoc #t~mem5; {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:00,364 INFO L273 TraceCheckUtils]: 50: Hoare triple {3537#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} is VALID [2018-11-23 13:14:00,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} is VALID [2018-11-23 13:14:00,365 INFO L256 TraceCheckUtils]: 52: Hoare triple {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3389#true} is VALID [2018-11-23 13:14:00,365 INFO L273 TraceCheckUtils]: 53: Hoare triple {3389#true} ~cond := #in~cond; {3389#true} is VALID [2018-11-23 13:14:00,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {3389#true} assume !(0 == ~cond); {3389#true} is VALID [2018-11-23 13:14:00,366 INFO L273 TraceCheckUtils]: 55: Hoare triple {3389#true} assume true; {3389#true} is VALID [2018-11-23 13:14:00,366 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {3389#true} {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} #57#return; {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} is VALID [2018-11-23 13:14:00,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} is VALID [2018-11-23 13:14:00,368 INFO L273 TraceCheckUtils]: 58: Hoare triple {3562#(and (<= 4 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3587#(and (<= main_~n~0 5) (<= 5 main_~i~1))} is VALID [2018-11-23 13:14:00,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {3587#(and (<= main_~n~0 5) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3390#false} is VALID [2018-11-23 13:14:00,369 INFO L256 TraceCheckUtils]: 60: Hoare triple {3390#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3390#false} is VALID [2018-11-23 13:14:00,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {3390#false} ~cond := #in~cond; {3390#false} is VALID [2018-11-23 13:14:00,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {3390#false} assume 0 == ~cond; {3390#false} is VALID [2018-11-23 13:14:00,369 INFO L273 TraceCheckUtils]: 63: Hoare triple {3390#false} assume !false; {3390#false} is VALID [2018-11-23 13:14:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:14:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:14:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-11-23 13:14:00,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-11-23 13:14:00,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:00,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:14:00,477 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-23 13:14:00,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:14:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:14:00,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:14:00,478 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 22 states. [2018-11-23 13:14:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:01,984 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-11-23 13:14:01,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:14:01,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-11-23 13:14:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:14:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-11-23 13:14:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:14:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 71 transitions. [2018-11-23 13:14:01,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 71 transitions. [2018-11-23 13:14:02,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:02,075 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:14:02,075 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 13:14:02,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:14:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 13:14:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 13:14:02,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:14:02,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 13:14:02,235 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 13:14:02,235 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 13:14:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:02,237 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 13:14:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 13:14:02,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:02,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:02,237 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 13:14:02,238 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 13:14:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:02,239 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-23 13:14:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-23 13:14:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:14:02,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:14:02,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:14:02,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:14:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 13:14:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 13:14:02,241 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2018-11-23 13:14:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:02,242 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 13:14:02,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:14:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 13:14:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:14:02,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:02,243 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:02,243 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:14:02,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526280, now seen corresponding path program 9 times [2018-11-23 13:14:02,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:02,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:02,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:03,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2018-11-23 13:14:03,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3999#true} is VALID [2018-11-23 13:14:03,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:03,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #53#return; {3999#true} is VALID [2018-11-23 13:14:03,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret6 := main(); {3999#true} is VALID [2018-11-23 13:14:03,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {3999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3999#true} is VALID [2018-11-23 13:14:03,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {3999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4001#(= main_~i~0 0)} is VALID [2018-11-23 13:14:03,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {4001#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4001#(= main_~i~0 0)} is VALID [2018-11-23 13:14:03,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {4001#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4002#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:14:03,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {4002#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4002#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:14:03,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {4002#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4003#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:14:03,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {4003#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4003#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:14:03,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {4003#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4004#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:14:03,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {4004#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4004#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:14:03,444 INFO L273 TraceCheckUtils]: 14: Hoare triple {4004#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4005#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:14:03,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {4005#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4005#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:14:03,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {4005#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4006#(and (<= 5 main_~i~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:14:03,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {4006#(and (<= 5 main_~i~0) (<= main_~i~0 5))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4007#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} is VALID [2018-11-23 13:14:03,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {4007#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4008#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:14:03,448 INFO L273 TraceCheckUtils]: 19: Hoare triple {4008#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} assume !(~i~0 < ~n~0); {4008#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:14:03,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {4008#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} ~i~1 := 0; {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:14:03,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:14:03,451 INFO L256 TraceCheckUtils]: 22: Hoare triple {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3999#true} is VALID [2018-11-23 13:14:03,452 INFO L273 TraceCheckUtils]: 23: Hoare triple {3999#true} ~cond := #in~cond; {4010#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:14:03,452 INFO L273 TraceCheckUtils]: 24: Hoare triple {4010#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:14:03,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:14:03,455 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} #57#return; {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:14:03,456 INFO L273 TraceCheckUtils]: 27: Hoare triple {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} havoc #t~mem5; {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:14:03,456 INFO L273 TraceCheckUtils]: 28: Hoare triple {4009#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:14:03,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:14:03,459 INFO L256 TraceCheckUtils]: 30: Hoare triple {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3999#true} is VALID [2018-11-23 13:14:03,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2018-11-23 13:14:03,459 INFO L273 TraceCheckUtils]: 32: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2018-11-23 13:14:03,460 INFO L273 TraceCheckUtils]: 33: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:03,473 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3999#true} {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} #57#return; {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:14:03,486 INFO L273 TraceCheckUtils]: 35: Hoare triple {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} havoc #t~mem5; {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:14:03,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {4012#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:14:03,505 INFO L273 TraceCheckUtils]: 37: Hoare triple {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:14:03,505 INFO L256 TraceCheckUtils]: 38: Hoare triple {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3999#true} is VALID [2018-11-23 13:14:03,505 INFO L273 TraceCheckUtils]: 39: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2018-11-23 13:14:03,506 INFO L273 TraceCheckUtils]: 40: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2018-11-23 13:14:03,506 INFO L273 TraceCheckUtils]: 41: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:03,518 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3999#true} {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #57#return; {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:14:03,531 INFO L273 TraceCheckUtils]: 43: Hoare triple {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} havoc #t~mem5; {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:14:03,544 INFO L273 TraceCheckUtils]: 44: Hoare triple {4013#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:14:03,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:14:03,557 INFO L256 TraceCheckUtils]: 46: Hoare triple {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3999#true} is VALID [2018-11-23 13:14:03,557 INFO L273 TraceCheckUtils]: 47: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2018-11-23 13:14:03,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2018-11-23 13:14:03,557 INFO L273 TraceCheckUtils]: 49: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:03,569 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3999#true} {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #57#return; {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:14:03,569 INFO L273 TraceCheckUtils]: 51: Hoare triple {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} havoc #t~mem5; {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:14:03,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {4014#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:14:03,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:14:03,571 INFO L256 TraceCheckUtils]: 54: Hoare triple {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3999#true} is VALID [2018-11-23 13:14:03,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {3999#true} ~cond := #in~cond; {3999#true} is VALID [2018-11-23 13:14:03,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {3999#true} assume !(0 == ~cond); {3999#true} is VALID [2018-11-23 13:14:03,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:03,573 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3999#true} {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #57#return; {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:14:03,573 INFO L273 TraceCheckUtils]: 59: Hoare triple {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} havoc #t~mem5; {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:14:03,575 INFO L273 TraceCheckUtils]: 60: Hoare triple {4015#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4016#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:14:03,575 INFO L273 TraceCheckUtils]: 61: Hoare triple {4016#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4017#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:14:03,577 INFO L256 TraceCheckUtils]: 62: Hoare triple {4017#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:14:03,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {4011#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4018#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:14:03,579 INFO L273 TraceCheckUtils]: 64: Hoare triple {4018#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4000#false} is VALID [2018-11-23 13:14:03,579 INFO L273 TraceCheckUtils]: 65: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2018-11-23 13:14:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 9 proven. 99 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 13:14:03,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:14:03,587 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-23 13:14:03,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:14:03,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 13:14:03,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:03,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:03,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 13:14:03,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:14:03,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:14:03,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:14:03,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:14:03,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 13:14:05,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 13:14:05,721 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:14:05,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 13:14:05,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:14:05,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:14:05,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:14:05,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-23 13:14:05,745 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:14:05,745 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, main_~i~1, main_~x~0.offset, v_main_~i~0_34]. (let ((.cse0 (select |#memory_int| main_~x~0.base))) (and (<= main_~i~1 v_main_~i~0_34) (<= 5 main_~i~1) (= 0 (select .cse0 (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5) (= |main_#t~mem5| (select .cse0 (+ (* 4 main_~i~1) main_~x~0.offset))))) [2018-11-23 13:14:05,745 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:14:05,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {3999#true} call ULTIMATE.init(); {3999#true} is VALID [2018-11-23 13:14:05,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {3999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3999#true} is VALID [2018-11-23 13:14:05,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {3999#true} assume true; {3999#true} is VALID [2018-11-23 13:14:05,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3999#true} {3999#true} #53#return; {3999#true} is VALID [2018-11-23 13:14:05,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {3999#true} call #t~ret6 := main(); {3999#true} is VALID [2018-11-23 13:14:05,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {3999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3999#true} is VALID [2018-11-23 13:14:05,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {3999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4040#(<= main_~i~0 0)} is VALID [2018-11-23 13:14:05,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {4040#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4040#(<= main_~i~0 0)} is VALID [2018-11-23 13:14:05,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {4040#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4047#(<= main_~i~0 1)} is VALID [2018-11-23 13:14:05,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {4047#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4047#(<= main_~i~0 1)} is VALID [2018-11-23 13:14:05,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {4047#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4054#(<= main_~i~0 2)} is VALID [2018-11-23 13:14:05,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {4054#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4054#(<= main_~i~0 2)} is VALID [2018-11-23 13:14:05,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {4054#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4061#(<= main_~i~0 3)} is VALID [2018-11-23 13:14:05,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {4061#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4061#(<= main_~i~0 3)} is VALID [2018-11-23 13:14:05,820 INFO L273 TraceCheckUtils]: 14: Hoare triple {4061#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4068#(<= main_~i~0 4)} is VALID [2018-11-23 13:14:05,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {4068#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4068#(<= main_~i~0 4)} is VALID [2018-11-23 13:14:05,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {4068#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4075#(<= main_~i~0 5)} is VALID [2018-11-23 13:14:05,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {4075#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4079#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} is VALID [2018-11-23 13:14:05,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {4079#(and (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4083#(exists ((v_main_~i~0_34 Int)) (and (<= main_~i~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5)))} is VALID [2018-11-23 13:14:05,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {4083#(exists ((v_main_~i~0_34 Int)) (and (<= main_~i~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5)))} assume !(~i~0 < ~n~0); {4087#(exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5)))} is VALID [2018-11-23 13:14:05,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {4087#(exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5)))} ~i~1 := 0; {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:05,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:05,843 INFO L256 TraceCheckUtils]: 22: Hoare triple {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} ~cond := #in~cond; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume !(0 == ~cond); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume true; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,845 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} #57#return; {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:05,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} havoc #t~mem5; {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} is VALID [2018-11-23 13:14:05,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {4091#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:05,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:05,850 INFO L256 TraceCheckUtils]: 30: Hoare triple {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} ~cond := #in~cond; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,851 INFO L273 TraceCheckUtils]: 32: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume !(0 == ~cond); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume true; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,852 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} #57#return; {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:05,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} havoc #t~mem5; {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} is VALID [2018-11-23 13:14:05,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {4117#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:05,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:05,860 INFO L256 TraceCheckUtils]: 38: Hoare triple {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,860 INFO L273 TraceCheckUtils]: 39: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} ~cond := #in~cond; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume !(0 == ~cond); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume true; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,862 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} #57#return; {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:05,862 INFO L273 TraceCheckUtils]: 43: Hoare triple {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} havoc #t~mem5; {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} is VALID [2018-11-23 13:14:05,863 INFO L273 TraceCheckUtils]: 44: Hoare triple {4142#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:05,864 INFO L273 TraceCheckUtils]: 45: Hoare triple {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:05,871 INFO L256 TraceCheckUtils]: 46: Hoare triple {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} ~cond := #in~cond; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,872 INFO L273 TraceCheckUtils]: 48: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume !(0 == ~cond); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,872 INFO L273 TraceCheckUtils]: 49: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume true; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,873 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} #57#return; {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:05,874 INFO L273 TraceCheckUtils]: 51: Hoare triple {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} havoc #t~mem5; {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} is VALID [2018-11-23 13:14:05,874 INFO L273 TraceCheckUtils]: 52: Hoare triple {4167#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} is VALID [2018-11-23 13:14:05,875 INFO L273 TraceCheckUtils]: 53: Hoare triple {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} is VALID [2018-11-23 13:14:05,880 INFO L256 TraceCheckUtils]: 54: Hoare triple {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,880 INFO L273 TraceCheckUtils]: 55: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} ~cond := #in~cond; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume !(0 == ~cond); {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} assume true; {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} is VALID [2018-11-23 13:14:05,882 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {4098#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_34 Int)) (and (<= v_main_~i~0_34 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ v_main_~x~0.offset_BEFORE_CALL_11 (* 4 v_main_~i~0_34))) 0)))} {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} #57#return; {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} is VALID [2018-11-23 13:14:05,882 INFO L273 TraceCheckUtils]: 59: Hoare triple {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} havoc #t~mem5; {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} is VALID [2018-11-23 13:14:05,883 INFO L273 TraceCheckUtils]: 60: Hoare triple {4192#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4217#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 5 main_~i~1))} is VALID [2018-11-23 13:14:05,884 INFO L273 TraceCheckUtils]: 61: Hoare triple {4217#(and (exists ((v_main_~i~0_34 Int)) (and (<= main_~n~0 (+ v_main_~i~0_34 1)) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_34)))) (<= v_main_~i~0_34 5))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4017#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:14:05,884 INFO L256 TraceCheckUtils]: 62: Hoare triple {4017#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4224#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:14:05,885 INFO L273 TraceCheckUtils]: 63: Hoare triple {4224#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4228#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:14:05,886 INFO L273 TraceCheckUtils]: 64: Hoare triple {4228#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4000#false} is VALID [2018-11-23 13:14:05,886 INFO L273 TraceCheckUtils]: 65: Hoare triple {4000#false} assume !false; {4000#false} is VALID [2018-11-23 13:14:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:14:05,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:14:05,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-11-23 13:14:05,921 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-11-23 13:14:05,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:14:05,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 13:14:06,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:14:06,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 13:14:06,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 13:14:06,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1249, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 13:14:06,068 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 38 states. [2018-11-23 13:14:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:47,246 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-11-23 13:14:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 13:14:47,246 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-11-23 13:14:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:14:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 84 transitions. [2018-11-23 13:14:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:14:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 84 transitions. [2018-11-23 13:14:47,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 84 transitions. [2018-11-23 13:15:00,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 77 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-23 13:15:00,509 INFO L225 Difference]: With dead ends: 130 [2018-11-23 13:15:00,509 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 13:15:00,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 11 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=444, Invalid=4245, Unknown=3, NotChecked=0, Total=4692 [2018-11-23 13:15:00,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 13:15:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2018-11-23 13:15:00,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:15:00,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 71 states. [2018-11-23 13:15:00,695 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 71 states. [2018-11-23 13:15:00,696 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 71 states. [2018-11-23 13:15:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:00,699 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 13:15:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 13:15:00,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:00,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:00,700 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 82 states. [2018-11-23 13:15:00,700 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 82 states. [2018-11-23 13:15:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:15:00,702 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 13:15:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 13:15:00,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:15:00,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:15:00,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:15:00,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:15:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 13:15:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-11-23 13:15:00,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-11-23 13:15:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:15:00,705 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-11-23 13:15:00,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 13:15:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-23 13:15:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 13:15:00,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:15:00,706 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:15:00,706 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:15:00,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:15:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash -679833386, now seen corresponding path program 10 times [2018-11-23 13:15:00,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:15:00,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:15:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:00,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:15:00,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:15:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:01,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2018-11-23 13:15:01,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {4746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4746#true} is VALID [2018-11-23 13:15:01,348 INFO L273 TraceCheckUtils]: 2: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:01,348 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4746#true} {4746#true} #53#return; {4746#true} is VALID [2018-11-23 13:15:01,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {4746#true} call #t~ret6 := main(); {4746#true} is VALID [2018-11-23 13:15:01,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {4746#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4746#true} is VALID [2018-11-23 13:15:01,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {4746#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4748#(= main_~i~0 0)} is VALID [2018-11-23 13:15:01,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {4748#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4748#(= main_~i~0 0)} is VALID [2018-11-23 13:15:01,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {4748#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:15:01,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:15:01,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:15:01,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:15:01,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:15:01,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:15:01,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:15:01,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:15:01,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4753#(and (<= 5 main_~i~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:15:01,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {4753#(and (<= 5 main_~i~0) (<= main_~i~0 5))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4754#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} is VALID [2018-11-23 13:15:01,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {4754#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4755#(= 0 (select (store (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset) 0) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:15:01,358 INFO L273 TraceCheckUtils]: 19: Hoare triple {4755#(= 0 (select (store (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset) 0) (+ main_~x~0.offset (* 4 5))))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:15:01,358 INFO L273 TraceCheckUtils]: 20: Hoare triple {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:15:01,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} assume !(~i~0 < ~n~0); {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} is VALID [2018-11-23 13:15:01,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {4756#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5))))} ~i~1 := 0; {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:15:01,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:15:01,360 INFO L256 TraceCheckUtils]: 24: Hoare triple {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4746#true} is VALID [2018-11-23 13:15:01,361 INFO L273 TraceCheckUtils]: 25: Hoare triple {4746#true} ~cond := #in~cond; {4758#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:15:01,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {4758#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:15:01,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:15:01,363 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} #57#return; {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:15:01,364 INFO L273 TraceCheckUtils]: 29: Hoare triple {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} havoc #t~mem5; {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} is VALID [2018-11-23 13:15:01,365 INFO L273 TraceCheckUtils]: 30: Hoare triple {4757#(and (= main_~i~1 0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 5)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:15:01,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:15:01,365 INFO L256 TraceCheckUtils]: 32: Hoare triple {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4746#true} is VALID [2018-11-23 13:15:01,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2018-11-23 13:15:01,366 INFO L273 TraceCheckUtils]: 34: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2018-11-23 13:15:01,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:01,367 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4746#true} {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} #57#return; {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:15:01,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} havoc #t~mem5; {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} is VALID [2018-11-23 13:15:01,369 INFO L273 TraceCheckUtils]: 38: Hoare triple {4760#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 4)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:15:01,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:15:01,369 INFO L256 TraceCheckUtils]: 40: Hoare triple {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4746#true} is VALID [2018-11-23 13:15:01,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2018-11-23 13:15:01,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2018-11-23 13:15:01,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:01,371 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4746#true} {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #57#return; {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:15:01,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} havoc #t~mem5; {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} is VALID [2018-11-23 13:15:01,373 INFO L273 TraceCheckUtils]: 46: Hoare triple {4761#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 3)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:15:01,373 INFO L273 TraceCheckUtils]: 47: Hoare triple {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:15:01,373 INFO L256 TraceCheckUtils]: 48: Hoare triple {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4746#true} is VALID [2018-11-23 13:15:01,374 INFO L273 TraceCheckUtils]: 49: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2018-11-23 13:15:01,374 INFO L273 TraceCheckUtils]: 50: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2018-11-23 13:15:01,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:01,375 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {4746#true} {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #57#return; {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:15:01,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} havoc #t~mem5; {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} is VALID [2018-11-23 13:15:01,376 INFO L273 TraceCheckUtils]: 54: Hoare triple {4762#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 2)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:15:01,377 INFO L273 TraceCheckUtils]: 55: Hoare triple {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:15:01,377 INFO L256 TraceCheckUtils]: 56: Hoare triple {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4746#true} is VALID [2018-11-23 13:15:01,377 INFO L273 TraceCheckUtils]: 57: Hoare triple {4746#true} ~cond := #in~cond; {4746#true} is VALID [2018-11-23 13:15:01,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {4746#true} assume !(0 == ~cond); {4746#true} is VALID [2018-11-23 13:15:01,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:01,379 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {4746#true} {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #57#return; {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:15:01,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} havoc #t~mem5; {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} is VALID [2018-11-23 13:15:01,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {4763#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 (+ main_~i~1 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4764#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} is VALID [2018-11-23 13:15:01,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {4764#(= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~1) main_~x~0.offset)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4765#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:15:01,382 INFO L256 TraceCheckUtils]: 64: Hoare triple {4765#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:15:01,382 INFO L273 TraceCheckUtils]: 65: Hoare triple {4759#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4766#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:15:01,383 INFO L273 TraceCheckUtils]: 66: Hoare triple {4766#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4747#false} is VALID [2018-11-23 13:15:01,383 INFO L273 TraceCheckUtils]: 67: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2018-11-23 13:15:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 10 proven. 111 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 13:15:01,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:15:01,393 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-23 13:15:01,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:15:01,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:15:01,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:15:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:15:01,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:15:01,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 13:15:01,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:15:01,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:15:01,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:15:01,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:15:01,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 13:15:01,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 13:15:01,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:15:01,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-11-23 13:15:01,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:15:01,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:15:01,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:15:01,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-11-23 13:15:01,676 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:15:01,676 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~i~0, v_main_~i~0_40]. (let ((.cse0 (select |v_#memory_int_13| main_~x~0.base))) (and (= (store |v_#memory_int_13| main_~x~0.base (store .cse0 (+ (* 4 main_~i~0) main_~x~0.offset) 0)) |#memory_int|) (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (<= 5 v_main_~i~0_40) (= 0 (select .cse0 (+ main_~x~0.offset (* 4 v_main_~i~0_40)))))) [2018-11-23 13:15:01,676 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_40, main_~i~0]. (let ((.cse0 (select |#memory_int| main_~x~0.base))) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select .cse0 (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select .cse0 (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) [2018-11-23 13:15:07,255 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 13:15:09,937 WARN L180 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2018-11-23 13:15:45,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-23 13:15:45,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:15:45,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:15:45,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:15:45,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-23 13:15:45,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:15:45,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:15:45,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:15:45,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-11-23 13:15:45,974 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:15:45,975 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, main_~x~0.offset, v_prenex_9, v_prenex_8]. (let ((.cse0 (select |#memory_int| main_~x~0.base))) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select .cse0 (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select .cse0 (+ (* 4 v_prenex_8) main_~x~0.offset))) (= (select .cse0 (+ main_~x~0.offset 20)) |main_#t~mem5|) (<= (+ v_prenex_9 1) v_prenex_8))) [2018-11-23 13:15:45,975 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem5|) [2018-11-23 13:15:46,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {4746#true} call ULTIMATE.init(); {4746#true} is VALID [2018-11-23 13:15:46,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {4746#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4746#true} is VALID [2018-11-23 13:15:46,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {4746#true} assume true; {4746#true} is VALID [2018-11-23 13:15:46,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4746#true} {4746#true} #53#return; {4746#true} is VALID [2018-11-23 13:15:46,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {4746#true} call #t~ret6 := main(); {4746#true} is VALID [2018-11-23 13:15:46,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {4746#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4746#true} is VALID [2018-11-23 13:15:46,099 INFO L273 TraceCheckUtils]: 6: Hoare triple {4746#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4748#(= main_~i~0 0)} is VALID [2018-11-23 13:15:46,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {4748#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4748#(= main_~i~0 0)} is VALID [2018-11-23 13:15:46,100 INFO L273 TraceCheckUtils]: 8: Hoare triple {4748#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:15:46,101 INFO L273 TraceCheckUtils]: 9: Hoare triple {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:15:46,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {4749#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:15:46,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:15:46,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {4750#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:15:46,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:15:46,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {4751#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:15:46,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:15:46,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {4752#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4753#(and (<= 5 main_~i~0) (<= main_~i~0 5))} is VALID [2018-11-23 13:15:46,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {4753#(and (<= 5 main_~i~0) (<= main_~i~0 5))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4754#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} is VALID [2018-11-23 13:15:46,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {4754#(and (<= 5 main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4824#(exists ((v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (<= 5 v_main_~i~0_40)))} is VALID [2018-11-23 13:15:46,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {4824#(exists ((v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (<= 5 v_main_~i~0_40)))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} is VALID [2018-11-23 13:15:46,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} is VALID [2018-11-23 13:15:46,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} assume !(~i~0 < ~n~0); {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} is VALID [2018-11-23 13:15:46,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {4828#(exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40)))} ~i~1 := 0; {4838#(and (exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) (= main_~i~1 0))} is VALID [2018-11-23 13:15:46,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {4838#(and (exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4838#(and (exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) (= main_~i~1 0))} is VALID [2018-11-23 13:15:47,718 INFO L256 TraceCheckUtils]: 24: Hoare triple {4838#(and (exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} is VALID [2018-11-23 13:15:47,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} ~cond := #in~cond; {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} is VALID [2018-11-23 13:15:47,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} assume !(0 == ~cond); {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} is VALID [2018-11-23 13:15:47,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} assume true; {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} is VALID [2018-11-23 13:15:47,721 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4845#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0)))} {4838#(and (exists ((main_~i~0 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_40)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 main_~i~0) main_~x~0.offset))) (<= 5 v_main_~i~0_40))) (= main_~i~1 0))} #57#return; {4858#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0))) (= main_~i~1 0))} is VALID [2018-11-23 13:15:47,722 INFO L273 TraceCheckUtils]: 29: Hoare triple {4858#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0))) (= main_~i~1 0))} havoc #t~mem5; {4858#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0))) (= main_~i~1 0))} is VALID [2018-11-23 13:15:47,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {4858#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (main_~i~0 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_40 Int)) (and (<= v_main_~i~0_40 5) (<= (+ v_main_~i~0_40 1) main_~i~0) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 main_~i~0) v_main_~x~0.offset_BEFORE_CALL_16)) 0) (<= 5 v_main_~i~0_40) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ v_main_~x~0.offset_BEFORE_CALL_16 (* 4 v_main_~i~0_40))) 0))) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} is VALID [2018-11-23 13:15:47,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} is VALID [2018-11-23 13:15:49,029 INFO L256 TraceCheckUtils]: 32: Hoare triple {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,029 INFO L273 TraceCheckUtils]: 33: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} ~cond := #in~cond; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume !(0 == ~cond); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume true; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,031 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} #57#return; {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} is VALID [2018-11-23 13:15:49,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} havoc #t~mem5; {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} is VALID [2018-11-23 13:15:49,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {4865#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} is VALID [2018-11-23 13:15:49,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} is VALID [2018-11-23 13:15:49,786 INFO L256 TraceCheckUtils]: 40: Hoare triple {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,787 INFO L273 TraceCheckUtils]: 41: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} ~cond := #in~cond; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume !(0 == ~cond); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume true; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:49,788 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} #57#return; {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} is VALID [2018-11-23 13:15:49,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} havoc #t~mem5; {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} is VALID [2018-11-23 13:15:49,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {4891#(and (= main_~i~1 2) (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} is VALID [2018-11-23 13:15:49,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} is VALID [2018-11-23 13:15:51,302 INFO L256 TraceCheckUtils]: 48: Hoare triple {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:51,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} ~cond := #in~cond; {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:51,303 INFO L273 TraceCheckUtils]: 50: Hoare triple {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} assume !(0 == ~cond); {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:51,303 INFO L273 TraceCheckUtils]: 51: Hoare triple {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} assume true; {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:51,304 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {4923#(exists ((v_main_~x~0.base_BEFORE_CALL_19 Int) (v_main_~x~0.offset_BEFORE_CALL_19 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ v_main_~x~0.offset_BEFORE_CALL_19 (* 4 v_prenex_9))) 0) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_19) (+ (* 4 v_prenex_8) v_main_~x~0.offset_BEFORE_CALL_19))) (<= (+ v_prenex_9 1) v_prenex_8)))} {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} #57#return; {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} is VALID [2018-11-23 13:15:51,304 INFO L273 TraceCheckUtils]: 53: Hoare triple {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} havoc #t~mem5; {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} is VALID [2018-11-23 13:15:51,305 INFO L273 TraceCheckUtils]: 54: Hoare triple {4916#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} is VALID [2018-11-23 13:15:51,306 INFO L273 TraceCheckUtils]: 55: Hoare triple {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} is VALID [2018-11-23 13:15:53,309 INFO L256 TraceCheckUtils]: 56: Hoare triple {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is UNKNOWN [2018-11-23 13:15:53,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} ~cond := #in~cond; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:53,310 INFO L273 TraceCheckUtils]: 58: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume !(0 == ~cond); {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:53,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} assume true; {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} is VALID [2018-11-23 13:15:53,312 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {4872#(exists ((v_main_~x~0.offset_BEFORE_CALL_17 Int) (v_main_~x~0.base_BEFORE_CALL_17 Int) (v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_8)))) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_17) (+ v_main_~x~0.offset_BEFORE_CALL_17 (* 4 v_prenex_9))) 0) (<= (+ v_prenex_9 1) v_prenex_8)))} {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} #57#return; {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} is VALID [2018-11-23 13:15:53,313 INFO L273 TraceCheckUtils]: 61: Hoare triple {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} havoc #t~mem5; {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} is VALID [2018-11-23 13:15:53,314 INFO L273 TraceCheckUtils]: 62: Hoare triple {4942#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4967#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 5))} is VALID [2018-11-23 13:15:53,316 INFO L273 TraceCheckUtils]: 63: Hoare triple {4967#(and (exists ((v_prenex_8 Int) (v_prenex_9 Int)) (and (<= v_prenex_9 5) (<= 5 v_prenex_9) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_prenex_9)))) (= 0 (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_prenex_8) main_~x~0.offset))) (<= (+ v_prenex_9 1) v_prenex_8))) (= main_~i~1 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4765#(= |main_#t~mem5| 0)} is VALID [2018-11-23 13:15:53,317 INFO L256 TraceCheckUtils]: 64: Hoare triple {4765#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4974#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:15:53,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {4974#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4978#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:15:53,319 INFO L273 TraceCheckUtils]: 66: Hoare triple {4978#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4747#false} is VALID [2018-11-23 13:15:53,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {4747#false} assume !false; {4747#false} is VALID [2018-11-23 13:15:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 109 refuted. 24 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:15:53,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:15:53,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 35 [2018-11-23 13:15:53,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-11-23 13:15:53,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:15:53,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 13:16:12,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 92 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:12,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 13:16:12,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 13:16:12,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1050, Unknown=9, NotChecked=0, Total=1190 [2018-11-23 13:16:12,901 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states.