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_Bitvector.epf -i ../../../trunk/examples/svcomp/reducercommutativity/max_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:21:42,943 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:21:42,945 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:21:42,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:21:42,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:21:42,959 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:21:42,960 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:21:42,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:21:42,963 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:21:42,964 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:21:42,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:21:42,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:21:42,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:21:42,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:21:42,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:21:42,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:21:42,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:21:42,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:21:42,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:21:42,976 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:21:42,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:21:42,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:21:42,981 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:21:42,981 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:21:42,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:21:42,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:21:42,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:21:42,984 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:21:42,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:21:42,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:21:42,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:21:42,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:21:42,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:21:42,988 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:21:42,989 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:21:42,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:21:42,990 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:21:43,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:21:43,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:21:43,007 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:21:43,007 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:21:43,009 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:21:43,009 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:21:43,010 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:21:43,010 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:21:43,010 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:21:43,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:21:43,011 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:21:43,011 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:21:43,011 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:21:43,011 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:21:43,011 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:21:43,012 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:21:43,012 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:21:43,012 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:21:43,012 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:21:43,012 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:21:43,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:21:43,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:21:43,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:21:43,013 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:21:43,013 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:21:43,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:21:43,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:21:43,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:21:43,015 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:21:43,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:21:43,016 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:21:43,016 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:21:43,016 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:21:43,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:21:43,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:21:43,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:21:43,101 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:21:43,101 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:21:43,102 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-23 10:21:43,173 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e13efd9/855a1cbf9a27401786fc9e65eb1b9107/FLAG5f16dd8ff [2018-11-23 10:21:43,599 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:21:43,600 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max_true-unreach-call_true-termination.i [2018-11-23 10:21:43,606 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e13efd9/855a1cbf9a27401786fc9e65eb1b9107/FLAG5f16dd8ff [2018-11-23 10:21:43,991 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e13efd9/855a1cbf9a27401786fc9e65eb1b9107 [2018-11-23 10:21:44,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:21:44,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:21:44,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:44,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:21:44,011 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:21:44,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:43" (1/1) ... [2018-11-23 10:21:44,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37975e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44, skipping insertion in model container [2018-11-23 10:21:44,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:43" (1/1) ... [2018-11-23 10:21:44,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:21:44,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:21:44,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:44,300 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:21:44,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:44,351 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:21:44,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44 WrapperNode [2018-11-23 10:21:44,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:44,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:44,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:21:44,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:21:44,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:44,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:21:44,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:21:44,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:21:44,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (1/1) ... [2018-11-23 10:21:44,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:21:44,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:21:44,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:21:44,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:21:44,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (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 10:21:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:21:44,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:21:44,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:21:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:21:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure max [2018-11-23 10:21:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2018-11-23 10:21:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:21:44,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:21:44,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:21:44,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:21:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:21:44,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:21:45,241 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:21:45,242 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:21:45,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:45 BoogieIcfgContainer [2018-11-23 10:21:45,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:21:45,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:21:45,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:21:45,247 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:21:45,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:21:43" (1/3) ... [2018-11-23 10:21:45,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b007a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:45, skipping insertion in model container [2018-11-23 10:21:45,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:44" (2/3) ... [2018-11-23 10:21:45,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b007a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:45, skipping insertion in model container [2018-11-23 10:21:45,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:45" (3/3) ... [2018-11-23 10:21:45,252 INFO L112 eAbstractionObserver]: Analyzing ICFG max_true-unreach-call_true-termination.i [2018-11-23 10:21:45,263 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:21:45,273 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:21:45,292 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:21:45,327 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:21:45,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:21:45,328 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:21:45,328 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:21:45,328 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:21:45,328 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:21:45,328 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:21:45,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:21:45,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:21:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 10:21:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:21:45,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:45,355 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:45,358 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:45,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1705268457, now seen corresponding path program 1 times [2018-11-23 10:21:45,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:45,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:45,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 10:21:45,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {36#true} is VALID [2018-11-23 10:21:45,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 10:21:45,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #67#return; {36#true} is VALID [2018-11-23 10:21:45,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret13 := main(); {36#true} is VALID [2018-11-23 10:21:45,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {36#true} is VALID [2018-11-23 10:21:45,766 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-23 10:21:45,766 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-23 10:21:45,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {36#true} is VALID [2018-11-23 10:21:45,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 10:21:45,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-23 10:21:45,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 10:21:45,781 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #71#return; {37#false} is VALID [2018-11-23 10:21:45,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {37#false} is VALID [2018-11-23 10:21:45,782 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-23 10:21:45,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-23 10:21:45,782 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 10:21:45,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-23 10:21:45,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 10:21:45,783 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #73#return; {37#false} is VALID [2018-11-23 10:21:45,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {37#false} is VALID [2018-11-23 10:21:45,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {37#false} is VALID [2018-11-23 10:21:45,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {37#false} is VALID [2018-11-23 10:21:45,785 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-23 10:21:45,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-23 10:21:45,785 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 10:21:45,786 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-23 10:21:45,786 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-23 10:21:45,786 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #75#return; {37#false} is VALID [2018-11-23 10:21:45,787 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {37#false} is VALID [2018-11-23 10:21:45,787 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-23 10:21:45,787 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 10:21:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:21:45,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:21:45,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:45,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:21:45,815 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:21:45,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:45,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:21:46,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:46,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:21:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:21:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:21:46,064 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 10:21:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:46,293 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-11-23 10:21:46,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:21:46,293 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:21:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:21:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 10:21:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:21:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 10:21:46,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 10:21:46,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:46,545 INFO L225 Difference]: With dead ends: 58 [2018-11-23 10:21:46,546 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:21:46,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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 10:21:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:21:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 10:21:46,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:46,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 10:21:46,716 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 10:21:46,716 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 10:21:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:46,726 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 10:21:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:21:46,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:46,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:46,730 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 10:21:46,730 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 10:21:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:46,740 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 10:21:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:21:46,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:46,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:46,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:46,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:21:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 10:21:46,755 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 10:21:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:46,756 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 10:21:46,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:21:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:21:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:21:46,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:46,764 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:46,764 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:46,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1312973782, now seen corresponding path program 1 times [2018-11-23 10:21:46,767 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:46,767 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:46,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:47,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 10:21:47,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {297#true} is VALID [2018-11-23 10:21:47,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 10:21:47,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #67#return; {297#true} is VALID [2018-11-23 10:21:47,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret13 := main(); {297#true} is VALID [2018-11-23 10:21:47,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {297#true} is VALID [2018-11-23 10:21:47,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:47,553 INFO L256 TraceCheckUtils]: 7: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:47,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {327#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:47,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {327#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-23 10:21:47,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-23 10:21:47,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 10:21:47,557 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {298#false} {320#(bvsgt ~N~0 (_ bv1 32))} #71#return; {298#false} is VALID [2018-11-23 10:21:47,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {298#false} is VALID [2018-11-23 10:21:47,558 INFO L256 TraceCheckUtils]: 14: Hoare triple {298#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-23 10:21:47,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-23 10:21:47,558 INFO L273 TraceCheckUtils]: 16: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-23 10:21:47,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-23 10:21:47,559 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 10:21:47,559 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {298#false} {298#false} #73#return; {298#false} is VALID [2018-11-23 10:21:47,560 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {298#false} is VALID [2018-11-23 10:21:47,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {298#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {298#false} is VALID [2018-11-23 10:21:47,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {298#false} is VALID [2018-11-23 10:21:47,561 INFO L256 TraceCheckUtils]: 23: Hoare triple {298#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-23 10:21:47,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-23 10:21:47,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-23 10:21:47,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-23 10:21:47,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-23 10:21:47,562 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {298#false} {298#false} #75#return; {298#false} is VALID [2018-11-23 10:21:47,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {298#false} is VALID [2018-11-23 10:21:47,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-23 10:21:47,563 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 10:21:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:21:47,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:47,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:47,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:21:47,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:21:47,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:47,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:21:47,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:47,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:21:47,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:21:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:21:47,630 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 10:21:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:48,143 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-11-23 10:21:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:21:48,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:21:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:21:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 10:21:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:21:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 10:21:48,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2018-11-23 10:21:48,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:48,401 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:21:48,401 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:21:48,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:21:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:21:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-11-23 10:21:48,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:48,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2018-11-23 10:21:48,429 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2018-11-23 10:21:48,429 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2018-11-23 10:21:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:48,433 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 10:21:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:21:48,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:48,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:48,435 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2018-11-23 10:21:48,435 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2018-11-23 10:21:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:48,438 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 10:21:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:21:48,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:48,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:48,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:48,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:21:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 10:21:48,443 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 32 [2018-11-23 10:21:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:48,443 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 10:21:48,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:21:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:21:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:21:48,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:48,446 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:48,446 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2020573253, now seen corresponding path program 1 times [2018-11-23 10:21:48,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:48,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:48,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:48,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2018-11-23 10:21:48,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {563#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {563#true} is VALID [2018-11-23 10:21:48,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 10:21:48,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #67#return; {563#true} is VALID [2018-11-23 10:21:48,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret13 := main(); {563#true} is VALID [2018-11-23 10:21:48,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {563#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {563#true} is VALID [2018-11-23 10:21:48,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {586#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:48,714 INFO L256 TraceCheckUtils]: 7: Hoare triple {586#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {586#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:48,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:48,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:48,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:48,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:48,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {593#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {606#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:21:48,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} assume !~bvslt32(~i~0, ~N~0); {564#false} is VALID [2018-11-23 10:21:48,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {564#false} #res := ~ret~0[32:0]; {564#false} is VALID [2018-11-23 10:21:48,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-23 10:21:48,724 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {564#false} {586#(bvsgt ~N~0 (_ bv1 32))} #71#return; {564#false} is VALID [2018-11-23 10:21:48,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {564#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {564#false} is VALID [2018-11-23 10:21:48,724 INFO L256 TraceCheckUtils]: 18: Hoare triple {564#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {564#false} is VALID [2018-11-23 10:21:48,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {564#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {564#false} is VALID [2018-11-23 10:21:48,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {564#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {564#false} is VALID [2018-11-23 10:21:48,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {564#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {564#false} is VALID [2018-11-23 10:21:48,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {564#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {564#false} is VALID [2018-11-23 10:21:48,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {564#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {564#false} is VALID [2018-11-23 10:21:48,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {564#false} assume !~bvslt32(~i~0, ~N~0); {564#false} is VALID [2018-11-23 10:21:48,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {564#false} #res := ~ret~0[32:0]; {564#false} is VALID [2018-11-23 10:21:48,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-23 10:21:48,728 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {564#false} {564#false} #73#return; {564#false} is VALID [2018-11-23 10:21:48,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {564#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {564#false} is VALID [2018-11-23 10:21:48,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {564#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {564#false} is VALID [2018-11-23 10:21:48,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {564#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {564#false} is VALID [2018-11-23 10:21:48,729 INFO L256 TraceCheckUtils]: 31: Hoare triple {564#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {564#false} is VALID [2018-11-23 10:21:48,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {564#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {564#false} is VALID [2018-11-23 10:21:48,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {564#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {564#false} is VALID [2018-11-23 10:21:48,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {564#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {564#false} is VALID [2018-11-23 10:21:48,730 INFO L273 TraceCheckUtils]: 35: Hoare triple {564#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {564#false} is VALID [2018-11-23 10:21:48,730 INFO L273 TraceCheckUtils]: 36: Hoare triple {564#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {564#false} is VALID [2018-11-23 10:21:48,731 INFO L273 TraceCheckUtils]: 37: Hoare triple {564#false} assume !~bvslt32(~i~0, ~N~0); {564#false} is VALID [2018-11-23 10:21:48,731 INFO L273 TraceCheckUtils]: 38: Hoare triple {564#false} #res := ~ret~0[32:0]; {564#false} is VALID [2018-11-23 10:21:48,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-23 10:21:48,731 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {564#false} {564#false} #75#return; {564#false} is VALID [2018-11-23 10:21:48,732 INFO L273 TraceCheckUtils]: 41: Hoare triple {564#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {564#false} is VALID [2018-11-23 10:21:48,732 INFO L273 TraceCheckUtils]: 42: Hoare triple {564#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {564#false} is VALID [2018-11-23 10:21:48,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {564#false} assume !false; {564#false} is VALID [2018-11-23 10:21:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 10:21:48,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:49,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {564#false} assume !false; {564#false} is VALID [2018-11-23 10:21:49,054 INFO L273 TraceCheckUtils]: 42: Hoare triple {564#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {564#false} is VALID [2018-11-23 10:21:49,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {564#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {564#false} is VALID [2018-11-23 10:21:49,054 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {563#true} {564#false} #75#return; {564#false} is VALID [2018-11-23 10:21:49,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 10:21:49,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {563#true} #res := ~ret~0[32:0]; {563#true} is VALID [2018-11-23 10:21:49,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {563#true} assume !~bvslt32(~i~0, ~N~0); {563#true} is VALID [2018-11-23 10:21:49,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {563#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {563#true} is VALID [2018-11-23 10:21:49,056 INFO L273 TraceCheckUtils]: 35: Hoare triple {563#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {563#true} is VALID [2018-11-23 10:21:49,056 INFO L273 TraceCheckUtils]: 34: Hoare triple {563#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {563#true} is VALID [2018-11-23 10:21:49,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {563#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {563#true} is VALID [2018-11-23 10:21:49,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {563#true} is VALID [2018-11-23 10:21:49,056 INFO L256 TraceCheckUtils]: 31: Hoare triple {564#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {563#true} is VALID [2018-11-23 10:21:49,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {564#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {564#false} is VALID [2018-11-23 10:21:49,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {564#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {564#false} is VALID [2018-11-23 10:21:49,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {564#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {564#false} is VALID [2018-11-23 10:21:49,058 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {563#true} {564#false} #73#return; {564#false} is VALID [2018-11-23 10:21:49,058 INFO L273 TraceCheckUtils]: 26: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 10:21:49,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {563#true} #res := ~ret~0[32:0]; {563#true} is VALID [2018-11-23 10:21:49,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {563#true} assume !~bvslt32(~i~0, ~N~0); {563#true} is VALID [2018-11-23 10:21:49,059 INFO L273 TraceCheckUtils]: 23: Hoare triple {563#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {563#true} is VALID [2018-11-23 10:21:49,059 INFO L273 TraceCheckUtils]: 22: Hoare triple {563#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {563#true} is VALID [2018-11-23 10:21:49,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {563#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {563#true} is VALID [2018-11-23 10:21:49,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {563#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {563#true} is VALID [2018-11-23 10:21:49,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {563#true} is VALID [2018-11-23 10:21:49,061 INFO L256 TraceCheckUtils]: 18: Hoare triple {564#false} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {563#true} is VALID [2018-11-23 10:21:49,061 INFO L273 TraceCheckUtils]: 17: Hoare triple {564#false} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {564#false} is VALID [2018-11-23 10:21:49,073 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {784#(not (bvsgt ~N~0 (_ bv1 32)))} {586#(bvsgt ~N~0 (_ bv1 32))} #71#return; {564#false} is VALID [2018-11-23 10:21:49,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {784#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {784#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:49,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {784#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {784#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:49,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {794#(or (bvslt max_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {784#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:49,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {794#(or (bvslt max_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:49,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:49,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:49,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:49,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {563#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {798#(or (bvslt (bvadd max_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:49,088 INFO L256 TraceCheckUtils]: 7: Hoare triple {586#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {563#true} is VALID [2018-11-23 10:21:49,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {586#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:49,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {563#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {563#true} is VALID [2018-11-23 10:21:49,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret13 := main(); {563#true} is VALID [2018-11-23 10:21:49,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #67#return; {563#true} is VALID [2018-11-23 10:21:49,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-23 10:21:49,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {563#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {563#true} is VALID [2018-11-23 10:21:49,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2018-11-23 10:21:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:49,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:49,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 10:21:49,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 10:21:49,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:49,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:21:49,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:49,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:21:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:21:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:21:49,270 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 8 states. [2018-11-23 10:21:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:49,969 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2018-11-23 10:21:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:21:49,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 10:21:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:21:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-23 10:21:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:21:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-23 10:21:49,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2018-11-23 10:21:50,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:50,191 INFO L225 Difference]: With dead ends: 55 [2018-11-23 10:21:50,192 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:21:50,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 10:21:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:21:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 10:21:50,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:50,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2018-11-23 10:21:50,213 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2018-11-23 10:21:50,213 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2018-11-23 10:21:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:50,218 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 10:21:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 10:21:50,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:50,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:50,220 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2018-11-23 10:21:50,220 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2018-11-23 10:21:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:50,224 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 10:21:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 10:21:50,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:50,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:50,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:50,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:21:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 10:21:50,229 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 44 [2018-11-23 10:21:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:50,229 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 10:21:50,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:21:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 10:21:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 10:21:50,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:50,232 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:50,232 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:50,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash -543091744, now seen corresponding path program 2 times [2018-11-23 10:21:50,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:50,233 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:50,262 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:21:50,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:21:50,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:50,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:50,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 10:21:50,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1024#true} is VALID [2018-11-23 10:21:50,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:21:50,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #67#return; {1024#true} is VALID [2018-11-23 10:21:50,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret13 := main(); {1024#true} is VALID [2018-11-23 10:21:50,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {1024#true} is VALID [2018-11-23 10:21:50,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {1024#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1047#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:50,679 INFO L256 TraceCheckUtils]: 7: Hoare triple {1047#(bvsgt ~N~0 (_ bv1 32))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {1047#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:50,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {1047#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {1054#(and (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:21:50,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:21:50,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:21:50,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:21:50,694 INFO L273 TraceCheckUtils]: 16: Hoare triple {1067#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv1 32) max_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1080#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) max_~i~0))} is VALID [2018-11-23 10:21:50,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) max_~i~0))} assume !~bvslt32(~i~0, ~N~0); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,695 INFO L273 TraceCheckUtils]: 18: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,697 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1047#(bvsgt ~N~0 (_ bv1 32))} #71#return; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,700 INFO L256 TraceCheckUtils]: 22: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,703 INFO L273 TraceCheckUtils]: 25: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,708 INFO L273 TraceCheckUtils]: 30: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,713 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #73#return; {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:50,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {1084#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {1142#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-23 10:21:50,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {1142#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1025#false} is VALID [2018-11-23 10:21:50,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {1025#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1025#false} is VALID [2018-11-23 10:21:50,718 INFO L256 TraceCheckUtils]: 39: Hoare triple {1025#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {1025#false} is VALID [2018-11-23 10:21:50,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {1025#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1025#false} is VALID [2018-11-23 10:21:50,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {1025#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1025#false} is VALID [2018-11-23 10:21:50,720 INFO L273 TraceCheckUtils]: 42: Hoare triple {1025#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1025#false} is VALID [2018-11-23 10:21:50,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {1025#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1025#false} is VALID [2018-11-23 10:21:50,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {1025#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1025#false} is VALID [2018-11-23 10:21:50,720 INFO L273 TraceCheckUtils]: 45: Hoare triple {1025#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1025#false} is VALID [2018-11-23 10:21:50,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {1025#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1025#false} is VALID [2018-11-23 10:21:50,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {1025#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1025#false} is VALID [2018-11-23 10:21:50,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {1025#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1025#false} is VALID [2018-11-23 10:21:50,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {1025#false} assume !~bvslt32(~i~0, ~N~0); {1025#false} is VALID [2018-11-23 10:21:50,722 INFO L273 TraceCheckUtils]: 50: Hoare triple {1025#false} #res := ~ret~0[32:0]; {1025#false} is VALID [2018-11-23 10:21:50,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {1025#false} assume true; {1025#false} is VALID [2018-11-23 10:21:50,722 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1025#false} {1025#false} #75#return; {1025#false} is VALID [2018-11-23 10:21:50,723 INFO L273 TraceCheckUtils]: 53: Hoare triple {1025#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1025#false} is VALID [2018-11-23 10:21:50,723 INFO L273 TraceCheckUtils]: 54: Hoare triple {1025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1025#false} is VALID [2018-11-23 10:21:50,723 INFO L273 TraceCheckUtils]: 55: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 10:21:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:50,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:51,138 INFO L273 TraceCheckUtils]: 55: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 10:21:51,138 INFO L273 TraceCheckUtils]: 54: Hoare triple {1025#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1025#false} is VALID [2018-11-23 10:21:51,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {1025#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1025#false} is VALID [2018-11-23 10:21:51,139 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1024#true} {1025#false} #75#return; {1025#false} is VALID [2018-11-23 10:21:51,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:21:51,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {1024#true} #res := ~ret~0[32:0]; {1024#true} is VALID [2018-11-23 10:21:51,140 INFO L273 TraceCheckUtils]: 49: Hoare triple {1024#true} assume !~bvslt32(~i~0, ~N~0); {1024#true} is VALID [2018-11-23 10:21:51,140 INFO L273 TraceCheckUtils]: 48: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,140 INFO L273 TraceCheckUtils]: 47: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,142 INFO L273 TraceCheckUtils]: 44: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,142 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,142 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1024#true} is VALID [2018-11-23 10:21:51,143 INFO L256 TraceCheckUtils]: 39: Hoare triple {1025#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {1024#true} is VALID [2018-11-23 10:21:51,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {1025#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1025#false} is VALID [2018-11-23 10:21:51,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {1254#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1025#false} is VALID [2018-11-23 10:21:51,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {1254#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:51,151 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1024#true} {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #73#return; {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:51,152 INFO L273 TraceCheckUtils]: 34: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:21:51,152 INFO L273 TraceCheckUtils]: 33: Hoare triple {1024#true} #res := ~ret~0[32:0]; {1024#true} is VALID [2018-11-23 10:21:51,152 INFO L273 TraceCheckUtils]: 32: Hoare triple {1024#true} assume !~bvslt32(~i~0, ~N~0); {1024#true} is VALID [2018-11-23 10:21:51,153 INFO L273 TraceCheckUtils]: 31: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,154 INFO L273 TraceCheckUtils]: 30: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,154 INFO L273 TraceCheckUtils]: 28: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,154 INFO L273 TraceCheckUtils]: 27: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,155 INFO L273 TraceCheckUtils]: 25: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,155 INFO L273 TraceCheckUtils]: 23: Hoare triple {1024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1024#true} is VALID [2018-11-23 10:21:51,156 INFO L256 TraceCheckUtils]: 22: Hoare triple {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {1024#true} is VALID [2018-11-23 10:21:51,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:51,158 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1024#true} {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #71#return; {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:51,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:21:51,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {1024#true} #res := ~ret~0[32:0]; {1024#true} is VALID [2018-11-23 10:21:51,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {1024#true} assume !~bvslt32(~i~0, ~N~0); {1024#true} is VALID [2018-11-23 10:21:51,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {1024#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1024#true} is VALID [2018-11-23 10:21:51,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {1024#true} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1024#true} is VALID [2018-11-23 10:21:51,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#true} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1024#true} is VALID [2018-11-23 10:21:51,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#true} is VALID [2018-11-23 10:21:51,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {1024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1024#true} is VALID [2018-11-23 10:21:51,161 INFO L256 TraceCheckUtils]: 7: Hoare triple {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {1024#true} is VALID [2018-11-23 10:21:51,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {1024#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1258#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:51,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {1024#true} is VALID [2018-11-23 10:21:51,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret13 := main(); {1024#true} is VALID [2018-11-23 10:21:51,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #67#return; {1024#true} is VALID [2018-11-23 10:21:51,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 10:21:51,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1024#true} is VALID [2018-11-23 10:21:51,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 10:21:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-23 10:21:51,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:21:51,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 10:21:51,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-23 10:21:51,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:51,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 10:21:51,329 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 10:21:51,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 10:21:51,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 10:21:51,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:21:51,330 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2018-11-23 10:21:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:52,748 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-11-23 10:21:52,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:21:52,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-23 10:21:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:21:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 10:21:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:21:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 104 transitions. [2018-11-23 10:21:52,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 104 transitions. [2018-11-23 10:21:53,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:53,029 INFO L225 Difference]: With dead ends: 88 [2018-11-23 10:21:53,029 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:21:53,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:21:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:21:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-11-23 10:21:53,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:53,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 58 states. [2018-11-23 10:21:53,076 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 58 states. [2018-11-23 10:21:53,076 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 58 states. [2018-11-23 10:21:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:53,081 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 10:21:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 10:21:53,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:53,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:53,083 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 66 states. [2018-11-23 10:21:53,083 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 66 states. [2018-11-23 10:21:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:53,090 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 10:21:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 10:21:53,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:53,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:53,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:53,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 10:21:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-11-23 10:21:53,101 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 56 [2018-11-23 10:21:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:53,101 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2018-11-23 10:21:53,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 10:21:53,103 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 10:21:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 10:21:53,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:53,105 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:53,105 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:53,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:53,106 INFO L82 PathProgramCache]: Analyzing trace with hash 423524670, now seen corresponding path program 1 times [2018-11-23 10:21:53,106 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:53,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:53,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:21:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:53,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:54,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:54,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-23 10:21:54,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:54,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:54,641 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 76 [2018-11-23 10:22:01,297 WARN L180 SmtUtils]: Spent 6.55 s on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2018-11-23 10:22:01,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:22:01,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-11-23 10:22:01,356 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:22:01,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:22:01,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:22:01,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-23 10:22:01,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:22:01,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:22:01,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:22:01,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:22:01,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:61, output treesize:37 [2018-11-23 10:22:03,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {1709#true} call ULTIMATE.init(); {1709#true} is VALID [2018-11-23 10:22:03,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {1709#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1709#true} is VALID [2018-11-23 10:22:03,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {1709#true} assume true; {1709#true} is VALID [2018-11-23 10:22:03,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1709#true} {1709#true} #67#return; {1709#true} is VALID [2018-11-23 10:22:03,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {1709#true} call #t~ret13 := main(); {1709#true} is VALID [2018-11-23 10:22:03,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {1709#true} ~N~0 := #t~nondet4;havoc #t~nondet4; {1709#true} is VALID [2018-11-23 10:22:03,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {1709#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1732#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:22:03,715 INFO L256 TraceCheckUtils]: 7: Hoare triple {1732#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret5 := max(~#x~0.base, ~#x~0.offset); {1736#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:22:03,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {1736#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1740#(and (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} is VALID [2018-11-23 10:22:03,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {1740#(and (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1744#(and (= |max_#in~x.offset| max_~x.offset) (= (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} is VALID [2018-11-23 10:22:03,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {1744#(and (= |max_#in~x.offset| max_~x.offset) (= (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1748#(and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) |max_#t~ite3|))} is VALID [2018-11-23 10:22:03,734 INFO L273 TraceCheckUtils]: 11: Hoare triple {1748#(and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) |max_#t~ite3|))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1752#(and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) max_~ret~0))} is VALID [2018-11-23 10:22:03,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {1752#(and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) max_~ret~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1756#(and (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) max_~x.offset))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) max_~x.offset))) (= |max_#in~x.offset| max_~x.offset) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:22:03,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {1756#(and (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) max_~x.offset))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) max_~x.offset))) (= |max_#in~x.offset| max_~x.offset) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= (_ bv1 32) max_~i~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1760#(and (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:22:03,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {1760#(and (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1764#(and (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:22:03,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {1764#(and (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1764#(and (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:22:03,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {1764#(and (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (= (_ bv1 32) max_~i~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1771#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) max_~i~0) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32))))))} is VALID [2018-11-23 10:22:03,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {1771#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) max_~i~0) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32))))))} assume !~bvslt32(~i~0, ~N~0); {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:03,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} #res := ~ret~0[32:0]; {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:03,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} assume true; {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:03,759 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1775#(and (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} {1732#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #71#return; {1785#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))))} is VALID [2018-11-23 10:22:03,778 INFO L273 TraceCheckUtils]: 21: Hoare triple {1785#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))))} ~ret~1 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem7, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem7;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1789#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:22:03,786 INFO L256 TraceCheckUtils]: 22: Hoare triple {1789#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))))))} call #t~ret8 := max(~#x~0.base, ~#x~0.offset); {1793#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:22:03,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {1793#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1797#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} is VALID [2018-11-23 10:22:03,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {1797#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1801#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= |max_#in~x.offset| max_~x.offset) (= (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} is VALID [2018-11-23 10:22:03,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {1801#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= |max_#in~x.offset| max_~x.offset) (= (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) |max_#t~mem1|) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (_ bv0 32)) max_~ret~0))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1805#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) |max_#t~ite3|))} is VALID [2018-11-23 10:22:03,817 INFO L273 TraceCheckUtils]: 26: Hoare triple {1805#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) |max_#t~ite3|))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1809#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) max_~ret~0))} is VALID [2018-11-23 10:22:03,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) max_~i~0) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) max_~ret~0))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1813#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32)))) max_~ret~0) (= (_ bv1 32) max_~i~0))} is VALID [2018-11-23 10:22:05,829 INFO L273 TraceCheckUtils]: 28: Hoare triple {1813#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32))))) (= |max_#in~x.offset| max_~x.offset) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= max_~x.base |max_#in~x.base|) (= ((_ sign_extend 32) (select (select |#memory_int| max_~x.base) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4294967292 32)))) max_~ret~0) (= (_ bv1 32) max_~i~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1817#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (not (bvslt (_ bv2 32) ~N~0)) (= |max_#t~mem1| (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32)))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is UNKNOWN [2018-11-23 10:22:05,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {1817#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (= max_~ret~0 ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))) (not (bvslt (_ bv2 32) ~N~0)) (= |max_#t~mem1| (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32)))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} assume !~bvslt32(~i~0, ~N~0); {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} #res := ~ret~0[32:0]; {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} assume true; {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} is VALID [2018-11-23 10:22:05,848 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1821#(and (exists ((|v_main_~#x~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32)))) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv4 32))) ((_ sign_extend 32) (select (select |#memory_int| |v_main_~#x~0.base_BEFORE_CALL_1|) (_ bv0 32)))))) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) (bvadd |max_#in~x.offset| (_ bv4 32))))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |max_#in~x.base|) |max_#in~x.offset|))))} {1789#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvslt ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|))) (bvsgt ~N~0 (_ bv1 32)) (bvslt ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))))))} #73#return; {1710#false} is VALID [2018-11-23 10:22:05,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {1710#false} ~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem9;havoc #t~mem9;~i~1 := 0bv32; {1710#false} is VALID [2018-11-23 10:22:05,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {1710#false} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem11 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem11, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem11; {1710#false} is VALID [2018-11-23 10:22:05,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {1710#false} #t~post10 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1710#false} is VALID [2018-11-23 10:22:05,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {1710#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1710#false} is VALID [2018-11-23 10:22:05,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {1710#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L256 TraceCheckUtils]: 41: Hoare triple {1710#false} call #t~ret12 := max(~#x~0.base, ~#x~0.offset); {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {1710#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {1710#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {1710#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {1710#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1710#false} is VALID [2018-11-23 10:22:05,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {1710#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1710#false} is VALID [2018-11-23 10:22:05,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {1710#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1710#false} is VALID [2018-11-23 10:22:05,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {1710#false} assume ~bvslt64(~ret~0, ~sign_extendFrom32To64(#t~mem1));call #t~mem2 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~ite3 := ~sign_extendFrom32To64(#t~mem2); {1710#false} is VALID [2018-11-23 10:22:05,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {1710#false} ~ret~0 := #t~ite3;havoc #t~mem1;havoc #t~ite3;havoc #t~mem2; {1710#false} is VALID [2018-11-23 10:22:05,851 INFO L273 TraceCheckUtils]: 50: Hoare triple {1710#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1710#false} is VALID [2018-11-23 10:22:05,852 INFO L273 TraceCheckUtils]: 51: Hoare triple {1710#false} assume !~bvslt32(~i~0, ~N~0); {1710#false} is VALID [2018-11-23 10:22:05,852 INFO L273 TraceCheckUtils]: 52: Hoare triple {1710#false} #res := ~ret~0[32:0]; {1710#false} is VALID [2018-11-23 10:22:05,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {1710#false} assume true; {1710#false} is VALID [2018-11-23 10:22:05,852 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1710#false} {1710#false} #75#return; {1710#false} is VALID [2018-11-23 10:22:05,852 INFO L273 TraceCheckUtils]: 55: Hoare triple {1710#false} ~ret5~0 := #t~ret12;havoc #t~ret12; {1710#false} is VALID [2018-11-23 10:22:05,853 INFO L273 TraceCheckUtils]: 56: Hoare triple {1710#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1710#false} is VALID [2018-11-23 10:22:05,853 INFO L273 TraceCheckUtils]: 57: Hoare triple {1710#false} assume !false; {1710#false} is VALID [2018-11-23 10:22:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 10:22:05,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:22:51,375 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 10:22:53,924 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-11-23 10:22:54,954 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-11-23 10:23:04,959 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 10:23:11,600 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 10:23:24,593 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:23:31,326 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 10:23:33,916 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 10:23:36,132 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 10:23:36,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 10:23:36,133 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 10:23:36,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:216, output treesize:1 [2018-11-23 10:23:39,003 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 10:23:39,896 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:23:40,916 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:23:41,906 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:23:43,264 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 10:23:43,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 183 [2018-11-23 10:23:43,384 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:43,395 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:43,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 174 [2018-11-23 10:23:43,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:23:43,852 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:43,856 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:43,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 121 [2018-11-23 10:23:44,118 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-11-23 10:23:44,161 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:44,167 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:44,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-23 10:23:44,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 63 [2018-11-23 10:23:44,460 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2018-11-23 10:23:44,470 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:44,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-23 10:23:44,473 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:23:44,504 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:23:44,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:23:44,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:46,853 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |max_#in~x.offset| (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:23:46,864 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:46,888 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:48,940 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |max_#in~x.offset| (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:23:51,023 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4 32)) (bvadd |max_#in~x.offset| (_ bv4 32))) [2018-11-23 10:23:51,080 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:51,121 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:51,140 INFO L303 Elim1Store]: Index analysis took 6326 ms [2018-11-23 10:23:52,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 175 treesize of output 184 [2018-11-23 10:23:59,849 WARN L180 SmtUtils]: Spent 7.69 s on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2018-11-23 10:23:59,976 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:23:59,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:01,983 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4 32)) |max_#in~x.offset|) [2018-11-23 10:24:02,024 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:04,041 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4 32)) (bvadd |max_#in~x.offset| (_ bv4 32))) [2018-11-23 10:24:04,241 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:04,278 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:04,294 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:04,296 INFO L303 Elim1Store]: Index analysis took 4432 ms [2018-11-23 10:24:04,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 214 [2018-11-23 10:24:04,735 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:04,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 193 [2018-11-23 10:24:07,397 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-11-23 10:24:07,636 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:07,637 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:09,645 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |max_#in~x.offset| (_ bv4 32)) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:24:09,655 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:09,676 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:09,682 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:09,683 INFO L303 Elim1Store]: Index analysis took 2061 ms [2018-11-23 10:24:09,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 80 [2018-11-23 10:24:09,692 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:09,794 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:10,688 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:10,690 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:10,691 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:10,697 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:10,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 126 [2018-11-23 10:24:11,171 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2018-11-23 10:24:11,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:11,218 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:11,219 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:11,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-23 10:24:11,248 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:11,308 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:11,810 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:12,114 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:14,121 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |max_#in~x.offset| (_ bv4 32)) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:24:14,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:14,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:14,155 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:14,160 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:14,162 INFO L303 Elim1Store]: Index analysis took 2386 ms [2018-11-23 10:24:14,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 177 [2018-11-23 10:24:15,381 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-11-23 10:24:15,806 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:15,806 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:17,811 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |max_#in~x.offset| (_ bv4 32)) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:24:17,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:17,827 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:17,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:17,841 INFO L303 Elim1Store]: Index analysis took 2053 ms [2018-11-23 10:24:17,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 80 [2018-11-23 10:24:17,847 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:17,989 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:18,243 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 10:24:21,110 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,151 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,169 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,210 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 10:24:21,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 179 [2018-11-23 10:24:21,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,731 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:21,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 155 [2018-11-23 10:24:26,426 WARN L180 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-11-23 10:24:26,554 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:26,554 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:26,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:26,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:26,582 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:26,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 66 [2018-11-23 10:24:26,604 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:26,758 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:27,561 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:27,564 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:27,723 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:27,726 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:27,730 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:27,748 INFO L303 Elim1Store]: Index analysis took 202 ms [2018-11-23 10:24:27,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 128 [2018-11-23 10:24:28,273 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-11-23 10:24:28,287 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:28,288 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:28,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:28,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 10:24:28,306 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:28,395 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:28,878 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:30,884 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4 32)) |max_#in~x.offset|) [2018-11-23 10:24:32,898 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |max_#in~x.offset| (_ bv4 32)) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:24:32,917 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:32,917 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:34,928 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0) (_ bv4 32)) |max_#in~x.offset|) [2018-11-23 10:24:34,951 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:34,955 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:34,974 INFO L303 Elim1Store]: Index analysis took 6111 ms [2018-11-23 10:24:35,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 148 [2018-11-23 10:24:37,517 WARN L180 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 62 DAG size of output: 38 [2018-11-23 10:24:37,746 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:37,746 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:39,753 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |max_#in~x.offset| (_ bv4 32)) (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0))) [2018-11-23 10:24:39,762 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:39,780 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:39,788 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:39,810 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:39,817 INFO L303 Elim1Store]: Index analysis took 2088 ms [2018-11-23 10:24:39,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 81 [2018-11-23 10:24:39,828 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:39,949 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:40,262 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 10:24:41,460 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:41,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:41,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:41,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:41,482 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2018-11-23 10:24:41,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 125 [2018-11-23 10:25:06,775 WARN L180 SmtUtils]: Spent 24.94 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-11-23 10:25:08,882 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:08,883 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:10,887 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_15 |max_#in~x.offset|) (select v_arrayElimArr_15 (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) [2018-11-23 10:25:12,895 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimArr_15 |max_#in~x.offset|) (select v_arrayElimArr_15 (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) [2018-11-23 10:25:12,908 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:12,910 INFO L303 Elim1Store]: Index analysis took 6055 ms [2018-11-23 10:25:12,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 10:25:12,914 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:15,115 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:15,116 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:17,122 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimArr_15 |max_#in~x.offset|) (select v_arrayElimArr_15 (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) [2018-11-23 10:25:19,169 WARN L687 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_arrayElimArr_15 |max_#in~x.offset|) (select v_arrayElimArr_15 (bvadd max_~x.offset (bvmul (_ bv4 32) max_~i~0)))) [2018-11-23 10:25:19,182 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:19,184 INFO L303 Elim1Store]: Index analysis took 6189 ms [2018-11-23 10:25:19,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2018-11-23 10:25:19,193 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:19,207 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:19,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:19,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:19,214 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:25:19,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-11-23 10:25:19,224 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:19,370 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:19,441 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:25:20,317 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 18 dim-0 vars, and 7 xjuncts. [2018-11-23 10:25:21,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2018-11-23 10:25:22,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2018-11-23 10:25:22,182 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 1 variables, input treesize:228, output treesize:385