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/avg_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:21:16,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:21:16,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:21:16,385 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:21:16,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:21:16,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:21:16,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:21:16,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:21:16,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:21:16,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:21:16,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:21:16,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:21:16,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:21:16,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:21:16,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:21:16,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:21:16,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:21:16,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:21:16,424 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:21:16,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:21:16,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:21:16,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:21:16,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:21:16,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:21:16,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:21:16,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:21:16,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:21:16,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:21:16,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:21:16,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:21:16,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:21:16,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:21:16,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:21:16,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:21:16,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:21:16,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:21:16,451 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:16,478 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:21:16,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:21:16,480 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:21:16,480 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:21:16,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:21:16,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:21:16,481 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:21:16,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:21:16,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:21:16,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:21:16,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:21:16,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:21:16,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:21:16,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:21:16,483 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:21:16,483 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:21:16,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:21:16,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:21:16,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:21:16,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:21:16,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:21:16,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:21:16,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:21:16,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:21:16,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:21:16,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:21:16,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:21:16,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:21:16,486 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:21:16,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:21:16,486 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:21:16,487 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:21:16,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:21:16,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:21:16,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:21:16,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:21:16,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:21:16,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:21:16,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 10:21:16,649 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee215bf1/848cffff7ecc4d16b10a4c447755fd7b/FLAG758d8f190 [2018-11-23 10:21:17,113 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:21:17,114 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg_true-unreach-call_true-termination.i [2018-11-23 10:21:17,120 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee215bf1/848cffff7ecc4d16b10a4c447755fd7b/FLAG758d8f190 [2018-11-23 10:21:17,479 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee215bf1/848cffff7ecc4d16b10a4c447755fd7b [2018-11-23 10:21:17,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:21:17,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:21:17,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:17,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:21:17,496 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:21:17,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:17" (1/1) ... [2018-11-23 10:21:17,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652b622c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:17, skipping insertion in model container [2018-11-23 10:21:17,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:17" (1/1) ... [2018-11-23 10:21:17,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:21:17,537 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:21:17,774 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:17,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:21:17,839 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:17,864 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:21:17,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:17 WrapperNode [2018-11-23 10:21:17,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:17,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:17,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:21:17,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:21:17,878 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:17" (1/1) ... [2018-11-23 10:21:17,893 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:17" (1/1) ... [2018-11-23 10:21:17,902 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:17,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:21:17,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:21:17,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:21:17,914 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:17" (1/1) ... [2018-11-23 10:21:17,915 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:17" (1/1) ... [2018-11-23 10:21:17,921 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:17" (1/1) ... [2018-11-23 10:21:17,922 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:17" (1/1) ... [2018-11-23 10:21:17,956 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:17" (1/1) ... [2018-11-23 10:21:17,973 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:17" (1/1) ... [2018-11-23 10:21:17,979 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:17" (1/1) ... [2018-11-23 10:21:17,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:21:17,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:21:17,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:21:17,987 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:21:17,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:17" (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:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:21:18,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:21:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2018-11-23 10:21:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2018-11-23 10:21:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:21:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:21:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:21:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:21:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:21:18,155 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:21:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:21:18,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:21:19,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:21:19,094 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:21:19,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:19 BoogieIcfgContainer [2018-11-23 10:21:19,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:21:19,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:21:19,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:21:19,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:21:19,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:21:17" (1/3) ... [2018-11-23 10:21:19,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24909369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:19, skipping insertion in model container [2018-11-23 10:21:19,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:17" (2/3) ... [2018-11-23 10:21:19,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24909369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:19, skipping insertion in model container [2018-11-23 10:21:19,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:19" (3/3) ... [2018-11-23 10:21:19,104 INFO L112 eAbstractionObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2018-11-23 10:21:19,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:21:19,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:21:19,144 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:21:19,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:21:19,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:21:19,186 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:21:19,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:21:19,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:21:19,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:21:19,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:21:19,187 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:21:19,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:21:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:21:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:21:19,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:19,217 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:19,220 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:19,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:19,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1931873834, now seen corresponding path program 1 times [2018-11-23 10:21:19,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:19,234 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:19,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:20,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:21,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:21:21,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {34#true} is VALID [2018-11-23 10:21:21,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:21:21,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 10:21:21,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 10:21:21,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 10:21:21,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#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; {57#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:21,200 INFO L256 TraceCheckUtils]: 7: Hoare triple {57#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {57#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:21,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(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; {64#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:21,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:21:21,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:21:21,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:21,206 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {57#(bvsgt ~N~0 (_ bv1 32))} #64#return; {35#false} is VALID [2018-11-23 10:21:21,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:21:21,206 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:21:21,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#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; {35#false} is VALID [2018-11-23 10:21:21,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:21:21,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:21:21,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:21,208 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 10:21:21,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {35#false} is VALID [2018-11-23 10:21:21,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {35#false} is VALID [2018-11-23 10:21:21,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {35#false} is VALID [2018-11-23 10:21:21,211 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:21:21,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#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; {35#false} is VALID [2018-11-23 10:21:21,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:21:21,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:21:21,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:21,213 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 10:21:21,213 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 10:21:21,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 10:21:21,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:21:21,221 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:21,221 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:21,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:21,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:21:21,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:21:21,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:21,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:21:21,532 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:21,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:21:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:21:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:21:21,545 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-23 10:21:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:22,673 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 10:21:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:21:22,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:21:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:21:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 10:21:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:21:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 10:21:22,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 10:21:23,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:23,142 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:21:23,142 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:21:23,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:21:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:21:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 10:21:23,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:23,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 10:21:23,213 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 10:21:23,213 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 10:21:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:23,220 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:21:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:21:23,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:23,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:23,222 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 10:21:23,222 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 10:21:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:23,227 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:21:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:21:23,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:23,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:23,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:23,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:21:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 10:21:23,234 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 10:21:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:23,235 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 10:21:23,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:21:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:21:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 10:21:23,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:23,237 INFO L402 BasicCegarLoop]: trace histogram [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:23,238 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:23,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:23,239 INFO L82 PathProgramCache]: Analyzing trace with hash -334011672, now seen corresponding path program 1 times [2018-11-23 10:21:23,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:23,240 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:23,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:24,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:24,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 10:21:24,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {301#true} is VALID [2018-11-23 10:21:24,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:21:24,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2018-11-23 10:21:24,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2018-11-23 10:21:24,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {301#true} is VALID [2018-11-23 10:21:24,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#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; {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:24,936 INFO L256 TraceCheckUtils]: 7: Hoare triple {324#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:24,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(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; {331#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:24,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(and (= (_ bv0 32) avg_~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);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {331#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:24,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {338#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:21:24,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:21:24,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:21:24,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:21:24,973 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {302#false} {324#(bvsgt ~N~0 (_ bv1 32))} #64#return; {302#false} is VALID [2018-11-23 10:21:24,974 INFO L273 TraceCheckUtils]: 15: Hoare triple {302#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {302#false} is VALID [2018-11-23 10:21:24,974 INFO L256 TraceCheckUtils]: 16: Hoare triple {302#false} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 10:21:24,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {302#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; {302#false} is VALID [2018-11-23 10:21:24,975 INFO L273 TraceCheckUtils]: 18: Hoare triple {302#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {302#false} is VALID [2018-11-23 10:21:24,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {302#false} is VALID [2018-11-23 10:21:24,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {302#false} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:21:24,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:21:24,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:21:24,976 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {302#false} {302#false} #66#return; {302#false} is VALID [2018-11-23 10:21:24,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {302#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {302#false} is VALID [2018-11-23 10:21:24,982 INFO L273 TraceCheckUtils]: 25: Hoare triple {302#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {302#false} is VALID [2018-11-23 10:21:24,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {302#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {302#false} is VALID [2018-11-23 10:21:24,983 INFO L256 TraceCheckUtils]: 27: Hoare triple {302#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 10:21:24,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {302#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; {302#false} is VALID [2018-11-23 10:21:24,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {302#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {302#false} is VALID [2018-11-23 10:21:24,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {302#false} is VALID [2018-11-23 10:21:24,985 INFO L273 TraceCheckUtils]: 31: Hoare triple {302#false} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:21:24,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:21:24,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:21:24,986 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {302#false} {302#false} #68#return; {302#false} is VALID [2018-11-23 10:21:24,986 INFO L273 TraceCheckUtils]: 35: Hoare triple {302#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {302#false} is VALID [2018-11-23 10:21:24,986 INFO L273 TraceCheckUtils]: 36: Hoare triple {302#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {302#false} is VALID [2018-11-23 10:21:24,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 10:21:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 10:21:24,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:25,505 INFO L273 TraceCheckUtils]: 37: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 10:21:25,505 INFO L273 TraceCheckUtils]: 36: Hoare triple {302#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {302#false} is VALID [2018-11-23 10:21:25,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {302#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {302#false} is VALID [2018-11-23 10:21:25,506 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {301#true} {302#false} #68#return; {302#false} is VALID [2018-11-23 10:21:25,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:21:25,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {301#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {301#true} is VALID [2018-11-23 10:21:25,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {301#true} assume !~bvslt32(~i~0, ~N~0); {301#true} is VALID [2018-11-23 10:21:25,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {301#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {301#true} is VALID [2018-11-23 10:21:25,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {301#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {301#true} is VALID [2018-11-23 10:21:25,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {301#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; {301#true} is VALID [2018-11-23 10:21:25,508 INFO L256 TraceCheckUtils]: 27: Hoare triple {302#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:21:25,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {302#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {302#false} is VALID [2018-11-23 10:21:25,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {302#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {302#false} is VALID [2018-11-23 10:21:25,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {302#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {302#false} is VALID [2018-11-23 10:21:25,509 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {301#true} {302#false} #66#return; {302#false} is VALID [2018-11-23 10:21:25,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:21:25,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {301#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {301#true} is VALID [2018-11-23 10:21:25,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {301#true} assume !~bvslt32(~i~0, ~N~0); {301#true} is VALID [2018-11-23 10:21:25,510 INFO L273 TraceCheckUtils]: 19: Hoare triple {301#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {301#true} is VALID [2018-11-23 10:21:25,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {301#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {301#true} is VALID [2018-11-23 10:21:25,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {301#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; {301#true} is VALID [2018-11-23 10:21:25,511 INFO L256 TraceCheckUtils]: 16: Hoare triple {302#false} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:21:25,511 INFO L273 TraceCheckUtils]: 15: Hoare triple {302#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {302#false} is VALID [2018-11-23 10:21:25,513 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {492#(not (bvsgt ~N~0 (_ bv1 32)))} {324#(bvsgt ~N~0 (_ bv1 32))} #64#return; {302#false} is VALID [2018-11-23 10:21:25,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {492#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:25,517 INFO L273 TraceCheckUtils]: 12: Hoare triple {492#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:25,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {502#(or (bvslt avg_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:25,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {506#(or (bvslt (bvadd avg_~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; {502#(or (bvslt avg_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:25,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {506#(or (bvslt (bvadd avg_~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);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {506#(or (bvslt (bvadd avg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:25,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#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; {506#(or (bvslt (bvadd avg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:21:25,540 INFO L256 TraceCheckUtils]: 7: Hoare triple {324#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:21:25,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#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; {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:25,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {301#true} is VALID [2018-11-23 10:21:25,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2018-11-23 10:21:25,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2018-11-23 10:21:25,557 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:21:25,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {301#true} is VALID [2018-11-23 10:21:25,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 10:21:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 10:21:25,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:25,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 10:21:25,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:21:25,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:25,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:21:25,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:25,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:21:25,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:21:25,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:21:25,938 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-11-23 10:21:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,406 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 10:21:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:21:27,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:21:27,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:21:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:21:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:21:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:21:27,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2018-11-23 10:21:27,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:27,690 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:21:27,691 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:21:27,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 10:21:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:21:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 10:21:27,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:27,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 10:21:27,711 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 10:21:27,712 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 10:21:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,716 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:21:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:21:27,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:27,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:27,718 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 10:21:27,718 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 10:21:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,721 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:21:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:21:27,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:27,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:27,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:27,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:21:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 10:21:27,726 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 38 [2018-11-23 10:21:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:27,726 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 10:21:27,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:21:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 10:21:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:21:27,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:27,729 INFO L402 BasicCegarLoop]: trace histogram [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:27,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:27,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1171787482, now seen corresponding path program 2 times [2018-11-23 10:21:27,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:27,730 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:27,755 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:21:29,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:21:29,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:29,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:30,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 10:21:30,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {701#true} is VALID [2018-11-23 10:21:30,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:21:30,042 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #60#return; {701#true} is VALID [2018-11-23 10:21:30,042 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret11 := main(); {701#true} is VALID [2018-11-23 10:21:30,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {701#true} is VALID [2018-11-23 10:21:30,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#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; {724#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:30,046 INFO L256 TraceCheckUtils]: 7: Hoare triple {724#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {724#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:21:30,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {724#(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; {731#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(and (= (_ bv0 32) avg_~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);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {731#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {731#(and (= (_ bv0 32) avg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {738#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:21:30,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {738#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {738#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:21:30,053 INFO L273 TraceCheckUtils]: 12: Hoare triple {738#(and (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {745#(and (= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {745#(and (= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,076 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {724#(bvsgt ~N~0 (_ bv1 32))} #64#return; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,083 INFO L256 TraceCheckUtils]: 18: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {749#(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; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {749#(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);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {749#(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; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,090 INFO L273 TraceCheckUtils]: 22: Hoare triple {749#(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);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {749#(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; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,092 INFO L273 TraceCheckUtils]: 26: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,094 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:21:30,095 INFO L273 TraceCheckUtils]: 28: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-23 10:21:30,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#(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)); {702#false} is VALID [2018-11-23 10:21:30,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {702#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {702#false} is VALID [2018-11-23 10:21:30,098 INFO L256 TraceCheckUtils]: 31: Hoare triple {702#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {702#false} is VALID [2018-11-23 10:21:30,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {702#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; {702#false} is VALID [2018-11-23 10:21:30,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {702#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {702#false} is VALID [2018-11-23 10:21:30,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {702#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {702#false} is VALID [2018-11-23 10:21:30,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {702#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {702#false} is VALID [2018-11-23 10:21:30,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {702#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {702#false} is VALID [2018-11-23 10:21:30,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {702#false} assume !~bvslt32(~i~0, ~N~0); {702#false} is VALID [2018-11-23 10:21:30,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {702#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {702#false} is VALID [2018-11-23 10:21:30,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {702#false} assume true; {702#false} is VALID [2018-11-23 10:21:30,101 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {702#false} {702#false} #68#return; {702#false} is VALID [2018-11-23 10:21:30,101 INFO L273 TraceCheckUtils]: 41: Hoare triple {702#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {702#false} is VALID [2018-11-23 10:21:30,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {702#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {702#false} is VALID [2018-11-23 10:21:30,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 10:21:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:21:30,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:30,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 10:21:30,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {702#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {702#false} is VALID [2018-11-23 10:21:30,623 INFO L273 TraceCheckUtils]: 41: Hoare triple {702#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {702#false} is VALID [2018-11-23 10:21:30,623 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {701#true} {702#false} #68#return; {702#false} is VALID [2018-11-23 10:21:30,623 INFO L273 TraceCheckUtils]: 39: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:21:30,623 INFO L273 TraceCheckUtils]: 38: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:21:30,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:21:30,624 INFO L273 TraceCheckUtils]: 36: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,624 INFO L273 TraceCheckUtils]: 35: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,625 INFO L273 TraceCheckUtils]: 34: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,625 INFO L273 TraceCheckUtils]: 33: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,625 INFO L273 TraceCheckUtils]: 32: Hoare triple {701#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; {701#true} is VALID [2018-11-23 10:21:30,626 INFO L256 TraceCheckUtils]: 31: Hoare triple {702#false} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:21:30,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {702#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {702#false} is VALID [2018-11-23 10:21:30,627 INFO L273 TraceCheckUtils]: 29: Hoare triple {883#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {702#false} is VALID [2018-11-23 10:21:30,629 INFO L273 TraceCheckUtils]: 28: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {883#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:30,630 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {701#true} {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #66#return; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:30,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:21:30,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:21:30,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:21:30,631 INFO L273 TraceCheckUtils]: 23: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,631 INFO L273 TraceCheckUtils]: 20: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {701#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; {701#true} is VALID [2018-11-23 10:21:30,632 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:21:30,634 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:30,637 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {701#true} {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #64#return; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:30,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:21:30,637 INFO L273 TraceCheckUtils]: 14: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:21:30,637 INFO L273 TraceCheckUtils]: 13: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:21:30,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:21:30,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:21:30,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {701#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; {701#true} is VALID [2018-11-23 10:21:30,639 INFO L256 TraceCheckUtils]: 7: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:21:30,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#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; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:21:30,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {701#true} is VALID [2018-11-23 10:21:30,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret11 := main(); {701#true} is VALID [2018-11-23 10:21:30,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #60#return; {701#true} is VALID [2018-11-23 10:21:30,642 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:21:30,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {701#true} is VALID [2018-11-23 10:21:30,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 10:21:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 10:21:30,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:21:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 10:21:30,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:21:30,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:30,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 10:21:31,039 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:31,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 10:21:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 10:21:31,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:21:31,041 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-11-23 10:21:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,361 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-23 10:21:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:21:33,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:21:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:21:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:21:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:21:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:21:33,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 83 transitions. [2018-11-23 10:21:33,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:33,754 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:21:33,754 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:21:33,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 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:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:21:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-23 10:21:33,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:33,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-23 10:21:33,791 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-23 10:21:33,791 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-23 10:21:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,796 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:21:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:21:33,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:33,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:33,798 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-23 10:21:33,799 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-23 10:21:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,803 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:21:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:21:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:33,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:33,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:33,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:21:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 10:21:33,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 44 [2018-11-23 10:21:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:33,810 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 10:21:33,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 10:21:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 10:21:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:21:33,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:33,813 INFO L402 BasicCegarLoop]: trace histogram [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:33,813 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:33,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1051431772, now seen corresponding path program 1 times [2018-11-23 10:21:33,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:33,814 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:33,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:22:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:23:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 10:23:01,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:23:05,003 WARN L180 SmtUtils]: Spent 818.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 10:23:10,854 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 10:23:11,015 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-11-23 10:23:11,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-11-23 10:23:11,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:23:11,252 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-11-23 10:23:11,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 10:23:11,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:23:11,467 INFO L303 Elim1Store]: Index analysis took 198 ms [2018-11-23 10:23:11,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-23 10:23:11,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:23:12,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:12,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:13,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:13,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:60, output treesize:34 [2018-11-23 10:23:15,716 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:23:15,717 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|]. (let ((.cse2 (bvadd |main_~#x~0.offset| (_ bv4 32))) (.cse0 (select |v_#memory_int_16| |main_~#x~0.base|))) (let ((.cse3 (select .cse0 |main_~#x~0.offset|)) (.cse1 (select .cse0 .cse2))) (and (= (store |v_#memory_int_16| |main_~#x~0.base| (store (store .cse0 |main_~#x~0.offset| .cse1) .cse2 .cse3)) |#memory_int|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) .cse3) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) .cse1)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32))))) [2018-11-23 10:23:15,717 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (let ((.cse0 (select |#memory_int| |main_~#x~0.base|))) (bvadd ((_ sign_extend 32) (select .cse0 (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select .cse0 |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv0 32)))) ((_ sign_extend 32) ~N~0))) main_~ret~1)) [2018-11-23 10:23:22,490 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 10:23:37,664 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 10:23:45,509 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 10:23:45,839 INFO L303 Elim1Store]: Index analysis took 202 ms [2018-11-23 10:23:45,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 56 [2018-11-23 10:23:45,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:23:46,112 INFO L303 Elim1Store]: Index analysis took 259 ms [2018-11-23 10:23:46,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 56 treesize of output 58 [2018-11-23 10:23:46,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:23:47,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:48,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:23:48,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:62 [2018-11-23 10:23:50,752 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:23:50,752 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|]. (let ((.cse0 (select |v_#memory_int_17| |main_~#x~0.base|))) (let ((.cse1 (select .cse0 (bvadd |main_~#x~0.offset| (_ bv4 32)))) (.cse2 (select .cse0 |main_~#x~0.offset|))) (let ((.cse3 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) .cse1) ((_ sign_extend 32) .cse2) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))))) (and (= (store |v_#memory_int_17| |main_~#x~0.base| (store .cse0 |main_~#x~0.offset| .cse1)) |#memory_int|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= .cse2 main_~temp~0) (= .cse3 main_~ret~1) (= .cse3 main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))))) [2018-11-23 10:23:50,752 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#x~0.offset| (_ bv4 32))))) (let ((.cse2 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) .cse0) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0))))) (and (= |main_~#x~0.offset| (_ bv0 32)) (= .cse0 (select .cse1 |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 .cse2) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 .cse2))))) [2018-11-23 10:24:02,330 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 10:24:02,589 INFO L303 Elim1Store]: Index analysis took 221 ms [2018-11-23 10:24:02,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-11-23 10:24:02,694 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:24:02,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:24:02,717 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:02,884 INFO L303 Elim1Store]: Index analysis took 286 ms [2018-11-23 10:24:02,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 71 [2018-11-23 10:24:02,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:24:04,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:24:05,923 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:24:05,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:63 [2018-11-23 10:24:08,039 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:24:08,040 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~temp~0]. (let ((.cse1 (select |v_#memory_int_18| |main_~#x~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#x~0.offset| (_ bv4 32))))) (let ((.cse2 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) .cse0) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0))))) (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= .cse0 (select .cse1 |main_~#x~0.offset|)) (= (store |v_#memory_int_18| |main_~#x~0.base| (store .cse1 (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)) main_~temp~0)) |#memory_int|) (= main_~ret~1 .cse2) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 .cse2))))) [2018-11-23 10:24:08,040 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 ((_ extract 31 0) (bvsdiv (let ((.cse1 (select |#memory_int| |main_~#x~0.base|))) (bvadd ((_ sign_extend 32) (select .cse1 |main_~#x~0.offset|)) ((_ sign_extend 32) (select .cse1 (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32)))) ((_ sign_extend 32) ~N~0))))) (and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret~1 .cse0) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 .cse0))) [2018-11-23 10:24:28,451 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 10:24:29,515 INFO L303 Elim1Store]: Index analysis took 759 ms [2018-11-23 10:24:29,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-11-23 10:24:30,216 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:24:30,951 INFO L303 Elim1Store]: Index analysis took 1422 ms [2018-11-23 10:24:30,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-11-23 10:24:30,960 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:24:31,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:33,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:24:33,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:47 [2018-11-23 10:24:35,417 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:24:35,418 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#x~0.base|, ~N~0]. (let ((.cse3 (select |#memory_int| |main_~#x~0.base|))) (let ((.cse1 ((_ sign_extend 32) (select .cse3 (_ bv0 32)))) (.cse2 ((_ sign_extend 32) (_ bv0 32))) (.cse4 ((_ sign_extend 32) ~N~0))) (let ((.cse0 ((_ extract 31 0) (bvsdiv (bvadd .cse1 .cse2 ((_ sign_extend 32) (select .cse3 (bvadd (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32))))) .cse4)))) (and (= main_~ret2~0 .cse0) (= main_~ret~1 .cse0) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvsdiv (bvadd .cse1 .cse2 ((_ sign_extend 32) (select .cse3 (_ bv4 32)))) .cse4)) |main_#t~ret10|) (bvsgt ~N~0 (_ bv1 32)))))) [2018-11-23 10:24:35,418 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_9, v_arrayElimCell_8, ~N~0]. (let ((.cse0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))))) (and (= main_~ret2~0 .cse0) (= .cse0 main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= |main_#t~ret10| .cse0) (bvsgt ~N~0 (_ bv1 32)))) [2018-11-23 10:24:40,921 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 10:24:46,431 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 10:24:46,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2018-11-23 10:24:46,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {1262#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1262#true} is VALID [2018-11-23 10:24:46,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2018-11-23 10:24:46,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #60#return; {1262#true} is VALID [2018-11-23 10:24:46,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {1262#true} call #t~ret11 := main(); {1262#true} is VALID [2018-11-23 10:24:46,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {1262#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1262#true} is VALID [2018-11-23 10:24:46,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {1262#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; {1285#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:46,539 INFO L256 TraceCheckUtils]: 7: Hoare triple {1285#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret3 := avg(~#x~0.base, ~#x~0.offset); {1289#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:24:46,539 INFO L273 TraceCheckUtils]: 8: Hoare triple {1289#(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; {1293#(and (= |avg_#in~x.base| avg_~x.base) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:46,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {1293#(and (= |avg_#in~x.base| avg_~x.base) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1297#(and (= |avg_#in~x.base| avg_~x.base) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:46,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {1297#(and (= |avg_#in~x.base| avg_~x.base) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1301#(and (= |avg_#in~x.base| avg_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) avg_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0))} is VALID [2018-11-23 10:24:46,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {1301#(and (= |avg_#in~x.base| avg_~x.base) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) avg_~x.offset)) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1305#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:24:46,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {1305#(and (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1309#(and (= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32))))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:46,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {1309#(and (= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32))))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:46,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:24:46,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} assume true; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:24:46,823 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} {1285#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #64#return; {1324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |main_#t~ret3|))} is VALID [2018-11-23 10:24:48,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {1324#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |main_#t~ret3|))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1328#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1))} is UNKNOWN [2018-11-23 10:24:48,868 INFO L256 TraceCheckUtils]: 18: Hoare triple {1328#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1))} call #t~ret6 := avg(~#x~0.base, ~#x~0.offset); {1332#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:48,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {1332#(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; {1336#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:48,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {1336#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1340#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:48,875 INFO L273 TraceCheckUtils]: 21: Hoare triple {1340#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1344#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:24:50,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {1344#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is UNKNOWN [2018-11-23 10:24:50,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:50,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:50,988 INFO L273 TraceCheckUtils]: 25: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:24:51,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} assume true; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:24:53,078 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} {1328#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1))} #66#return; {1363#(and (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |main_#t~ret6|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1))} is UNKNOWN [2018-11-23 10:24:53,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {1363#(and (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |main_#t~ret6|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1367#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-23 10:24:55,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {1367#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ 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|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (= main_~i~1 (_ bv0 32)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem9, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem9; {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} is UNKNOWN [2018-11-23 10:24:55,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} #t~post8 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} is VALID [2018-11-23 10:24:55,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} is VALID [2018-11-23 10:24:57,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {1371#(and (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) main_~temp~0)) ((_ sign_extend 32) ~N~0)))))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1381#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))))} is UNKNOWN [2018-11-23 10:24:57,450 INFO L256 TraceCheckUtils]: 33: Hoare triple {1381#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))))} call #t~ret10 := avg(~#x~0.base, ~#x~0.offset); {1332#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:57,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {1332#(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; {1336#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:57,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {1336#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= ((_ sign_extend 32) (_ bv0 32)) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1340#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} is VALID [2018-11-23 10:24:57,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {1340#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (_ bv0 32) avg_~i~0) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1344#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:24:59,507 INFO L273 TraceCheckUtils]: 37: Hoare triple {1344#(and (= |avg_#in~x.base| avg_~x.base) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd ((_ sign_extend 32) (select (select |#memory_int| avg_~x.base) (bvadd avg_~x.offset (bvmul (_ bv4 32) avg_~i~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) avg_~ret~0) (bvsgt ~N~0 (_ bv1 32)) (= avg_~x.offset |avg_#in~x.offset|) (= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is UNKNOWN [2018-11-23 10:24:59,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:59,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:24:59,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {1313#(and (= avg_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32)))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:24:59,597 INFO L273 TraceCheckUtils]: 41: Hoare triple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} assume true; {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} is VALID [2018-11-23 10:25:01,742 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1317#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) (bvadd |avg_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |avg_#in~x.base|) |avg_#in~x.offset|)) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) |avg_#res|))} {1381#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret~1 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32)) (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ 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| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))))} #68#return; {1412#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= |main_#t~ret10| ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32))))} is UNKNOWN [2018-11-23 10:25:01,744 INFO L273 TraceCheckUtils]: 43: Hoare triple {1412#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= |main_#t~ret10| ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32))))} ~ret5~0 := #t~ret10;havoc #t~ret10; {1416#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret5~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:25:01,835 INFO L273 TraceCheckUtils]: 44: Hoare triple {1416#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (~N~0 (_ BitVec 32))) (and (= main_~ret2~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (= ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0))) main_~ret~1) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret5~0 ((_ extract 31 0) (bvsdiv (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) ~N~0)))) (bvsgt ~N~0 (_ bv1 32))))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1263#false} is VALID [2018-11-23 10:25:01,836 INFO L273 TraceCheckUtils]: 45: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2018-11-23 10:25:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:25:01,857 INFO L316 TraceCheckSpWp]: Computing backward predicates...