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/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:09:33,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:09:33,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:09:33,291 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:09:33,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:09:33,292 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:09:33,294 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:09:33,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:09:33,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:09:33,298 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:09:33,299 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:09:33,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:09:33,300 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:09:33,301 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:09:33,303 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:09:33,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:09:33,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:09:33,306 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:09:33,308 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:09:33,310 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:09:33,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:09:33,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:09:33,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:09:33,315 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:09:33,315 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:09:33,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:09:33,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:09:33,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:09:33,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:09:33,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:09:33,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:09:33,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:09:33,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:09:33,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:09:33,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:09:33,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:09:33,332 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 12:09:33,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:09:33,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:09:33,360 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:09:33,361 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:09:33,361 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:09:33,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:09:33,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:09:33,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:09:33,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:09:33,364 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:09:33,364 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:09:33,364 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:09:33,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:09:33,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:09:33,366 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:09:33,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:09:33,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:09:33,366 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:09:33,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:33,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:09:33,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:09:33,367 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:09:33,367 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:09:33,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:09:33,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:09:33,368 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:09:33,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:09:33,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:09:33,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:09:33,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:09:33,438 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:09:33,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-23 12:09:33,509 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd4ac104/adb7150841dc4985a28c8723e2560e80/FLAGf89ec3fc2 [2018-11-23 12:09:33,993 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:09:33,994 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-23 12:09:34,000 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd4ac104/adb7150841dc4985a28c8723e2560e80/FLAGf89ec3fc2 [2018-11-23 12:09:34,340 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bd4ac104/adb7150841dc4985a28c8723e2560e80 [2018-11-23 12:09:34,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:09:34,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:09:34,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:34,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:09:34,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:09:34,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e55024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34, skipping insertion in model container [2018-11-23 12:09:34,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:09:34,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:09:34,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:34,684 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:09:34,711 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:34,742 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:09:34,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34 WrapperNode [2018-11-23 12:09:34,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:34,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:34,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:09:34,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:09:34,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:34,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:09:34,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:09:34,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:09:34,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (1/1) ... [2018-11-23 12:09:34,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:09:34,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:09:34,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:09:34,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:09:34,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (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 12:09:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:09:35,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:09:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:09:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:09:35,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:09:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:09:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:09:35,021 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:09:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:09:35,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:09:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:09:35,529 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:09:35,530 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:09:35,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:35 BoogieIcfgContainer [2018-11-23 12:09:35,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:09:35,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:09:35,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:09:35,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:09:35,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:34" (1/3) ... [2018-11-23 12:09:35,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fee20f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:35, skipping insertion in model container [2018-11-23 12:09:35,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:34" (2/3) ... [2018-11-23 12:09:35,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fee20f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:35, skipping insertion in model container [2018-11-23 12:09:35,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:35" (3/3) ... [2018-11-23 12:09:35,540 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-23 12:09:35,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:09:35,562 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:09:35,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:09:35,622 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:09:35,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:09:35,623 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:09:35,624 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:09:35,624 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:09:35,624 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:09:35,624 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:09:35,625 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:09:35,625 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:09:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 12:09:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:09:35,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:35,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:35,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:35,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1821336840, now seen corresponding path program 1 times [2018-11-23 12:09:35,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:35,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:35,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 12:09:35,824 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 12:09:35,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 12:09:35,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #49#return; {27#true} is VALID [2018-11-23 12:09:35,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 12:09:35,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {27#true} is VALID [2018-11-23 12:09:35,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 12:09:35,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} havoc ~x~0;~x~0 := 0; {28#false} is VALID [2018-11-23 12:09:35,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {28#false} is VALID [2018-11-23 12:09:35,830 INFO L256 TraceCheckUtils]: 9: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {28#false} is VALID [2018-11-23 12:09:35,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 12:09:35,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 12:09:35,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 12:09:35,834 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 12:09:35,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:35,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:09:35,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:09:35,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:35,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:09:35,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:35,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:09:35,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:09:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:09:35,922 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 12:09:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,103 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2018-11-23 12:09:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:09:36,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:09:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 12:09:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:09:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 47 transitions. [2018-11-23 12:09:36,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 47 transitions. [2018-11-23 12:09:36,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:36,439 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:09:36,439 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:09:36,443 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 12:09:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:09:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:09:36,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:36,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:36,512 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:36,512 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:36,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,516 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:09:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:09:36,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:36,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:36,517 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:36,517 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:09:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:36,521 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:09:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:09:36,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:36,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:36,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:36,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:09:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 12:09:36,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 12:09:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:36,527 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 12:09:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:09:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:09:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:09:36,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:36,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:36,529 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:36,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1223369710, now seen corresponding path program 1 times [2018-11-23 12:09:36,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:36,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:36,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:36,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {147#true} is VALID [2018-11-23 12:09:36,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {147#true} is VALID [2018-11-23 12:09:36,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2018-11-23 12:09:36,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #49#return; {147#true} is VALID [2018-11-23 12:09:36,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret4 := main(); {147#true} is VALID [2018-11-23 12:09:36,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {147#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {149#(= main_~a~0 0)} is VALID [2018-11-23 12:09:36,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {149#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {149#(= main_~a~0 0)} is VALID [2018-11-23 12:09:36,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {149#(= main_~a~0 0)} assume !(#t~mem0 >= 0);havoc #t~mem0; {149#(= main_~a~0 0)} is VALID [2018-11-23 12:09:36,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {149#(= main_~a~0 0)} havoc ~x~0;~x~0 := 0; {150#(and (= main_~x~0 0) (= main_~a~0 0))} is VALID [2018-11-23 12:09:36,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {150#(and (= main_~x~0 0) (= main_~a~0 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {148#false} is VALID [2018-11-23 12:09:36,713 INFO L256 TraceCheckUtils]: 10: Hoare triple {148#false} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {148#false} is VALID [2018-11-23 12:09:36,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2018-11-23 12:09:36,714 INFO L273 TraceCheckUtils]: 12: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2018-11-23 12:09:36,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {148#false} assume !false; {148#false} is VALID [2018-11-23 12:09:36,716 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 12:09:36,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:36,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:09:36,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:09:36,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:36,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:09:36,823 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 12:09:36,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:09:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:09:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:36,825 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-23 12:09:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:37,030 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:09:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:09:37,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 12:09:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:09:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-23 12:09:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:09:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2018-11-23 12:09:37,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2018-11-23 12:09:37,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:37,113 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:09:37,113 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:09:37,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:09:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:09:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:09:37,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:37,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:37,129 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:37,129 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:37,131 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:09:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:09:37,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:37,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:37,133 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:37,133 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:37,136 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:09:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:09:37,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:37,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:37,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:37,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:09:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:09:37,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-11-23 12:09:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:37,140 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:09:37,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:09:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:09:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:09:37,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:37,142 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:37,142 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:37,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:37,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1451377833, now seen corresponding path program 1 times [2018-11-23 12:09:37,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:37,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:37,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:37,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:37,471 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-23 12:09:38,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2018-11-23 12:09:38,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {271#true} is VALID [2018-11-23 12:09:38,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2018-11-23 12:09:38,138 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #49#return; {271#true} is VALID [2018-11-23 12:09:38,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret4 := main(); {271#true} is VALID [2018-11-23 12:09:38,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {273#(and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {273#(and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {274#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,156 INFO L273 TraceCheckUtils]: 9: Hoare triple {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} assume !(#t~mem0 >= 0);havoc #t~mem0; {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {275#(and (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) 0)) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} havoc ~x~0;~x~0 := 0; {276#(and (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:38,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {276#(and (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= (+ |main_~#aa~0.offset| (* 4 main_~a~0)) 3)) (= |main_~#aa~0.offset| 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {277#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:38,159 INFO L256 TraceCheckUtils]: 12: Hoare triple {277#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {278#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:09:38,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {278#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {279#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:09:38,170 INFO L273 TraceCheckUtils]: 14: Hoare triple {279#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {272#false} is VALID [2018-11-23 12:09:38,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {272#false} assume !false; {272#false} is VALID [2018-11-23 12:09:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:38,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:38,175 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 12:09:38,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:38,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:38,856 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 12:09:38,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:09:38,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:38,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:38,950 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 12:09:38,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:09:38,953 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:38,953 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) 0))) (and (<= .cse0 |main_#t~mem3|) (<= 0 .cse0))) [2018-11-23 12:09:38,953 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:09:38,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2018-11-23 12:09:38,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {271#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {271#true} is VALID [2018-11-23 12:09:38,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2018-11-23 12:09:38,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #49#return; {271#true} is VALID [2018-11-23 12:09:38,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret4 := main(); {271#true} is VALID [2018-11-23 12:09:39,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {273#(and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {273#(and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (= |main_~#aa~0.offset| 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {301#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} assume !(#t~mem0 >= 0);havoc #t~mem0; {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#(and (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} havoc ~x~0;~x~0 := 0; {315#(and (= main_~x~0 0) (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} is VALID [2018-11-23 12:09:39,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {315#(and (= main_~x~0 0) (exists ((main_~a~0 Int)) (and (= 0 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))) (= |main_~#aa~0.offset| 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {277#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:39,015 INFO L256 TraceCheckUtils]: 12: Hoare triple {277#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {278#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:09:39,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {278#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {279#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:09:39,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {279#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {272#false} is VALID [2018-11-23 12:09:39,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {272#false} assume !false; {272#false} is VALID [2018-11-23 12:09:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:39,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:39,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 12:09:39,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 12:09:39,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:39,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:09:39,127 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 12:09:39,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:09:39,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:09:39,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:09:39,128 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 12 states. [2018-11-23 12:09:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:39,873 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:09:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:09:39,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2018-11-23 12:09:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:09:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-23 12:09:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:09:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-23 12:09:39,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2018-11-23 12:09:40,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:40,009 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:09:40,009 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:09:40,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:09:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:09:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 12:09:40,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:40,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 12:09:40,047 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 12:09:40,047 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 12:09:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,050 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:09:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:09:40,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:40,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:40,051 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 12:09:40,051 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 12:09:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,054 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:09:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:09:40,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:40,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:40,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:40,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:09:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:09:40,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2018-11-23 12:09:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:40,058 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:09:40,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:09:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:09:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:09:40,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:40,060 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:40,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:40,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1647853938, now seen corresponding path program 1 times [2018-11-23 12:09:40,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:40,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:40,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 12:09:40,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {474#true} is VALID [2018-11-23 12:09:40,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 12:09:40,229 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #49#return; {474#true} is VALID [2018-11-23 12:09:40,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret4 := main(); {474#true} is VALID [2018-11-23 12:09:40,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {476#(= main_~a~0 0)} is VALID [2018-11-23 12:09:40,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {476#(= main_~a~0 0)} is VALID [2018-11-23 12:09:40,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {476#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {477#(<= main_~a~0 1)} assume !(#t~mem0 >= 0);havoc #t~mem0; {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {477#(<= main_~a~0 1)} havoc ~x~0;~x~0 := 0; {478#(and (<= main_~a~0 1) (= main_~x~0 0))} is VALID [2018-11-23 12:09:40,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {478#(and (<= main_~a~0 1) (= main_~x~0 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {478#(and (<= main_~a~0 1) (= main_~x~0 0))} is VALID [2018-11-23 12:09:40,236 INFO L256 TraceCheckUtils]: 12: Hoare triple {478#(and (<= main_~a~0 1) (= main_~x~0 0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {474#true} is VALID [2018-11-23 12:09:40,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2018-11-23 12:09:40,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2018-11-23 12:09:40,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 12:09:40,238 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {474#true} {478#(and (<= main_~a~0 1) (= main_~x~0 0))} #53#return; {478#(and (<= main_~a~0 1) (= main_~x~0 0))} is VALID [2018-11-23 12:09:40,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {478#(and (<= main_~a~0 1) (= main_~x~0 0))} havoc #t~mem3; {478#(and (<= main_~a~0 1) (= main_~x~0 0))} is VALID [2018-11-23 12:09:40,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(and (<= main_~a~0 1) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {479#(<= main_~a~0 main_~x~0)} is VALID [2018-11-23 12:09:40,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {479#(<= main_~a~0 main_~x~0)} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {475#false} is VALID [2018-11-23 12:09:40,240 INFO L256 TraceCheckUtils]: 20: Hoare triple {475#false} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {475#false} is VALID [2018-11-23 12:09:40,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 12:09:40,241 INFO L273 TraceCheckUtils]: 22: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 12:09:40,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 12:09:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:40,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:40,244 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 12:09:40,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:40,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:40,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 12:09:40,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {474#true} is VALID [2018-11-23 12:09:40,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 12:09:40,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {474#true} {474#true} #49#return; {474#true} is VALID [2018-11-23 12:09:40,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {474#true} call #t~ret4 := main(); {474#true} is VALID [2018-11-23 12:09:40,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {498#(<= main_~a~0 0)} is VALID [2018-11-23 12:09:40,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {498#(<= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {498#(<= main_~a~0 0)} is VALID [2018-11-23 12:09:40,411 INFO L273 TraceCheckUtils]: 7: Hoare triple {498#(<= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,412 INFO L273 TraceCheckUtils]: 9: Hoare triple {477#(<= main_~a~0 1)} assume !(#t~mem0 >= 0);havoc #t~mem0; {477#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:40,413 INFO L273 TraceCheckUtils]: 10: Hoare triple {477#(<= main_~a~0 1)} havoc ~x~0;~x~0 := 0; {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:09:40,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:09:40,415 INFO L256 TraceCheckUtils]: 12: Hoare triple {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {474#true} is VALID [2018-11-23 12:09:40,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {474#true} ~cond := #in~cond; {474#true} is VALID [2018-11-23 12:09:40,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {474#true} assume !(0 == ~cond); {474#true} is VALID [2018-11-23 12:09:40,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 12:09:40,417 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {474#true} {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} #53#return; {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:09:40,421 INFO L273 TraceCheckUtils]: 17: Hoare triple {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} havoc #t~mem3; {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} is VALID [2018-11-23 12:09:40,422 INFO L273 TraceCheckUtils]: 18: Hoare triple {514#(and (<= main_~a~0 1) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {539#(and (<= main_~a~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 12:09:40,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {539#(and (<= main_~a~0 1) (<= 1 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {475#false} is VALID [2018-11-23 12:09:40,423 INFO L256 TraceCheckUtils]: 20: Hoare triple {475#false} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {475#false} is VALID [2018-11-23 12:09:40,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 12:09:40,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 12:09:40,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 12:09:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:40,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:40,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 12:09:40,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-23 12:09:40,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:40,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:09:40,502 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 12:09:40,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:09:40,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:09:40,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:40,504 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 12:09:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:40,903 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-23 12:09:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:09:40,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-23 12:09:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:09:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:09:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:09:40,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:09:40,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:40,967 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:09:40,968 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:09:40,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:09:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:09:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:09:41,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:41,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:09:41,017 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:09:41,017 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:09:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:41,021 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:09:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:09:41,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:41,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:41,022 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:09:41,022 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:09:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:41,024 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:09:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:09:41,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:41,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:41,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:41,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:09:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:09:41,028 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 12:09:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:41,028 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:09:41,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:09:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:09:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:09:41,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:41,030 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:41,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:41,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash 126487443, now seen corresponding path program 2 times [2018-11-23 12:09:41,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:41,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:41,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:41,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-23 12:09:41,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {718#true} is VALID [2018-11-23 12:09:41,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-23 12:09:41,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #49#return; {718#true} is VALID [2018-11-23 12:09:41,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret4 := main(); {718#true} is VALID [2018-11-23 12:09:41,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {718#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {720#(= main_~a~0 0)} is VALID [2018-11-23 12:09:41,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {720#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {720#(= main_~a~0 0)} is VALID [2018-11-23 12:09:41,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {720#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {721#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:41,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {722#(and (<= main_~a~0 1) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))))} is VALID [2018-11-23 12:09:41,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#(and (<= main_~a~0 1) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(and (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc ~x~0;~x~0 := 0; {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,438 INFO L256 TraceCheckUtils]: 14: Hoare triple {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {718#true} is VALID [2018-11-23 12:09:41,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {718#true} ~cond := #in~cond; {725#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:09:41,455 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {726#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:41,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {726#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {726#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:41,456 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {726#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #53#return; {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc #t~mem3; {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:09:41,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {724#(and (= main_~x~0 0) (<= main_~a~0 2) (or (<= main_~a~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {727#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} is VALID [2018-11-23 12:09:41,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {727#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {728#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:41,466 INFO L256 TraceCheckUtils]: 22: Hoare triple {728#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {726#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:41,467 INFO L273 TraceCheckUtils]: 23: Hoare triple {726#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {729#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:09:41,467 INFO L273 TraceCheckUtils]: 24: Hoare triple {729#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {719#false} is VALID [2018-11-23 12:09:41,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-23 12:09:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:41,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:41,472 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 12:09:41,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:41,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:41,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:41,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:42,162 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 12:09:42,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:09:42,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:42,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:42,189 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 12:09:42,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:09:42,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:42,192 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) 4))) (and (<= .cse0 |main_#t~mem3|) (<= 0 .cse0))) [2018-11-23 12:09:42,193 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:09:42,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-23 12:09:42,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {718#true} is VALID [2018-11-23 12:09:42,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-23 12:09:42,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {718#true} {718#true} #49#return; {718#true} is VALID [2018-11-23 12:09:42,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {718#true} call #t~ret4 := main(); {718#true} is VALID [2018-11-23 12:09:42,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {718#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {748#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:09:42,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {748#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {748#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:09:42,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {748#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {755#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:09:42,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {755#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {759#(and (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:09:42,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {759#(and (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,256 INFO L273 TraceCheckUtils]: 10: Hoare triple {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {763#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} havoc ~x~0;~x~0 := 0; {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,260 INFO L256 TraceCheckUtils]: 14: Hoare triple {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {780#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:09:42,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {780#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {784#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:09:42,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {784#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {788#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-23 12:09:42,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {788#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))))} assume true; {788#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-23 12:09:42,269 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {788#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) 4))))} {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} #53#return; {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,270 INFO L273 TraceCheckUtils]: 19: Hoare triple {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} havoc #t~mem3; {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {773#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {801#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} is VALID [2018-11-23 12:09:42,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {801#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 4))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {728#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:42,273 INFO L256 TraceCheckUtils]: 22: Hoare triple {728#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {808#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:09:42,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {808#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {812#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:09:42,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {812#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {719#false} is VALID [2018-11-23 12:09:42,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-23 12:09:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-11-23 12:09:42,301 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-23 12:09:42,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:42,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:09:42,397 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 12:09:42,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:09:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:09:42,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:09:42,398 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 23 states. [2018-11-23 12:09:48,254 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-11-23 12:09:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,050 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-23 12:09:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:09:50,050 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-23 12:09:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:09:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 12:09:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:09:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 63 transitions. [2018-11-23 12:09:50,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 63 transitions. [2018-11-23 12:09:50,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:50,200 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:09:50,200 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:09:50,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:09:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:09:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2018-11-23 12:09:50,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:50,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 46 states. [2018-11-23 12:09:50,314 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 46 states. [2018-11-23 12:09:50,314 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 46 states. [2018-11-23 12:09:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,319 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 12:09:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 12:09:50,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:50,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:50,321 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 58 states. [2018-11-23 12:09:50,321 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 58 states. [2018-11-23 12:09:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,325 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 12:09:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-23 12:09:50,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:50,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:50,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:50,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:09:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 12:09:50,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 26 [2018-11-23 12:09:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:50,330 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 12:09:50,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:09:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:09:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:09:50,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:50,331 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:50,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:50,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1542742641, now seen corresponding path program 3 times [2018-11-23 12:09:50,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:50,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:50,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:50,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:50,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:50,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {1118#true} call ULTIMATE.init(); {1118#true} is VALID [2018-11-23 12:09:50,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {1118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1118#true} is VALID [2018-11-23 12:09:50,662 INFO L273 TraceCheckUtils]: 2: Hoare triple {1118#true} assume true; {1118#true} is VALID [2018-11-23 12:09:50,662 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1118#true} {1118#true} #49#return; {1118#true} is VALID [2018-11-23 12:09:50,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {1118#true} call #t~ret4 := main(); {1118#true} is VALID [2018-11-23 12:09:50,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {1120#(= main_~a~0 0)} is VALID [2018-11-23 12:09:50,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {1120#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1120#(= main_~a~0 0)} is VALID [2018-11-23 12:09:50,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {1120#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1121#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:50,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {1121#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1121#(<= main_~a~0 1)} is VALID [2018-11-23 12:09:50,665 INFO L273 TraceCheckUtils]: 9: Hoare triple {1121#(<= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1122#(<= main_~a~0 2)} is VALID [2018-11-23 12:09:50,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {1122#(<= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1123#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 2))} is VALID [2018-11-23 12:09:50,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {1123#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 2))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} assume !(#t~mem0 >= 0);havoc #t~mem0; {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,669 INFO L273 TraceCheckUtils]: 14: Hoare triple {1124#(and (<= main_~a~0 3) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} havoc ~x~0;~x~0 := 0; {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,671 INFO L256 TraceCheckUtils]: 16: Hoare triple {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1118#true} is VALID [2018-11-23 12:09:50,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {1118#true} ~cond := #in~cond; {1126#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:09:50,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:50,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:50,674 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} #53#return; {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} havoc #t~mem3; {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} is VALID [2018-11-23 12:09:50,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {1125#(and (<= main_~a~0 3) (= main_~x~0 0) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 2)))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:09:50,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:09:50,722 INFO L256 TraceCheckUtils]: 24: Hoare triple {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1118#true} is VALID [2018-11-23 12:09:50,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {1118#true} ~cond := #in~cond; {1118#true} is VALID [2018-11-23 12:09:50,723 INFO L273 TraceCheckUtils]: 26: Hoare triple {1118#true} assume !(0 == ~cond); {1118#true} is VALID [2018-11-23 12:09:50,723 INFO L273 TraceCheckUtils]: 27: Hoare triple {1118#true} assume true; {1118#true} is VALID [2018-11-23 12:09:50,732 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1118#true} {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #53#return; {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:09:50,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} havoc #t~mem3; {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:09:50,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {1128#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1129#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} is VALID [2018-11-23 12:09:50,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {1129#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1130#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:50,745 INFO L256 TraceCheckUtils]: 32: Hoare triple {1130#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:09:50,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {1127#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1131#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:09:50,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {1131#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1119#false} is VALID [2018-11-23 12:09:50,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {1119#false} assume !false; {1119#false} is VALID [2018-11-23 12:09:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:50,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:50,751 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 12:09:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:50,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:09:50,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:50,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:51,427 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 12:09:51,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:09:51,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:51,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:51,440 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 12:09:51,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:09:51,443 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:51,443 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) 8))) (and (<= 0 .cse0) (<= .cse0 |main_#t~mem3|))) [2018-11-23 12:09:51,443 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:09:51,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {1118#true} call ULTIMATE.init(); {1118#true} is VALID [2018-11-23 12:09:51,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {1118#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1118#true} is VALID [2018-11-23 12:09:51,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {1118#true} assume true; {1118#true} is VALID [2018-11-23 12:09:51,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1118#true} {1118#true} #49#return; {1118#true} is VALID [2018-11-23 12:09:51,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {1118#true} call #t~ret4 := main(); {1118#true} is VALID [2018-11-23 12:09:51,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {1150#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:09:51,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1150#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1150#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:09:51,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {1150#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1157#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:09:51,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {1157#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1157#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:09:51,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {1157#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1164#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:09:51,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {1164#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1168#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {1168#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,511 INFO L273 TraceCheckUtils]: 13: Hoare triple {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {1172#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} havoc ~x~0;~x~0 := 0; {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,515 INFO L256 TraceCheckUtils]: 16: Hoare triple {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} is VALID [2018-11-23 12:09:51,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} ~cond := #in~cond; {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} is VALID [2018-11-23 12:09:51,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} assume !(0 == ~cond); {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} is VALID [2018-11-23 12:09:51,517 INFO L273 TraceCheckUtils]: 19: Hoare triple {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} assume true; {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} is VALID [2018-11-23 12:09:51,518 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} #53#return; {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,519 INFO L273 TraceCheckUtils]: 21: Hoare triple {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} havoc #t~mem3; {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {1182#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,521 INFO L273 TraceCheckUtils]: 23: Hoare triple {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,523 INFO L256 TraceCheckUtils]: 24: Hoare triple {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} is VALID [2018-11-23 12:09:51,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {1189#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8)))} ~cond := #in~cond; {1218#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:09:51,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {1218#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {1222#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 12:09:51,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {1222#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))))} assume true; {1222#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))))} is VALID [2018-11-23 12:09:51,527 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1222#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) 8))))} {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} #53#return; {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} havoc #t~mem3; {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,533 INFO L273 TraceCheckUtils]: 30: Hoare triple {1208#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1235#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} is VALID [2018-11-23 12:09:51,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {1235#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 8))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1130#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:09:51,535 INFO L256 TraceCheckUtils]: 32: Hoare triple {1130#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1242#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:09:51,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {1242#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1246#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:09:51,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {1246#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1119#false} is VALID [2018-11-23 12:09:51,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {1119#false} assume !false; {1119#false} is VALID [2018-11-23 12:09:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:09:51,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:51,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-11-23 12:09:51,562 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 12:09:51,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:51,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:09:51,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:51,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:09:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:09:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:09:51,668 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 27 states. [2018-11-23 12:10:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:00,627 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-11-23 12:10:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:10:00,627 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 12:10:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:10:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2018-11-23 12:10:00,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:10:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 94 transitions. [2018-11-23 12:10:00,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 94 transitions. [2018-11-23 12:10:00,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:00,812 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:10:00,812 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:10:00,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=310, Invalid=2552, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:10:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:10:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-11-23 12:10:01,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:01,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 49 states. [2018-11-23 12:10:01,048 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 49 states. [2018-11-23 12:10:01,048 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 49 states. [2018-11-23 12:10:01,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:01,051 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:10:01,051 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:10:01,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:01,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:01,052 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 51 states. [2018-11-23 12:10:01,053 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 51 states. [2018-11-23 12:10:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:01,055 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:10:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:10:01,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:01,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:01,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:01,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:10:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:10:01,058 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 36 [2018-11-23 12:10:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:01,059 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:10:01,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:10:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:10:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:10:01,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:10:01,060 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:10:01,061 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:10:01,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:10:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash -907902645, now seen corresponding path program 4 times [2018-11-23 12:10:01,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:10:01,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:10:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:01,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:10:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:10:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:01,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {1621#true} call ULTIMATE.init(); {1621#true} is VALID [2018-11-23 12:10:01,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {1621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1621#true} is VALID [2018-11-23 12:10:01,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {1621#true} assume true; {1621#true} is VALID [2018-11-23 12:10:01,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1621#true} {1621#true} #49#return; {1621#true} is VALID [2018-11-23 12:10:01,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {1621#true} call #t~ret4 := main(); {1621#true} is VALID [2018-11-23 12:10:01,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {1621#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {1623#(= main_~a~0 0)} is VALID [2018-11-23 12:10:01,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {1623#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1623#(= main_~a~0 0)} is VALID [2018-11-23 12:10:01,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {1623#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1624#(<= main_~a~0 1)} is VALID [2018-11-23 12:10:01,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {1624#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1624#(<= main_~a~0 1)} is VALID [2018-11-23 12:10:01,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1624#(<= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1625#(<= main_~a~0 2)} is VALID [2018-11-23 12:10:01,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {1625#(<= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1625#(<= main_~a~0 2)} is VALID [2018-11-23 12:10:01,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {1625#(<= main_~a~0 2)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1626#(<= main_~a~0 3)} is VALID [2018-11-23 12:10:01,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {1626#(<= main_~a~0 3)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1627#(and (<= main_~a~0 3) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))))} is VALID [2018-11-23 12:10:01,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {1627#(and (<= main_~a~0 3) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {1628#(and (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} havoc ~x~0;~x~0 := 0; {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,557 INFO L256 TraceCheckUtils]: 18: Hoare triple {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1621#true} is VALID [2018-11-23 12:10:01,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {1621#true} ~cond := #in~cond; {1630#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:10:01,561 INFO L273 TraceCheckUtils]: 20: Hoare triple {1630#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:10:01,561 INFO L273 TraceCheckUtils]: 21: Hoare triple {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:10:01,563 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} #53#return; {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,566 INFO L273 TraceCheckUtils]: 23: Hoare triple {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} havoc #t~mem3; {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} is VALID [2018-11-23 12:10:01,570 INFO L273 TraceCheckUtils]: 24: Hoare triple {1629#(and (= main_~x~0 0) (<= main_~a~0 4) (or (<= main_~a~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} is VALID [2018-11-23 12:10:01,572 INFO L273 TraceCheckUtils]: 25: Hoare triple {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} is VALID [2018-11-23 12:10:01,572 INFO L256 TraceCheckUtils]: 26: Hoare triple {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1621#true} is VALID [2018-11-23 12:10:01,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {1621#true} ~cond := #in~cond; {1621#true} is VALID [2018-11-23 12:10:01,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {1621#true} assume !(0 == ~cond); {1621#true} is VALID [2018-11-23 12:10:01,573 INFO L273 TraceCheckUtils]: 29: Hoare triple {1621#true} assume true; {1621#true} is VALID [2018-11-23 12:10:01,574 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1621#true} {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} #53#return; {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} is VALID [2018-11-23 12:10:01,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} havoc #t~mem3; {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} is VALID [2018-11-23 12:10:01,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {1632#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:10:01,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:10:01,576 INFO L256 TraceCheckUtils]: 34: Hoare triple {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1621#true} is VALID [2018-11-23 12:10:01,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {1621#true} ~cond := #in~cond; {1621#true} is VALID [2018-11-23 12:10:01,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {1621#true} assume !(0 == ~cond); {1621#true} is VALID [2018-11-23 12:10:01,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {1621#true} assume true; {1621#true} is VALID [2018-11-23 12:10:01,578 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1621#true} {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} #53#return; {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:10:01,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} havoc #t~mem3; {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:10:01,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {1633#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1))))) (<= main_~a~0 (+ main_~x~0 1))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1634#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} is VALID [2018-11-23 12:10:01,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {1634#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1635#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:10:01,586 INFO L256 TraceCheckUtils]: 42: Hoare triple {1635#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:10:01,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {1631#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1636#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:10:01,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {1636#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1622#false} is VALID [2018-11-23 12:10:01,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {1622#false} assume !false; {1622#false} is VALID [2018-11-23 12:10:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:10:01,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:10:01,595 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 12:10:01,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:10:01,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:10:01,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:10:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:10:01,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:10:09,368 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2018-11-23 12:10:31,081 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 12:10:31,101 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:10:31,104 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-23 12:10:31,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:10:31,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:10:31,127 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 12:10:31,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-11-23 12:10:31,131 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:10:31,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|, main_~x~0, |main_~#aa~0.offset|, v_main_~a~0_14]. (let ((.cse0 (select |#memory_int| |main_~#aa~0.base|))) (and (<= main_~x~0 v_main_~a~0_14) (<= (select .cse0 (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem3|) (<= v_main_~a~0_14 3) (<= 3 main_~x~0) (<= 0 (select .cse0 (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) [2018-11-23 12:10:31,131 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:10:31,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {1621#true} call ULTIMATE.init(); {1621#true} is VALID [2018-11-23 12:10:31,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {1621#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1621#true} is VALID [2018-11-23 12:10:31,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {1621#true} assume true; {1621#true} is VALID [2018-11-23 12:10:31,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1621#true} {1621#true} #49#return; {1621#true} is VALID [2018-11-23 12:10:31,185 INFO L256 TraceCheckUtils]: 4: Hoare triple {1621#true} call #t~ret4 := main(); {1621#true} is VALID [2018-11-23 12:10:31,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {1621#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {1623#(= main_~a~0 0)} is VALID [2018-11-23 12:10:31,186 INFO L273 TraceCheckUtils]: 6: Hoare triple {1623#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1623#(= main_~a~0 0)} is VALID [2018-11-23 12:10:31,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {1623#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1624#(<= main_~a~0 1)} is VALID [2018-11-23 12:10:31,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {1624#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1624#(<= main_~a~0 1)} is VALID [2018-11-23 12:10:31,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {1624#(<= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1625#(<= main_~a~0 2)} is VALID [2018-11-23 12:10:31,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {1625#(<= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1625#(<= main_~a~0 2)} is VALID [2018-11-23 12:10:31,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {1625#(<= main_~a~0 2)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1626#(<= main_~a~0 3)} is VALID [2018-11-23 12:10:31,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {1626#(<= main_~a~0 3)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1676#(and (<= main_~a~0 3) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:10:31,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {1676#(and (<= main_~a~0 3) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} is VALID [2018-11-23 12:10:31,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} is VALID [2018-11-23 12:10:31,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} is VALID [2018-11-23 12:10:31,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {1680#(exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|)))))} havoc ~x~0;~x~0 := 0; {1690#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} is VALID [2018-11-23 12:10:31,194 INFO L273 TraceCheckUtils]: 17: Hoare triple {1690#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1690#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} is VALID [2018-11-23 12:10:31,205 INFO L256 TraceCheckUtils]: 18: Hoare triple {1690#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} is VALID [2018-11-23 12:10:31,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} ~cond := #in~cond; {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} is VALID [2018-11-23 12:10:31,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} assume !(0 == ~cond); {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} is VALID [2018-11-23 12:10:31,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} assume true; {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} is VALID [2018-11-23 12:10:31,207 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1697#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_4| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_4| Int) (v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_4|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_4| (* 4 v_main_~a~0_14))))))} {1690#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} #53#return; {1710#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} is VALID [2018-11-23 12:10:31,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {1710#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} havoc #t~mem3; {1710#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} is VALID [2018-11-23 12:10:31,209 INFO L273 TraceCheckUtils]: 24: Hoare triple {1710#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} is VALID [2018-11-23 12:10:31,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} is VALID [2018-11-23 12:10:31,212 INFO L256 TraceCheckUtils]: 26: Hoare triple {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,212 INFO L273 TraceCheckUtils]: 27: Hoare triple {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} ~cond := #in~cond; {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} assume !(0 == ~cond); {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} assume true; {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,215 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1724#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_5| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_5| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_5|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_5| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} #53#return; {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} is VALID [2018-11-23 12:10:31,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} havoc #t~mem3; {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} is VALID [2018-11-23 12:10:31,217 INFO L273 TraceCheckUtils]: 32: Hoare triple {1717#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} is VALID [2018-11-23 12:10:31,217 INFO L273 TraceCheckUtils]: 33: Hoare triple {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} is VALID [2018-11-23 12:10:31,225 INFO L256 TraceCheckUtils]: 34: Hoare triple {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,227 INFO L273 TraceCheckUtils]: 35: Hoare triple {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} ~cond := #in~cond; {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} assume !(0 == ~cond); {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} assume true; {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} is VALID [2018-11-23 12:10:31,229 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1750#(exists ((|v_main_~#aa~0.offset_BEFORE_CALL_6| Int) (v_main_~a~0_14 Int) (|v_main_~#aa~0.base_BEFORE_CALL_6| Int)) (and (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_6|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_6| (* 4 v_main_~a~0_14)))) (<= v_main_~a~0_14 3)))} {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} #53#return; {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} is VALID [2018-11-23 12:10:31,230 INFO L273 TraceCheckUtils]: 39: Hoare triple {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} havoc #t~mem3; {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} is VALID [2018-11-23 12:10:31,231 INFO L273 TraceCheckUtils]: 40: Hoare triple {1743#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 2 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {1769#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 3 main_~x~0))} is VALID [2018-11-23 12:10:31,232 INFO L273 TraceCheckUtils]: 41: Hoare triple {1769#(and (exists ((v_main_~a~0_14 Int)) (and (<= v_main_~a~0_14 3) (<= main_~a~0 (+ v_main_~a~0_14 1)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~a~0_14) |main_~#aa~0.offset|))))) (<= 3 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {1635#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:10:31,233 INFO L256 TraceCheckUtils]: 42: Hoare triple {1635#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {1776#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:10:31,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {1776#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1780#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:10:31,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {1780#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1622#false} is VALID [2018-11-23 12:10:31,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {1622#false} assume !false; {1622#false} is VALID [2018-11-23 12:10:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 29 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 28 [2018-11-23 12:10:31,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-11-23 12:10:31,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:31,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:10:33,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:33,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:10:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:10:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=628, Unknown=16, NotChecked=0, Total=756 [2018-11-23 12:10:33,571 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 28 states. [2018-11-23 12:10:39,387 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 12:10:40,347 WARN L180 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-11-23 12:10:46,186 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 12:10:48,527 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2018-11-23 12:10:53,555 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 12:11:02,820 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 12:11:12,390 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 12:11:13,651 WARN L180 SmtUtils]: Spent 838.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 12:11:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:23,781 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 12:11:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:11:23,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-11-23 12:11:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:11:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 60 transitions. [2018-11-23 12:11:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:11:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 60 transitions. [2018-11-23 12:11:23,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 60 transitions. [2018-11-23 12:11:31,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 55 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:31,645 INFO L225 Difference]: With dead ends: 86 [2018-11-23 12:11:31,645 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:11:31,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 54.9s TimeCoverageRelationStatistics Valid=347, Invalid=1882, Unknown=27, NotChecked=0, Total=2256 [2018-11-23 12:11:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:11:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:11:31,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:31,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 12:11:31,753 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:11:31,753 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:11:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:31,757 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:11:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:11:31,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:31,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:31,757 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:11:31,758 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:11:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:31,760 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:11:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:11:31,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:31,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:31,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:31,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:11:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:11:31,763 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-11-23 12:11:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:31,763 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:11:31,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:11:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:11:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:11:31,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:31,765 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:31,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:31,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash -197849968, now seen corresponding path program 5 times [2018-11-23 12:11:31,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:31,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:31,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:32,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-23 12:11:32,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-23 12:11:32,123 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-23 12:11:32,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #49#return; {2121#true} is VALID [2018-11-23 12:11:32,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret4 := main(); {2121#true} is VALID [2018-11-23 12:11:32,124 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {2123#(= main_~a~0 0)} is VALID [2018-11-23 12:11:32,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2123#(= main_~a~0 0)} is VALID [2018-11-23 12:11:32,125 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2124#(and (<= 1 main_~a~0) (<= main_~a~0 1))} is VALID [2018-11-23 12:11:32,126 INFO L273 TraceCheckUtils]: 8: Hoare triple {2124#(and (<= 1 main_~a~0) (<= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2124#(and (<= 1 main_~a~0) (<= main_~a~0 1))} is VALID [2018-11-23 12:11:32,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(and (<= 1 main_~a~0) (<= main_~a~0 1))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2125#(and (<= 2 main_~a~0) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:32,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {2125#(and (<= 2 main_~a~0) (<= main_~a~0 2))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2125#(and (<= 2 main_~a~0) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:32,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {2125#(and (<= 2 main_~a~0) (<= main_~a~0 2))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2126#(and (<= main_~a~0 3) (<= 3 main_~a~0))} is VALID [2018-11-23 12:11:32,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {2126#(and (<= main_~a~0 3) (<= 3 main_~a~0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2127#(and (<= main_~a~0 3) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= 3 main_~a~0))} is VALID [2018-11-23 12:11:32,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {2127#(and (<= main_~a~0 3) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= 3 main_~a~0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} is VALID [2018-11-23 12:11:32,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} is VALID [2018-11-23 12:11:32,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} is VALID [2018-11-23 12:11:32,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} is VALID [2018-11-23 12:11:32,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} is VALID [2018-11-23 12:11:32,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {2128#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3))))} havoc ~x~0;~x~0 := 0; {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} is VALID [2018-11-23 12:11:32,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} is VALID [2018-11-23 12:11:32,135 INFO L256 TraceCheckUtils]: 20: Hoare triple {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2121#true} is VALID [2018-11-23 12:11:32,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~cond := #in~cond; {2130#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:11:32,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {2130#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:32,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:32,138 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} #53#return; {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} is VALID [2018-11-23 12:11:32,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} havoc #t~mem3; {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} is VALID [2018-11-23 12:11:32,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {2129#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 3)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:32,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:32,141 INFO L256 TraceCheckUtils]: 28: Hoare triple {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2121#true} is VALID [2018-11-23 12:11:32,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} ~cond := #in~cond; {2121#true} is VALID [2018-11-23 12:11:32,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} assume !(0 == ~cond); {2121#true} is VALID [2018-11-23 12:11:32,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-23 12:11:32,142 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} #53#return; {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:32,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} havoc #t~mem3; {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:32,144 INFO L273 TraceCheckUtils]: 34: Hoare triple {2132#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:32,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:32,144 INFO L256 TraceCheckUtils]: 36: Hoare triple {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2121#true} is VALID [2018-11-23 12:11:32,144 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} ~cond := #in~cond; {2121#true} is VALID [2018-11-23 12:11:32,144 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} assume !(0 == ~cond); {2121#true} is VALID [2018-11-23 12:11:32,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-23 12:11:32,145 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2121#true} {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} #53#return; {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:32,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} havoc #t~mem3; {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:32,147 INFO L273 TraceCheckUtils]: 42: Hoare triple {2133#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2134#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0))))} is VALID [2018-11-23 12:11:32,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {2134#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2135#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:32,149 INFO L256 TraceCheckUtils]: 44: Hoare triple {2135#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:32,149 INFO L273 TraceCheckUtils]: 45: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2136#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:11:32,150 INFO L273 TraceCheckUtils]: 46: Hoare triple {2136#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2122#false} is VALID [2018-11-23 12:11:32,150 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-23 12:11:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 53 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:11:32,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:32,156 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 12:11:32,165 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:11:32,254 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:11:32,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:32,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:33,123 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 12:11:33,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:11:33,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:11:33,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:11:33,136 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 12:11:33,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:11:33,143 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:11:33,143 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) 12))) (and (<= 0 .cse0) (<= .cse0 |main_#t~mem3|))) [2018-11-23 12:11:33,143 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:11:33,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-23 12:11:33,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-23 12:11:33,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-23 12:11:33,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #49#return; {2121#true} is VALID [2018-11-23 12:11:33,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret4 := main(); {2121#true} is VALID [2018-11-23 12:11:33,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {2155#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:11:33,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {2155#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2155#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:11:33,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {2155#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2162#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:11:33,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {2162#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2162#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:11:33,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {2162#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2169#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:33,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {2169#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2169#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:33,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {2169#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2176#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} is VALID [2018-11-23 12:11:33,212 INFO L273 TraceCheckUtils]: 12: Hoare triple {2176#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2180#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {2180#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {2184#(and (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} havoc ~x~0;~x~0 := 0; {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,223 INFO L256 TraceCheckUtils]: 20: Hoare triple {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} ~cond := #in~cond; {2211#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:11:33,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {2211#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {2215#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-23 12:11:33,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {2215#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))))} assume true; {2215#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-23 12:11:33,227 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2215#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12))))} {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #53#return; {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} havoc #t~mem3; {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {2200#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,232 INFO L256 TraceCheckUtils]: 28: Hoare triple {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} ~cond := #in~cond; {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} assume !(0 == ~cond); {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} assume true; {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,235 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #53#return; {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} havoc #t~mem3; {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {2228#(and (= main_~x~0 1) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,240 INFO L256 TraceCheckUtils]: 36: Hoare triple {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,240 INFO L273 TraceCheckUtils]: 37: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} ~cond := #in~cond; {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,241 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} assume !(0 == ~cond); {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} assume true; {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} is VALID [2018-11-23 12:11:33,242 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2207#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_7| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_7|) 12)))} {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #53#return; {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} havoc #t~mem3; {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {2253#(and (= main_~x~0 2) (= 0 |main_~#aa~0.offset|) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2278#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} is VALID [2018-11-23 12:11:33,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {2278#(and (= 0 |main_~#aa~0.offset|) (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 12))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2135#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:33,247 INFO L256 TraceCheckUtils]: 44: Hoare triple {2135#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2285#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:11:33,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {2285#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2289#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:11:33,248 INFO L273 TraceCheckUtils]: 46: Hoare triple {2289#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2122#false} is VALID [2018-11-23 12:11:33,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-23 12:11:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:11:33,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:33,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-11-23 12:11:33,276 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-23 12:11:33,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:33,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:11:33,376 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 12:11:33,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:11:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:11:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:11:33,378 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 31 states. [2018-11-23 12:11:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,531 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:11:39,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:11:39,531 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-23 12:11:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:11:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2018-11-23 12:11:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:11:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 53 transitions. [2018-11-23 12:11:39,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 53 transitions. [2018-11-23 12:11:39,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:39,632 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:11:39,632 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:11:39,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:11:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:11:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:11:39,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:39,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:11:39,782 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:11:39,783 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:11:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,785 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:11:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:11:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:39,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:39,786 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:11:39,786 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:11:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:39,788 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:11:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:11:39,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:39,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:39,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:39,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:11:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:11:39,791 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2018-11-23 12:11:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:39,792 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:11:39,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:11:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:11:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:11:39,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:39,793 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:39,793 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:39,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash -337983801, now seen corresponding path program 6 times [2018-11-23 12:11:39,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:39,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {2607#true} call ULTIMATE.init(); {2607#true} is VALID [2018-11-23 12:11:40,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {2607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2607#true} is VALID [2018-11-23 12:11:40,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {2607#true} assume true; {2607#true} is VALID [2018-11-23 12:11:40,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2607#true} {2607#true} #49#return; {2607#true} is VALID [2018-11-23 12:11:40,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {2607#true} call #t~ret4 := main(); {2607#true} is VALID [2018-11-23 12:11:40,365 INFO L273 TraceCheckUtils]: 5: Hoare triple {2607#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {2609#(= main_~a~0 0)} is VALID [2018-11-23 12:11:40,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {2609#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2609#(= main_~a~0 0)} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {2609#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2610#(<= main_~a~0 1)} is VALID [2018-11-23 12:11:40,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {2610#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2610#(<= main_~a~0 1)} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {2610#(<= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2611#(<= main_~a~0 2)} is VALID [2018-11-23 12:11:40,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {2611#(<= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2611#(<= main_~a~0 2)} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {2611#(<= main_~a~0 2)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2612#(<= main_~a~0 3)} is VALID [2018-11-23 12:11:40,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {2612#(<= main_~a~0 3)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2612#(<= main_~a~0 3)} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {2612#(<= main_~a~0 3)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2613#(<= main_~a~0 4)} is VALID [2018-11-23 12:11:40,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {2613#(<= main_~a~0 4)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2614#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 4))} is VALID [2018-11-23 12:11:40,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {2614#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 4))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} assume !(#t~mem0 >= 0);havoc #t~mem0; {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 5))} havoc ~x~0;~x~0 := 0; {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,376 INFO L256 TraceCheckUtils]: 20: Hoare triple {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2607#true} is VALID [2018-11-23 12:11:40,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {2607#true} ~cond := #in~cond; {2617#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:11:40,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {2617#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:40,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:40,379 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} #53#return; {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} havoc #t~mem3; {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} is VALID [2018-11-23 12:11:40,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {2616#(and (or (<= main_~a~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (= main_~x~0 0) (<= main_~a~0 5))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,382 INFO L256 TraceCheckUtils]: 28: Hoare triple {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2607#true} is VALID [2018-11-23 12:11:40,383 INFO L273 TraceCheckUtils]: 29: Hoare triple {2607#true} ~cond := #in~cond; {2607#true} is VALID [2018-11-23 12:11:40,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {2607#true} assume !(0 == ~cond); {2607#true} is VALID [2018-11-23 12:11:40,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {2607#true} assume true; {2607#true} is VALID [2018-11-23 12:11:40,385 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2607#true} {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #53#return; {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,385 INFO L273 TraceCheckUtils]: 33: Hoare triple {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc #t~mem3; {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,386 INFO L273 TraceCheckUtils]: 34: Hoare triple {2619#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,387 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,387 INFO L256 TraceCheckUtils]: 36: Hoare triple {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2607#true} is VALID [2018-11-23 12:11:40,387 INFO L273 TraceCheckUtils]: 37: Hoare triple {2607#true} ~cond := #in~cond; {2607#true} is VALID [2018-11-23 12:11:40,387 INFO L273 TraceCheckUtils]: 38: Hoare triple {2607#true} assume !(0 == ~cond); {2607#true} is VALID [2018-11-23 12:11:40,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {2607#true} assume true; {2607#true} is VALID [2018-11-23 12:11:40,388 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2607#true} {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #53#return; {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,389 INFO L273 TraceCheckUtils]: 41: Hoare triple {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc #t~mem3; {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:11:40,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {2620#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:11:40,392 INFO L273 TraceCheckUtils]: 43: Hoare triple {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:11:40,392 INFO L256 TraceCheckUtils]: 44: Hoare triple {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2607#true} is VALID [2018-11-23 12:11:40,392 INFO L273 TraceCheckUtils]: 45: Hoare triple {2607#true} ~cond := #in~cond; {2607#true} is VALID [2018-11-23 12:11:40,392 INFO L273 TraceCheckUtils]: 46: Hoare triple {2607#true} assume !(0 == ~cond); {2607#true} is VALID [2018-11-23 12:11:40,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {2607#true} assume true; {2607#true} is VALID [2018-11-23 12:11:40,394 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2607#true} {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #53#return; {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:11:40,398 INFO L273 TraceCheckUtils]: 49: Hoare triple {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} havoc #t~mem3; {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:11:40,399 INFO L273 TraceCheckUtils]: 50: Hoare triple {2621#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2622#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} is VALID [2018-11-23 12:11:40,400 INFO L273 TraceCheckUtils]: 51: Hoare triple {2622#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2623#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:40,401 INFO L256 TraceCheckUtils]: 52: Hoare triple {2623#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:40,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {2618#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2624#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:11:40,402 INFO L273 TraceCheckUtils]: 54: Hoare triple {2624#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2608#false} is VALID [2018-11-23 12:11:40,402 INFO L273 TraceCheckUtils]: 55: Hoare triple {2608#false} assume !false; {2608#false} is VALID [2018-11-23 12:11:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 19 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:11:40,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:40,411 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 12:11:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:11:40,448 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 12:11:40,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:11:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:40,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:41,972 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 12:11:41,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:11:41,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-23 12:11:41,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:11:41,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:11:42,002 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 12:11:42,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-23 12:11:42,007 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:11:42,008 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|, main_~x~0, v_main_~a~0_22]. (let ((.cse0 (select |#memory_int| |main_~#aa~0.base|))) (and (<= 0 (select .cse0 (* 4 v_main_~a~0_22))) (<= v_main_~a~0_22 4) (<= main_~x~0 v_main_~a~0_22) (<= 4 main_~x~0) (<= (select .cse0 (* 4 main_~x~0)) |main_#t~mem3|))) [2018-11-23 12:11:42,008 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:11:42,058 INFO L256 TraceCheckUtils]: 0: Hoare triple {2607#true} call ULTIMATE.init(); {2607#true} is VALID [2018-11-23 12:11:42,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {2607#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2607#true} is VALID [2018-11-23 12:11:42,059 INFO L273 TraceCheckUtils]: 2: Hoare triple {2607#true} assume true; {2607#true} is VALID [2018-11-23 12:11:42,059 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2607#true} {2607#true} #49#return; {2607#true} is VALID [2018-11-23 12:11:42,059 INFO L256 TraceCheckUtils]: 4: Hoare triple {2607#true} call #t~ret4 := main(); {2607#true} is VALID [2018-11-23 12:11:42,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {2607#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {2643#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 0))} is VALID [2018-11-23 12:11:42,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {2643#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2643#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 0))} is VALID [2018-11-23 12:11:42,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {2643#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2650#(and (<= main_~a~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {2650#(and (<= main_~a~0 1) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2650#(and (<= main_~a~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {2650#(and (<= main_~a~0 1) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2657#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:42,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {2657#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 2))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2657#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:42,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {2657#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 2))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2664#(and (<= main_~a~0 3) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {2664#(and (<= main_~a~0 3) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2664#(and (<= main_~a~0 3) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {2664#(and (<= main_~a~0 3) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2671#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 4))} is VALID [2018-11-23 12:11:42,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {2671#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 4))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2675#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 4) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} is VALID [2018-11-23 12:11:42,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {2675#(and (= 0 |main_~#aa~0.offset|) (<= main_~a~0 4) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0)))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} assume !(#t~mem0 >= 0);havoc #t~mem0; {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:42,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {2679#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|))} havoc ~x~0;~x~0 := 0; {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:42,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:42,074 INFO L256 TraceCheckUtils]: 20: Hoare triple {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} ~cond := #in~cond; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume !(0 == ~cond); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,077 INFO L273 TraceCheckUtils]: 23: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume true; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,078 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} #53#return; {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:42,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} havoc #t~mem3; {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:42,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {2689#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} is VALID [2018-11-23 12:11:42,081 INFO L273 TraceCheckUtils]: 27: Hoare triple {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} is VALID [2018-11-23 12:11:42,083 INFO L256 TraceCheckUtils]: 28: Hoare triple {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} ~cond := #in~cond; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume !(0 == ~cond); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume true; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,086 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} #53#return; {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} is VALID [2018-11-23 12:11:42,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} havoc #t~mem3; {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} is VALID [2018-11-23 12:11:42,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {2715#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} is VALID [2018-11-23 12:11:42,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} is VALID [2018-11-23 12:11:42,091 INFO L256 TraceCheckUtils]: 36: Hoare triple {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,107 INFO L273 TraceCheckUtils]: 37: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} ~cond := #in~cond; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume !(0 == ~cond); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,108 INFO L273 TraceCheckUtils]: 39: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume true; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,109 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} #53#return; {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} is VALID [2018-11-23 12:11:42,110 INFO L273 TraceCheckUtils]: 41: Hoare triple {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} havoc #t~mem3; {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} is VALID [2018-11-23 12:11:42,111 INFO L273 TraceCheckUtils]: 42: Hoare triple {2740#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 2 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} is VALID [2018-11-23 12:11:42,111 INFO L273 TraceCheckUtils]: 43: Hoare triple {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} is VALID [2018-11-23 12:11:42,113 INFO L256 TraceCheckUtils]: 44: Hoare triple {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} ~cond := #in~cond; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,114 INFO L273 TraceCheckUtils]: 46: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume !(0 == ~cond); {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,115 INFO L273 TraceCheckUtils]: 47: Hoare triple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} assume true; {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} is VALID [2018-11-23 12:11:42,116 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {2696#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (* 4 v_main_~a~0_22)))))} {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} #53#return; {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} is VALID [2018-11-23 12:11:42,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} havoc #t~mem3; {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} is VALID [2018-11-23 12:11:42,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {2765#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {2790#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 4 main_~x~0))} is VALID [2018-11-23 12:11:42,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {2790#(and (exists ((v_main_~a~0_22 Int)) (and (<= v_main_~a~0_22 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 v_main_~a~0_22)))) (<= main_~a~0 (+ v_main_~a~0_22 1)))) (= 0 |main_~#aa~0.offset|) (<= 4 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {2623#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:42,121 INFO L256 TraceCheckUtils]: 52: Hoare triple {2623#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {2797#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:11:42,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2801#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:11:42,122 INFO L273 TraceCheckUtils]: 54: Hoare triple {2801#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2608#false} is VALID [2018-11-23 12:11:42,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {2608#false} assume !false; {2608#false} is VALID [2018-11-23 12:11:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 55 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:11:42,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:42,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-11-23 12:11:42,157 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2018-11-23 12:11:42,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:42,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:11:42,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:42,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:11:42,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:11:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:11:42,296 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 33 states. [2018-11-23 12:11:47,489 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-23 12:11:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:51,119 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-11-23 12:11:51,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:11:51,119 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 56 [2018-11-23 12:11:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:11:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:11:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 64 transitions. [2018-11-23 12:11:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:11:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 64 transitions. [2018-11-23 12:11:51,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 64 transitions. [2018-11-23 12:11:51,278 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 12:11:51,280 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:11:51,280 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:11:51,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=385, Invalid=2371, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:11:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:11:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:11:51,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:11:51,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:11:51,530 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:11:51,530 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:11:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:51,534 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:11:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:11:51,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:51,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:51,534 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:11:51,534 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:11:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:11:51,536 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:11:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:11:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:11:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:11:51,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:11:51,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:11:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:11:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 12:11:51,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2018-11-23 12:11:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:11:51,539 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 12:11:51,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:11:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:11:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:11:51,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:11:51,540 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:11:51,541 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:11:51,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:11:51,541 INFO L82 PathProgramCache]: Analyzing trace with hash 643809228, now seen corresponding path program 7 times [2018-11-23 12:11:51,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:11:51,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:11:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:51,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:11:51,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:11:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:51,951 INFO L256 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2018-11-23 12:11:51,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {3182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3182#true} is VALID [2018-11-23 12:11:51,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2018-11-23 12:11:51,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #49#return; {3182#true} is VALID [2018-11-23 12:11:51,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret4 := main(); {3182#true} is VALID [2018-11-23 12:11:51,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {3182#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {3184#(= main_~a~0 0)} is VALID [2018-11-23 12:11:51,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {3184#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3184#(= main_~a~0 0)} is VALID [2018-11-23 12:11:51,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {3184#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3185#(and (<= 1 main_~a~0) (<= main_~a~0 1))} is VALID [2018-11-23 12:11:51,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {3185#(and (<= 1 main_~a~0) (<= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3185#(and (<= 1 main_~a~0) (<= main_~a~0 1))} is VALID [2018-11-23 12:11:51,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {3185#(and (<= 1 main_~a~0) (<= main_~a~0 1))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3186#(and (<= 2 main_~a~0) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:51,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {3186#(and (<= 2 main_~a~0) (<= main_~a~0 2))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3186#(and (<= 2 main_~a~0) (<= main_~a~0 2))} is VALID [2018-11-23 12:11:51,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {3186#(and (<= 2 main_~a~0) (<= main_~a~0 2))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3187#(and (<= main_~a~0 3) (<= 3 main_~a~0))} is VALID [2018-11-23 12:11:51,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {3187#(and (<= main_~a~0 3) (<= 3 main_~a~0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3187#(and (<= main_~a~0 3) (<= 3 main_~a~0))} is VALID [2018-11-23 12:11:51,957 INFO L273 TraceCheckUtils]: 13: Hoare triple {3187#(and (<= main_~a~0 3) (<= 3 main_~a~0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3188#(and (<= 4 main_~a~0) (<= main_~a~0 4))} is VALID [2018-11-23 12:11:51,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {3188#(and (<= 4 main_~a~0) (<= main_~a~0 4))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3189#(and (<= 4 main_~a~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 4))} is VALID [2018-11-23 12:11:51,959 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#(and (<= 4 main_~a~0) (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 4))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} is VALID [2018-11-23 12:11:51,960 INFO L273 TraceCheckUtils]: 16: Hoare triple {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} is VALID [2018-11-23 12:11:51,960 INFO L273 TraceCheckUtils]: 17: Hoare triple {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} is VALID [2018-11-23 12:11:51,961 INFO L273 TraceCheckUtils]: 18: Hoare triple {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} is VALID [2018-11-23 12:11:51,961 INFO L273 TraceCheckUtils]: 19: Hoare triple {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} assume !(#t~mem0 >= 0);havoc #t~mem0; {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} is VALID [2018-11-23 12:11:51,962 INFO L273 TraceCheckUtils]: 20: Hoare triple {3190#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4))))} havoc ~x~0;~x~0 := 0; {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} is VALID [2018-11-23 12:11:51,963 INFO L273 TraceCheckUtils]: 21: Hoare triple {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} is VALID [2018-11-23 12:11:51,963 INFO L256 TraceCheckUtils]: 22: Hoare triple {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3182#true} is VALID [2018-11-23 12:11:51,964 INFO L273 TraceCheckUtils]: 23: Hoare triple {3182#true} ~cond := #in~cond; {3192#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:11:51,964 INFO L273 TraceCheckUtils]: 24: Hoare triple {3192#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:51,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:51,966 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} #53#return; {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} is VALID [2018-11-23 12:11:51,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} havoc #t~mem3; {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} is VALID [2018-11-23 12:11:51,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {3191#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 4)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} is VALID [2018-11-23 12:11:51,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} is VALID [2018-11-23 12:11:51,969 INFO L256 TraceCheckUtils]: 30: Hoare triple {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3182#true} is VALID [2018-11-23 12:11:51,969 INFO L273 TraceCheckUtils]: 31: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2018-11-23 12:11:51,970 INFO L273 TraceCheckUtils]: 32: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2018-11-23 12:11:51,970 INFO L273 TraceCheckUtils]: 33: Hoare triple {3182#true} assume true; {3182#true} is VALID [2018-11-23 12:11:51,971 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3182#true} {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} #53#return; {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} is VALID [2018-11-23 12:11:51,972 INFO L273 TraceCheckUtils]: 35: Hoare triple {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} havoc #t~mem3; {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} is VALID [2018-11-23 12:11:51,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {3194#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 3)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:51,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:51,974 INFO L256 TraceCheckUtils]: 38: Hoare triple {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3182#true} is VALID [2018-11-23 12:11:51,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2018-11-23 12:11:51,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2018-11-23 12:11:51,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {3182#true} assume true; {3182#true} is VALID [2018-11-23 12:11:51,996 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3182#true} {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} #53#return; {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:52,010 INFO L273 TraceCheckUtils]: 43: Hoare triple {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} havoc #t~mem3; {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} is VALID [2018-11-23 12:11:52,024 INFO L273 TraceCheckUtils]: 44: Hoare triple {3195#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 2)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:52,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:52,039 INFO L256 TraceCheckUtils]: 46: Hoare triple {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3182#true} is VALID [2018-11-23 12:11:52,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {3182#true} ~cond := #in~cond; {3182#true} is VALID [2018-11-23 12:11:52,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {3182#true} assume !(0 == ~cond); {3182#true} is VALID [2018-11-23 12:11:52,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {3182#true} assume true; {3182#true} is VALID [2018-11-23 12:11:52,049 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3182#true} {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} #53#return; {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:52,052 INFO L273 TraceCheckUtils]: 51: Hoare triple {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} havoc #t~mem3; {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} is VALID [2018-11-23 12:11:52,053 INFO L273 TraceCheckUtils]: 52: Hoare triple {3196#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~x~0 1)))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3197#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0))))} is VALID [2018-11-23 12:11:52,058 INFO L273 TraceCheckUtils]: 53: Hoare triple {3197#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3198#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:52,059 INFO L256 TraceCheckUtils]: 54: Hoare triple {3198#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:11:52,059 INFO L273 TraceCheckUtils]: 55: Hoare triple {3193#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:11:52,060 INFO L273 TraceCheckUtils]: 56: Hoare triple {3199#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3183#false} is VALID [2018-11-23 12:11:52,060 INFO L273 TraceCheckUtils]: 57: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2018-11-23 12:11:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 82 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 12:11:52,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:11:52,067 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 12:11:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:11:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:11:52,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:11:53,171 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 12:11:53,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:11:53,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:11:53,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:11:53,186 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 12:11:53,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:11:53,188 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:11:53,189 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) 16))) (and (<= 0 .cse0) (<= .cse0 |main_#t~mem3|))) [2018-11-23 12:11:53,189 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:11:53,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3182#true} is VALID [2018-11-23 12:11:53,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {3182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3182#true} is VALID [2018-11-23 12:11:53,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2018-11-23 12:11:53,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #49#return; {3182#true} is VALID [2018-11-23 12:11:53,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret4 := main(); {3182#true} is VALID [2018-11-23 12:11:53,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {3182#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {3218#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:11:53,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {3218#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3218#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} is VALID [2018-11-23 12:11:53,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {3218#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3225#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:11:53,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {3225#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3225#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} is VALID [2018-11-23 12:11:53,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {3225#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 1))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3232#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3232#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {3232#(and (= main_~a~0 2) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3239#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} is VALID [2018-11-23 12:11:53,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {3239#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3239#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} is VALID [2018-11-23 12:11:53,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {3239#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 3))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3246#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 4))} is VALID [2018-11-23 12:11:53,287 INFO L273 TraceCheckUtils]: 14: Hoare triple {3246#(and (= 0 |main_~#aa~0.offset|) (= main_~a~0 4))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3250#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))))} is VALID [2018-11-23 12:11:53,288 INFO L273 TraceCheckUtils]: 15: Hoare triple {3250#(and (= 0 |main_~#aa~0.offset|) (<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,291 INFO L273 TraceCheckUtils]: 19: Hoare triple {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} assume !(#t~mem0 >= 0);havoc #t~mem0; {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {3254#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|))} havoc ~x~0;~x~0 := 0; {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:53,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:53,294 INFO L256 TraceCheckUtils]: 22: Hoare triple {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} ~cond := #in~cond; {3281#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:11:53,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {3281#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3285#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))))} is VALID [2018-11-23 12:11:53,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {3285#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))))} assume true; {3285#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))))} is VALID [2018-11-23 12:11:53,298 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3285#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16))))} {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} #53#return; {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:53,299 INFO L273 TraceCheckUtils]: 27: Hoare triple {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} havoc #t~mem3; {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} is VALID [2018-11-23 12:11:53,299 INFO L273 TraceCheckUtils]: 28: Hoare triple {3270#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,300 INFO L273 TraceCheckUtils]: 29: Hoare triple {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,302 INFO L256 TraceCheckUtils]: 30: Hoare triple {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} ~cond := #in~cond; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume !(0 == ~cond); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume true; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,305 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} #53#return; {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} havoc #t~mem3; {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {3298#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 1) (= 0 |main_~#aa~0.offset|))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,309 INFO L256 TraceCheckUtils]: 38: Hoare triple {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} ~cond := #in~cond; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,310 INFO L273 TraceCheckUtils]: 40: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume !(0 == ~cond); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume true; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,312 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} #53#return; {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} havoc #t~mem3; {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} is VALID [2018-11-23 12:11:53,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {3323#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= main_~x~0 2) (= 0 |main_~#aa~0.offset|))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} is VALID [2018-11-23 12:11:53,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} is VALID [2018-11-23 12:11:53,316 INFO L256 TraceCheckUtils]: 46: Hoare triple {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} ~cond := #in~cond; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume !(0 == ~cond); {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,318 INFO L273 TraceCheckUtils]: 49: Hoare triple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} assume true; {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} is VALID [2018-11-23 12:11:53,318 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3277#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_14| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_14|) 16)))} {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} #53#return; {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} is VALID [2018-11-23 12:11:53,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} havoc #t~mem3; {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} is VALID [2018-11-23 12:11:53,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {3348#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 3))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3373#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 4))} is VALID [2018-11-23 12:11:53,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {3373#(and (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 16))) (= 0 |main_~#aa~0.offset|) (= main_~x~0 4))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3198#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:11:53,322 INFO L256 TraceCheckUtils]: 54: Hoare triple {3198#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3380#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:11:53,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {3380#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3384#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:11:53,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {3384#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3183#false} is VALID [2018-11-23 12:11:53,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2018-11-23 12:11:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 12:11:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:11:53,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 35 [2018-11-23 12:11:53,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2018-11-23 12:11:53,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:11:53,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:11:53,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:11:53,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:11:53,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:11:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:11:53,470 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 35 states. [2018-11-23 12:12:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:01,596 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-23 12:12:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:12:01,597 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 58 [2018-11-23 12:12:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:12:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:12:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 60 transitions. [2018-11-23 12:12:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:12:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 60 transitions. [2018-11-23 12:12:01,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 60 transitions. [2018-11-23 12:12:01,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:01,701 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:12:01,701 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 12:12:01,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:12:01,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 12:12:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-23 12:12:01,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:12:01,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-23 12:12:01,906 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-23 12:12:01,906 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-23 12:12:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:01,908 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-23 12:12:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-23 12:12:01,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:01,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:01,909 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-23 12:12:01,909 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-23 12:12:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:12:01,912 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-11-23 12:12:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-11-23 12:12:01,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:12:01,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:12:01,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:12:01,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:12:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:12:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 12:12:01,915 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 58 [2018-11-23 12:12:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:12:01,915 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 12:12:01,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:12:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 12:12:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:12:01,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:12:01,916 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:12:01,917 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:12:01,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:12:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash -307462653, now seen corresponding path program 8 times [2018-11-23 12:12:01,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:12:01,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:12:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:01,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:12:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:12:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:03,043 INFO L256 TraceCheckUtils]: 0: Hoare triple {3752#true} call ULTIMATE.init(); {3752#true} is VALID [2018-11-23 12:12:03,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {3752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3752#true} is VALID [2018-11-23 12:12:03,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:03,044 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3752#true} {3752#true} #49#return; {3752#true} is VALID [2018-11-23 12:12:03,044 INFO L256 TraceCheckUtils]: 4: Hoare triple {3752#true} call #t~ret4 := main(); {3752#true} is VALID [2018-11-23 12:12:03,044 INFO L273 TraceCheckUtils]: 5: Hoare triple {3752#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {3754#(= main_~a~0 0)} is VALID [2018-11-23 12:12:03,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {3754#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3754#(= main_~a~0 0)} is VALID [2018-11-23 12:12:03,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {3754#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3755#(<= main_~a~0 1)} is VALID [2018-11-23 12:12:03,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {3755#(<= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3755#(<= main_~a~0 1)} is VALID [2018-11-23 12:12:03,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {3755#(<= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3756#(<= main_~a~0 2)} is VALID [2018-11-23 12:12:03,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {3756#(<= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3756#(<= main_~a~0 2)} is VALID [2018-11-23 12:12:03,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {3756#(<= main_~a~0 2)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3757#(<= main_~a~0 3)} is VALID [2018-11-23 12:12:03,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {3757#(<= main_~a~0 3)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3757#(<= main_~a~0 3)} is VALID [2018-11-23 12:12:03,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {3757#(<= main_~a~0 3)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3758#(<= main_~a~0 4)} is VALID [2018-11-23 12:12:03,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {3758#(<= main_~a~0 4)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3758#(<= main_~a~0 4)} is VALID [2018-11-23 12:12:03,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {3758#(<= main_~a~0 4)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3759#(<= main_~a~0 5)} is VALID [2018-11-23 12:12:03,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {3759#(<= main_~a~0 5)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3760#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 5))} is VALID [2018-11-23 12:12:03,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {3760#(and (= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~a~0) |main_~#aa~0.offset|))) (<= main_~a~0 5))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} assume !(#t~mem0 >= 0);havoc #t~mem0; {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {3761#(and (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} havoc ~x~0;~x~0 := 0; {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,080 INFO L256 TraceCheckUtils]: 22: Hoare triple {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3752#true} is VALID [2018-11-23 12:12:03,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {3752#true} ~cond := #in~cond; {3763#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:12:03,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {3763#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:12:03,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:12:03,083 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} #53#return; {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} havoc #t~mem3; {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} is VALID [2018-11-23 12:12:03,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {3762#(and (= main_~x~0 0) (or (<= main_~a~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 6))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} is VALID [2018-11-23 12:12:03,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} is VALID [2018-11-23 12:12:03,087 INFO L256 TraceCheckUtils]: 30: Hoare triple {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3752#true} is VALID [2018-11-23 12:12:03,087 INFO L273 TraceCheckUtils]: 31: Hoare triple {3752#true} ~cond := #in~cond; {3752#true} is VALID [2018-11-23 12:12:03,087 INFO L273 TraceCheckUtils]: 32: Hoare triple {3752#true} assume !(0 == ~cond); {3752#true} is VALID [2018-11-23 12:12:03,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:03,089 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3752#true} {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} #53#return; {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} is VALID [2018-11-23 12:12:03,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} havoc #t~mem3; {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} is VALID [2018-11-23 12:12:03,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {3765#(and (or (<= main_~a~0 (+ main_~x~0 4)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))) (<= main_~a~0 (+ main_~x~0 5)))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,092 INFO L256 TraceCheckUtils]: 38: Hoare triple {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3752#true} is VALID [2018-11-23 12:12:03,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {3752#true} ~cond := #in~cond; {3752#true} is VALID [2018-11-23 12:12:03,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {3752#true} assume !(0 == ~cond); {3752#true} is VALID [2018-11-23 12:12:03,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:03,095 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3752#true} {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #53#return; {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc #t~mem3; {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,097 INFO L273 TraceCheckUtils]: 44: Hoare triple {3766#(and (<= main_~a~0 (+ main_~x~0 4)) (or (<= main_~a~0 (+ main_~x~0 3)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,098 INFO L273 TraceCheckUtils]: 45: Hoare triple {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,098 INFO L256 TraceCheckUtils]: 46: Hoare triple {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3752#true} is VALID [2018-11-23 12:12:03,098 INFO L273 TraceCheckUtils]: 47: Hoare triple {3752#true} ~cond := #in~cond; {3752#true} is VALID [2018-11-23 12:12:03,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {3752#true} assume !(0 == ~cond); {3752#true} is VALID [2018-11-23 12:12:03,099 INFO L273 TraceCheckUtils]: 49: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:03,100 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3752#true} {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #53#return; {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,101 INFO L273 TraceCheckUtils]: 51: Hoare triple {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} havoc #t~mem3; {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} is VALID [2018-11-23 12:12:03,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {3767#(and (<= main_~a~0 (+ main_~x~0 3)) (or (<= main_~a~0 (+ main_~x~0 2)) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1))))))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:12:03,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:12:03,104 INFO L256 TraceCheckUtils]: 54: Hoare triple {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3752#true} is VALID [2018-11-23 12:12:03,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {3752#true} ~cond := #in~cond; {3752#true} is VALID [2018-11-23 12:12:03,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {3752#true} assume !(0 == ~cond); {3752#true} is VALID [2018-11-23 12:12:03,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:03,106 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3752#true} {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #53#return; {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:12:03,107 INFO L273 TraceCheckUtils]: 59: Hoare triple {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} havoc #t~mem3; {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} is VALID [2018-11-23 12:12:03,108 INFO L273 TraceCheckUtils]: 60: Hoare triple {3768#(and (<= main_~a~0 (+ main_~x~0 2)) (or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 (+ main_~a~0 (- 1)))))) (<= main_~a~0 (+ main_~x~0 1))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3769#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} is VALID [2018-11-23 12:12:03,109 INFO L273 TraceCheckUtils]: 61: Hoare triple {3769#(or (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~x~0)))) (<= main_~a~0 main_~x~0))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3770#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:12:03,110 INFO L256 TraceCheckUtils]: 62: Hoare triple {3770#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:12:03,111 INFO L273 TraceCheckUtils]: 63: Hoare triple {3764#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3771#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:12:03,112 INFO L273 TraceCheckUtils]: 64: Hoare triple {3771#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3753#false} is VALID [2018-11-23 12:12:03,112 INFO L273 TraceCheckUtils]: 65: Hoare triple {3753#false} assume !false; {3753#false} is VALID [2018-11-23 12:12:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 33 proven. 81 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:12:03,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:12:03,124 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 12:12:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:12:03,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:12:03,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:12:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:12:03,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:12:27,727 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 12:12:27,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 12:12:27,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:12:27,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:12:27,746 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 12:12:27,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-23 12:12:27,751 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:12:27,752 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#aa~0.base|, |main_~#aa~0.offset|]. (let ((.cse0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))) (and (<= .cse0 |main_#t~mem3|) (<= 0 .cse0))) [2018-11-23 12:12:27,752 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 0 |main_#t~mem3|) [2018-11-23 12:12:27,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {3752#true} call ULTIMATE.init(); {3752#true} is VALID [2018-11-23 12:12:27,819 INFO L273 TraceCheckUtils]: 1: Hoare triple {3752#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3752#true} is VALID [2018-11-23 12:12:27,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {3752#true} assume true; {3752#true} is VALID [2018-11-23 12:12:27,819 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3752#true} {3752#true} #49#return; {3752#true} is VALID [2018-11-23 12:12:27,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {3752#true} call #t~ret4 := main(); {3752#true} is VALID [2018-11-23 12:12:27,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {3752#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0; {3754#(= main_~a~0 0)} is VALID [2018-11-23 12:12:27,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {3754#(= main_~a~0 0)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3754#(= main_~a~0 0)} is VALID [2018-11-23 12:12:27,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {3754#(= main_~a~0 0)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3796#(= main_~a~0 1)} is VALID [2018-11-23 12:12:27,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {3796#(= main_~a~0 1)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3796#(= main_~a~0 1)} is VALID [2018-11-23 12:12:27,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {3796#(= main_~a~0 1)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3803#(= main_~a~0 2)} is VALID [2018-11-23 12:12:27,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {3803#(= main_~a~0 2)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3803#(= main_~a~0 2)} is VALID [2018-11-23 12:12:27,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {3803#(= main_~a~0 2)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3810#(= main_~a~0 3)} is VALID [2018-11-23 12:12:27,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {3810#(= main_~a~0 3)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3810#(= main_~a~0 3)} is VALID [2018-11-23 12:12:27,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {3810#(= main_~a~0 3)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3817#(= main_~a~0 4)} is VALID [2018-11-23 12:12:27,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {3817#(= main_~a~0 4)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3817#(= main_~a~0 4)} is VALID [2018-11-23 12:12:27,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {3817#(= main_~a~0 4)} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3824#(= main_~a~0 5)} is VALID [2018-11-23 12:12:27,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {3824#(= main_~a~0 5)} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3828#(<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} is VALID [2018-11-23 12:12:27,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {3828#(<= |main_#t~mem0| (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} assume !!(#t~mem0 >= 0);havoc #t~mem0;#t~post1 := ~a~0;~a~0 := 1 + #t~post1;havoc #t~post1; {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} is VALID [2018-11-23 12:12:27,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} is VALID [2018-11-23 12:12:27,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} assume !(#t~mem0 >= 0);havoc #t~mem0; {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} is VALID [2018-11-23 12:12:27,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {3832#(<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20)))} havoc ~x~0;~x~0 := 0; {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,831 INFO L256 TraceCheckUtils]: 22: Hoare triple {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} ~cond := #in~cond; {3853#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:12:27,833 INFO L273 TraceCheckUtils]: 24: Hoare triple {3853#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3857#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))))} is VALID [2018-11-23 12:12:27,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {3857#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))))} assume true; {3857#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))))} is VALID [2018-11-23 12:12:27,835 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3857#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20)))))} {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #53#return; {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} havoc #t~mem3; {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {3842#(and (= main_~x~0 0) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,840 INFO L256 TraceCheckUtils]: 30: Hoare triple {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} ~cond := #in~cond; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume !(0 == ~cond); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume true; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,843 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #53#return; {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} havoc #t~mem3; {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {3870#(and (= main_~x~0 1) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,849 INFO L256 TraceCheckUtils]: 38: Hoare triple {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} ~cond := #in~cond; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume !(0 == ~cond); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume true; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,852 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #53#return; {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} havoc #t~mem3; {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {3895#(and (= main_~x~0 2) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,857 INFO L256 TraceCheckUtils]: 46: Hoare triple {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} ~cond := #in~cond; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,858 INFO L273 TraceCheckUtils]: 48: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume !(0 == ~cond); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,859 INFO L273 TraceCheckUtils]: 49: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume true; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,860 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #53#return; {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} havoc #t~mem3; {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,861 INFO L273 TraceCheckUtils]: 52: Hoare triple {3920#(and (= main_~x~0 3) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,862 INFO L273 TraceCheckUtils]: 53: Hoare triple {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,864 INFO L256 TraceCheckUtils]: 54: Hoare triple {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} ~cond := #in~cond; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,866 INFO L273 TraceCheckUtils]: 56: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume !(0 == ~cond); {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,866 INFO L273 TraceCheckUtils]: 57: Hoare triple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} assume true; {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} is VALID [2018-11-23 12:12:27,868 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3849#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_18| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_18| Int)) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_18|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_18| 20))))} {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #53#return; {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,886 INFO L273 TraceCheckUtils]: 59: Hoare triple {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} havoc #t~mem3; {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,901 INFO L273 TraceCheckUtils]: 60: Hoare triple {3945#(and (= main_~x~0 4) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} #t~post2 := ~x~0;~x~0 := 1 + #t~post2;havoc #t~post2; {3970#(and (= main_~x~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} is VALID [2018-11-23 12:12:27,906 INFO L273 TraceCheckUtils]: 61: Hoare triple {3970#(and (= main_~x~0 5) (<= 0 (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| 20))))} assume !!(~x~0 < ~a~0);call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~x~0, 4); {3770#(<= 0 |main_#t~mem3|)} is VALID [2018-11-23 12:12:27,908 INFO L256 TraceCheckUtils]: 62: Hoare triple {3770#(<= 0 |main_#t~mem3|)} call __VERIFIER_assert((if #t~mem3 >= 0 then 1 else 0)); {3977#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:12:27,908 INFO L273 TraceCheckUtils]: 63: Hoare triple {3977#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3981#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:12:27,909 INFO L273 TraceCheckUtils]: 64: Hoare triple {3981#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3753#false} is VALID [2018-11-23 12:12:27,909 INFO L273 TraceCheckUtils]: 65: Hoare triple {3753#false} assume !false; {3753#false} is VALID [2018-11-23 12:12:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 12:12:27,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:12:27,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2018-11-23 12:12:27,955 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 66 [2018-11-23 12:12:27,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:12:27,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:12:28,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:12:28,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:12:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:12:28,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1261, Unknown=2, NotChecked=0, Total=1406 [2018-11-23 12:12:28,152 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 38 states. [2018-11-23 12:13:09,341 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18