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/avg05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:21:09,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:21:09,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:21:09,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:21:09,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:21:09,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:21:09,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:21:09,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:21:09,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:21:09,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:21:09,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:21:09,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:21:09,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:21:09,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:21:09,834 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:21:09,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:21:09,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:21:09,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:21:09,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:21:09,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:21:09,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:21:09,854 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:21:09,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:21:09,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:21:09,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:21:09,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:21:09,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:21:09,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:21:09,860 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:21:09,861 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:21:09,861 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:21:09,862 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:21:09,862 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:21:09,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:21:09,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:21:09,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:21:09,864 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:09,889 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:21:09,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:21:09,890 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:21:09,891 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:21:09,894 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:21:09,895 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:21:09,895 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:21:09,895 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:21:09,895 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:21:09,895 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:21:09,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:21:09,897 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:21:09,897 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:21:09,897 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:21:09,898 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:21:09,898 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:21:09,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:21:09,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:21:09,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:21:09,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:21:09,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:21:09,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:21:09,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:21:09,900 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:21:09,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:21:09,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:21:09,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:21:09,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:21:09,901 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:21:09,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:21:09,901 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:21:09,901 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:21:09,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:21:09,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:21:09,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:21:09,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:21:09,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:21:09,982 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:21:09,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-23 10:21:10,053 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dcb5e0f/6d367fa0962a4e43bd84a4b88f97562e/FLAG0593d4c9e [2018-11-23 10:21:10,551 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:21:10,552 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/avg05_true-unreach-call_true-termination.i [2018-11-23 10:21:10,558 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dcb5e0f/6d367fa0962a4e43bd84a4b88f97562e/FLAG0593d4c9e [2018-11-23 10:21:10,916 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dcb5e0f/6d367fa0962a4e43bd84a4b88f97562e [2018-11-23 10:21:10,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:21:10,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:21:10,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:10,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:21:10,934 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:21:10,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:10" (1/1) ... [2018-11-23 10:21:10,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6213ad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:10, skipping insertion in model container [2018-11-23 10:21:10,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:21:10" (1/1) ... [2018-11-23 10:21:10,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:21:10,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:21:11,213 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:11,228 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:21:11,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:21:11,287 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:21:11,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:11 WrapperNode [2018-11-23 10:21:11,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:21:11,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:11,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:21:11,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:21:11,297 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:11" (1/1) ... [2018-11-23 10:21:11,308 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:11" (1/1) ... [2018-11-23 10:21:11,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:21:11,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:21:11,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:21:11,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:21:11,326 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:11" (1/1) ... [2018-11-23 10:21:11,326 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:11" (1/1) ... [2018-11-23 10:21:11,329 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:11" (1/1) ... [2018-11-23 10:21:11,330 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:11" (1/1) ... [2018-11-23 10:21:11,346 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:11" (1/1) ... [2018-11-23 10:21:11,353 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:11" (1/1) ... [2018-11-23 10:21:11,355 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:11" (1/1) ... [2018-11-23 10:21:11,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:21:11,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:21:11,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:21:11,359 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:21:11,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:11" (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:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:21:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:21:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure avg [2018-11-23 10:21:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure avg [2018-11-23 10:21:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:21:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:21:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:21:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:21:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:21:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:21:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:21:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:21:12,229 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:21:12,230 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:21:12,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:12 BoogieIcfgContainer [2018-11-23 10:21:12,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:21:12,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:21:12,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:21:12,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:21:12,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:21:10" (1/3) ... [2018-11-23 10:21:12,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234952c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:12, skipping insertion in model container [2018-11-23 10:21:12,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:21:11" (2/3) ... [2018-11-23 10:21:12,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234952c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:21:12, skipping insertion in model container [2018-11-23 10:21:12,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:21:12" (3/3) ... [2018-11-23 10:21:12,240 INFO L112 eAbstractionObserver]: Analyzing ICFG avg05_true-unreach-call_true-termination.i [2018-11-23 10:21:12,250 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:21:12,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:21:12,274 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:21:12,306 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:21:12,307 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:21:12,307 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:21:12,307 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:21:12,308 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:21:12,308 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:21:12,308 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:21:12,308 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:21:12,308 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:21:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:21:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:21:12,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:12,336 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:12,338 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:12,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:12,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 10:21:12,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:12,350 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:12,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:12,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:12,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:21:12,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-23 10:21:12,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:21:12,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 10:21:12,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 10:21:12,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {34#true} is VALID [2018-11-23 10:21:12,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 10:21:12,933 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:21:12,934 INFO L273 TraceCheckUtils]: 8: 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:12,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !~bvslt32(~i~0, 5bv32); {35#false} is VALID [2018-11-23 10:21:12,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {35#false} is VALID [2018-11-23 10:21:12,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:12,935 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {35#false} #70#return; {35#false} is VALID [2018-11-23 10:21:12,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:21:12,936 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:21:12,936 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:12,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !~bvslt32(~i~0, 5bv32); {35#false} is VALID [2018-11-23 10:21:12,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {35#false} is VALID [2018-11-23 10:21:12,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:12,937 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #72#return; {35#false} is VALID [2018-11-23 10:21:12,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {35#false} is VALID [2018-11-23 10:21:12,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:21:12,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:21:12,939 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:21:12,939 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:12,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !~bvslt32(~i~0, 5bv32); {35#false} is VALID [2018-11-23 10:21:12,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {35#false} is VALID [2018-11-23 10:21:12,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:21:12,940 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #74#return; {35#false} is VALID [2018-11-23 10:21:12,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 10:21:12,941 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:12,941 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:21:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:12,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:12,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:12,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:21:12,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:21:12,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:12,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:21:13,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:13,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:21:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:21:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:21:13,195 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 10:21:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:13,543 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 10:21:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:21:13,543 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:21:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:21:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:21:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:21:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:21:13,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 10:21:14,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:14,032 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:21:14,032 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:21:14,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:21:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:21:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:21:14,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:14,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:21:14,086 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:21:14,086 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:21:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:14,093 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:21:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:21:14,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:14,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:14,097 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:21:14,097 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:21:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:14,104 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:21:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:21:14,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:14,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:14,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:14,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:21:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 10:21:14,111 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 10:21:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:14,111 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 10:21:14,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:21:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:21:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:21:14,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:14,114 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:14,114 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:14,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:14,115 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 10:21:14,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:14,116 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:14,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:15,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:15,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 10:21:15,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {291#true} is VALID [2018-11-23 10:21:15,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 10:21:15,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #66#return; {291#true} is VALID [2018-11-23 10:21:15,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret12 := main(); {291#true} is VALID [2018-11-23 10:21:15,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {311#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:21:15,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(= main_~i~1 (_ bv0 32))} assume !~bvslt32(~i~1, 5bv32); {292#false} is VALID [2018-11-23 10:21:15,549 INFO L256 TraceCheckUtils]: 7: Hoare triple {292#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:21:15,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:21:15,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:21:15,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {292#false} is VALID [2018-11-23 10:21:15,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:21:15,551 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {292#false} {292#false} #70#return; {292#false} is VALID [2018-11-23 10:21:15,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {292#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {292#false} is VALID [2018-11-23 10:21:15,552 INFO L256 TraceCheckUtils]: 14: Hoare triple {292#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:21:15,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:21:15,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:21:15,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {292#false} is VALID [2018-11-23 10:21:15,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:21:15,553 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {292#false} {292#false} #72#return; {292#false} is VALID [2018-11-23 10:21:15,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {292#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {292#false} is VALID [2018-11-23 10:21:15,554 INFO L273 TraceCheckUtils]: 21: Hoare triple {292#false} assume !~bvslt32(~i~2, 4bv32); {292#false} is VALID [2018-11-23 10:21:15,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {292#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {292#false} is VALID [2018-11-23 10:21:15,555 INFO L256 TraceCheckUtils]: 23: Hoare triple {292#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:21:15,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {292#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; {292#false} is VALID [2018-11-23 10:21:15,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:21:15,556 INFO L273 TraceCheckUtils]: 26: Hoare triple {292#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {292#false} is VALID [2018-11-23 10:21:15,556 INFO L273 TraceCheckUtils]: 27: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:21:15,556 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {292#false} {292#false} #74#return; {292#false} is VALID [2018-11-23 10:21:15,557 INFO L273 TraceCheckUtils]: 29: Hoare triple {292#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {292#false} is VALID [2018-11-23 10:21:15,557 INFO L273 TraceCheckUtils]: 30: Hoare triple {292#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {292#false} is VALID [2018-11-23 10:21:15,557 INFO L273 TraceCheckUtils]: 31: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 10:21:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:15,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:15,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:15,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:21:15,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:21:15,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:15,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:21:15,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:15,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:21:15,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:21:15,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:15,755 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 10:21:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:16,123 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 10:21:16,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:21:16,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:21:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:21:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:21:16,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 10:21:16,573 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:16,577 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:21:16,577 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:21:16,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:21:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 10:21:16,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:16,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 10:21:16,605 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 10:21:16,605 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 10:21:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:16,610 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:21:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:21:16,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:16,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:16,611 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 10:21:16,611 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 10:21:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:16,614 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:21:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:21:16,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:16,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:16,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:16,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:21:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 10:21:16,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 10:21:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:16,620 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 10:21:16,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:21:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:21:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 10:21:16,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:16,622 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, 1, 1] [2018-11-23 10:21:16,622 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:16,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 10:21:16,623 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:16,623 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:16,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:21:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:17,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:17,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:21:17,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {548#true} is VALID [2018-11-23 10:21:17,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:21:17,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:21:17,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:21:17,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {548#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {568#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:21:17,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {568#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {568#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:21:17,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {568#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {575#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:17,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {575#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 5bv32); {549#false} is VALID [2018-11-23 10:21:17,781 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:21:17,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:21:17,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:21:17,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {549#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {549#false} is VALID [2018-11-23 10:21:17,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:21:17,783 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {549#false} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:21:17,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {549#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:21:17,784 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:21:17,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:21:17,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:21:17,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {549#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {549#false} is VALID [2018-11-23 10:21:17,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:21:17,786 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {549#false} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:21:17,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {549#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {549#false} is VALID [2018-11-23 10:21:17,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 4bv32); {549#false} is VALID [2018-11-23 10:21:17,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:21:17,793 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:21:17,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {549#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; {549#false} is VALID [2018-11-23 10:21:17,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:21:17,793 INFO L273 TraceCheckUtils]: 28: Hoare triple {549#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {549#false} is VALID [2018-11-23 10:21:17,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:21:17,794 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {549#false} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:21:17,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:21:17,795 INFO L273 TraceCheckUtils]: 32: Hoare triple {549#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {549#false} is VALID [2018-11-23 10:21:17,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:21:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:17,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:18,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:21:18,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {549#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {549#false} is VALID [2018-11-23 10:21:18,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:21:18,297 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {548#true} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:21:18,297 INFO L273 TraceCheckUtils]: 29: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:21:18,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {548#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {548#true} is VALID [2018-11-23 10:21:18,297 INFO L273 TraceCheckUtils]: 27: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:21:18,298 INFO L273 TraceCheckUtils]: 26: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:21:18,298 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:21:18,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {549#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:21:18,298 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 4bv32); {549#false} is VALID [2018-11-23 10:21:18,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {549#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {549#false} is VALID [2018-11-23 10:21:18,299 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {548#true} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:21:18,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:21:18,299 INFO L273 TraceCheckUtils]: 19: Hoare triple {548#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {548#true} is VALID [2018-11-23 10:21:18,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:21:18,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:21:18,300 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:21:18,301 INFO L273 TraceCheckUtils]: 15: Hoare triple {549#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {549#false} is VALID [2018-11-23 10:21:18,301 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {548#true} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:21:18,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:21:18,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {548#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {548#true} is VALID [2018-11-23 10:21:18,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:21:18,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {548#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; {548#true} is VALID [2018-11-23 10:21:18,303 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:21:18,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {729#(bvslt main_~i~1 (_ bv5 32))} assume !~bvslt32(~i~1, 5bv32); {549#false} is VALID [2018-11-23 10:21:18,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {729#(bvslt main_~i~1 (_ bv5 32))} is VALID [2018-11-23 10:21:18,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:18,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {548#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {733#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:18,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:21:18,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:21:18,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:21:18,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {548#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {548#true} is VALID [2018-11-23 10:21:18,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:21:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 10:21:18,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:18,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:21:18,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:21:18,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:18,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:21:18,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:18,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:21:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:21:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:21:18,590 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-23 10:21:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:19,366 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 10:21:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:21:19,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:21:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:21:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:21:19,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 10:21:19,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:19,704 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:21:19,705 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:21:19,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:21:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:21:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 10:21:19,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:19,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 10:21:19,720 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:21:19,720 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:21:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:19,724 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:21:19,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:21:19,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:19,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:19,725 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:21:19,726 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:21:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:19,729 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:21:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:21:19,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:19,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:19,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:19,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:21:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 10:21:19,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 34 [2018-11-23 10:21:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:19,734 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 10:21:19,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:21:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:21:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:21:19,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:19,736 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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,737 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:19,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 495848851, now seen corresponding path program 2 times [2018-11-23 10:21:19,738 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:19,738 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:19,759 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:21:20,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:21:20,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:20,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:20,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {945#true} is VALID [2018-11-23 10:21:20,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {945#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {945#true} is VALID [2018-11-23 10:21:20,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:21:20,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #66#return; {945#true} is VALID [2018-11-23 10:21:20,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret12 := main(); {945#true} is VALID [2018-11-23 10:21:20,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {945#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {945#true} is VALID [2018-11-23 10:21:20,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:21:20,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:21:20,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {945#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:21:20,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:21:20,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {945#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:21:20,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:21:20,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {945#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {945#true} is VALID [2018-11-23 10:21:20,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {945#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {945#true} is VALID [2018-11-23 10:21:20,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {945#true} assume !~bvslt32(~i~1, 5bv32); {945#true} is VALID [2018-11-23 10:21:20,171 INFO L256 TraceCheckUtils]: 15: Hoare triple {945#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:21:20,172 INFO L273 TraceCheckUtils]: 16: Hoare triple {945#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; {945#true} is VALID [2018-11-23 10:21:20,172 INFO L273 TraceCheckUtils]: 17: Hoare triple {945#true} assume !~bvslt32(~i~0, 5bv32); {945#true} is VALID [2018-11-23 10:21:20,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {945#true} is VALID [2018-11-23 10:21:20,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:21:20,173 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {945#true} {945#true} #70#return; {945#true} is VALID [2018-11-23 10:21:20,173 INFO L273 TraceCheckUtils]: 21: Hoare triple {945#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {945#true} is VALID [2018-11-23 10:21:20,173 INFO L256 TraceCheckUtils]: 22: Hoare triple {945#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:21:20,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {945#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; {945#true} is VALID [2018-11-23 10:21:20,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {945#true} assume !~bvslt32(~i~0, 5bv32); {945#true} is VALID [2018-11-23 10:21:20,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {945#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {945#true} is VALID [2018-11-23 10:21:20,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:21:20,175 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {945#true} {945#true} #72#return; {945#true} is VALID [2018-11-23 10:21:20,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {945#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {945#true} is VALID [2018-11-23 10:21:20,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {945#true} assume !~bvslt32(~i~2, 4bv32); {945#true} is VALID [2018-11-23 10:21:20,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {945#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {945#true} is VALID [2018-11-23 10:21:20,176 INFO L256 TraceCheckUtils]: 31: Hoare triple {945#true} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:21:20,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {945#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; {1046#(= (_ bv0 32) avg_~i~0)} is VALID [2018-11-23 10:21:20,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {1046#(= (_ bv0 32) avg_~i~0)} assume !~bvslt32(~i~0, 5bv32); {946#false} is VALID [2018-11-23 10:21:20,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {946#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {946#false} is VALID [2018-11-23 10:21:20,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {946#false} assume true; {946#false} is VALID [2018-11-23 10:21:20,182 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {946#false} {945#true} #74#return; {946#false} is VALID [2018-11-23 10:21:20,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {946#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {946#false} is VALID [2018-11-23 10:21:20,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {946#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {946#false} is VALID [2018-11-23 10:21:20,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {946#false} assume !false; {946#false} is VALID [2018-11-23 10:21:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 10:21:20,186 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:21:20,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:21:20,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:20,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:21:20,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:20,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:21:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:21:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:20,437 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-23 10:21:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:20,819 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 10:21:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:21:20,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:21:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:21:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:21:20,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 10:21:21,118 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:21,120 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:21:21,120 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:21:21,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:21:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 10:21:21,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:21,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 10:21:21,138 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 10:21:21,138 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 10:21:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:21,141 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:21:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:21:21,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:21,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 10:21:21,143 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 10:21:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:21,146 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:21:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:21:21,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:21,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:21,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:21,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:21:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 10:21:21,150 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 40 [2018-11-23 10:21:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:21,150 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 10:21:21,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:21:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 10:21:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:21:21,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:21,153 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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:21,153 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:21,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1599341807, now seen corresponding path program 1 times [2018-11-23 10:21:21,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:21,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:21:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:22,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:22,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:21:22,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1260#true} is VALID [2018-11-23 10:21:22,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:21:22,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:21:22,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:21:22,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1280#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:21:22,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {1280#(= main_~i~1 (_ bv0 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1280#(= main_~i~1 (_ bv0 32))} is VALID [2018-11-23 10:21:22,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {1280#(= main_~i~1 (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {1287#(= (bvadd main_~i~1 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {1294#(= (bvadd main_~i~1 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {1301#(= (bvadd main_~i~1 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1308#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:22,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {1308#(= (bvadd main_~i~1 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~1, 5bv32); {1261#false} is VALID [2018-11-23 10:21:22,436 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:21:22,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:21:22,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 5bv32);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; {1261#false} is VALID [2018-11-23 10:21:22,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:21:22,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:21:22,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {1261#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1261#false} is VALID [2018-11-23 10:21:22,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:21:22,438 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1261#false} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:21:22,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {1261#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,439 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:21:22,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:21:22,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 5bv32);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; {1261#false} is VALID [2018-11-23 10:21:22,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:21:22,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:21:22,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {1261#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1261#false} is VALID [2018-11-23 10:21:22,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:21:22,441 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1261#false} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:21:22,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {1261#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1261#false} is VALID [2018-11-23 10:21:22,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {1261#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,443 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:21:22,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {1261#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; {1261#false} is VALID [2018-11-23 10:21:22,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {1261#false} assume !!~bvslt32(~i~0, 5bv32);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; {1261#false} is VALID [2018-11-23 10:21:22,443 INFO L273 TraceCheckUtils]: 38: Hoare triple {1261#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1261#false} is VALID [2018-11-23 10:21:22,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:21:22,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {1261#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1261#false} is VALID [2018-11-23 10:21:22,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:21:22,445 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1261#false} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:21:22,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:21:22,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {1261#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1261#false} is VALID [2018-11-23 10:21:22,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:21:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 10:21:22,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:22,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:21:22,761 INFO L273 TraceCheckUtils]: 44: Hoare triple {1261#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1261#false} is VALID [2018-11-23 10:21:22,761 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:21:22,761 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1260#true} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:21:22,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:21:22,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {1260#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1260#true} is VALID [2018-11-23 10:21:22,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:21:22,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:21:22,763 INFO L273 TraceCheckUtils]: 37: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 5bv32);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; {1260#true} is VALID [2018-11-23 10:21:22,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:21:22,763 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:21:22,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {1261#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {1261#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1261#false} is VALID [2018-11-23 10:21:22,764 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1260#true} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:21:22,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:21:22,765 INFO L273 TraceCheckUtils]: 29: Hoare triple {1260#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1260#true} is VALID [2018-11-23 10:21:22,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:21:22,765 INFO L273 TraceCheckUtils]: 27: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:21:22,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 5bv32);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; {1260#true} is VALID [2018-11-23 10:21:22,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:21:22,766 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:21:22,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {1261#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1261#false} is VALID [2018-11-23 10:21:22,766 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1260#true} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:21:22,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:21:22,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {1260#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1260#true} is VALID [2018-11-23 10:21:22,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:21:22,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {1260#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1260#true} is VALID [2018-11-23 10:21:22,768 INFO L273 TraceCheckUtils]: 17: Hoare triple {1260#true} assume !!~bvslt32(~i~0, 5bv32);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; {1260#true} is VALID [2018-11-23 10:21:22,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {1260#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; {1260#true} is VALID [2018-11-23 10:21:22,768 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:21:22,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {1498#(bvslt main_~i~1 (_ bv5 32))} assume !~bvslt32(~i~1, 5bv32); {1261#false} is VALID [2018-11-23 10:21:22,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1498#(bvslt main_~i~1 (_ bv5 32))} is VALID [2018-11-23 10:21:22,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1502#(bvslt (bvadd main_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1509#(bvslt (bvadd main_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,795 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1516#(bvslt (bvadd main_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1523#(bvslt (bvadd main_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:22,797 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:21:22,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:21:22,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:21:22,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1260#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1260#true} is VALID [2018-11-23 10:21:22,798 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:21:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 10:21:22,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:22,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:21:22,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:21:22,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:22,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:21:23,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:23,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:21:23,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:21:23,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:21:23,102 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-23 10:21:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:24,742 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 10:21:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:21:24,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:21:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:21:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-23 10:21:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:21:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-23 10:21:24,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2018-11-23 10:21:25,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:25,142 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:21:25,142 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:21:25,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:21:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:21:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 10:21:25,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:25,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 10:21:25,160 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 10:21:25,160 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 10:21:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:25,164 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:21:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:21:25,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:25,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:25,165 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 10:21:25,165 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 10:21:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:25,168 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:21:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:21:25,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:25,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:25,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:25,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:21:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 10:21:25,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 46 [2018-11-23 10:21:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:25,172 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 10:21:25,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:21:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 10:21:25,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:21:25,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:25,174 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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:25,174 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:25,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1335114765, now seen corresponding path program 2 times [2018-11-23 10:21:25,175 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:25,175 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:25,196 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:21:26,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:21:26,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:26,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:26,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {1754#true} call ULTIMATE.init(); {1754#true} is VALID [2018-11-23 10:21:26,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {1754#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1754#true} is VALID [2018-11-23 10:21:26,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:21:26,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1754#true} {1754#true} #66#return; {1754#true} is VALID [2018-11-23 10:21:26,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {1754#true} call #t~ret12 := main(); {1754#true} is VALID [2018-11-23 10:21:26,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {1754#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1754#true} is VALID [2018-11-23 10:21:26,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,616 INFO L273 TraceCheckUtils]: 10: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1754#true} assume !~bvslt32(~i~1, 5bv32); {1754#true} is VALID [2018-11-23 10:21:26,618 INFO L256 TraceCheckUtils]: 17: Hoare triple {1754#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:21:26,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {1754#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; {1813#(= (_ bv0 32) avg_~i~0)} is VALID [2018-11-23 10:21:26,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(= (_ bv0 32) avg_~i~0)} assume !!~bvslt32(~i~0, 5bv32);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; {1813#(= (_ bv0 32) avg_~i~0)} is VALID [2018-11-23 10:21:26,620 INFO L273 TraceCheckUtils]: 20: Hoare triple {1813#(= (_ bv0 32) avg_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1820#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:26,620 INFO L273 TraceCheckUtils]: 21: Hoare triple {1820#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:21:26,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {1755#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1755#false} is VALID [2018-11-23 10:21:26,621 INFO L273 TraceCheckUtils]: 23: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:21:26,621 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1755#false} {1754#true} #70#return; {1755#false} is VALID [2018-11-23 10:21:26,621 INFO L273 TraceCheckUtils]: 25: Hoare triple {1755#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,621 INFO L256 TraceCheckUtils]: 26: Hoare triple {1755#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1755#false} is VALID [2018-11-23 10:21:26,622 INFO L273 TraceCheckUtils]: 27: Hoare triple {1755#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; {1755#false} is VALID [2018-11-23 10:21:26,622 INFO L273 TraceCheckUtils]: 28: Hoare triple {1755#false} assume !!~bvslt32(~i~0, 5bv32);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; {1755#false} is VALID [2018-11-23 10:21:26,622 INFO L273 TraceCheckUtils]: 29: Hoare triple {1755#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1755#false} is VALID [2018-11-23 10:21:26,622 INFO L273 TraceCheckUtils]: 30: Hoare triple {1755#false} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:21:26,623 INFO L273 TraceCheckUtils]: 31: Hoare triple {1755#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1755#false} is VALID [2018-11-23 10:21:26,623 INFO L273 TraceCheckUtils]: 32: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:21:26,624 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1755#false} {1755#false} #72#return; {1755#false} is VALID [2018-11-23 10:21:26,624 INFO L273 TraceCheckUtils]: 34: Hoare triple {1755#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1755#false} is VALID [2018-11-23 10:21:26,625 INFO L273 TraceCheckUtils]: 35: Hoare triple {1755#false} assume !~bvslt32(~i~2, 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,625 INFO L273 TraceCheckUtils]: 36: Hoare triple {1755#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,625 INFO L256 TraceCheckUtils]: 37: Hoare triple {1755#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1755#false} is VALID [2018-11-23 10:21:26,625 INFO L273 TraceCheckUtils]: 38: Hoare triple {1755#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; {1755#false} is VALID [2018-11-23 10:21:26,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {1755#false} assume !!~bvslt32(~i~0, 5bv32);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; {1755#false} is VALID [2018-11-23 10:21:26,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {1755#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1755#false} is VALID [2018-11-23 10:21:26,626 INFO L273 TraceCheckUtils]: 41: Hoare triple {1755#false} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:21:26,626 INFO L273 TraceCheckUtils]: 42: Hoare triple {1755#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1755#false} is VALID [2018-11-23 10:21:26,627 INFO L273 TraceCheckUtils]: 43: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:21:26,627 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1755#false} {1755#false} #74#return; {1755#false} is VALID [2018-11-23 10:21:26,627 INFO L273 TraceCheckUtils]: 45: Hoare triple {1755#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1755#false} is VALID [2018-11-23 10:21:26,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {1755#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1755#false} is VALID [2018-11-23 10:21:26,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {1755#false} assume !false; {1755#false} is VALID [2018-11-23 10:21:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-23 10:21:26,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:26,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {1755#false} assume !false; {1755#false} is VALID [2018-11-23 10:21:26,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {1755#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1755#false} is VALID [2018-11-23 10:21:26,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {1755#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1755#false} is VALID [2018-11-23 10:21:26,731 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1754#true} {1755#false} #74#return; {1755#false} is VALID [2018-11-23 10:21:26,731 INFO L273 TraceCheckUtils]: 43: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:21:26,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {1754#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1754#true} is VALID [2018-11-23 10:21:26,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {1754#true} assume !~bvslt32(~i~0, 5bv32); {1754#true} is VALID [2018-11-23 10:21:26,732 INFO L273 TraceCheckUtils]: 40: Hoare triple {1754#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1754#true} is VALID [2018-11-23 10:21:26,732 INFO L273 TraceCheckUtils]: 39: Hoare triple {1754#true} assume !!~bvslt32(~i~0, 5bv32);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; {1754#true} is VALID [2018-11-23 10:21:26,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {1754#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; {1754#true} is VALID [2018-11-23 10:21:26,732 INFO L256 TraceCheckUtils]: 37: Hoare triple {1755#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:21:26,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {1755#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {1755#false} assume !~bvslt32(~i~2, 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {1755#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1755#false} is VALID [2018-11-23 10:21:26,733 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1754#true} {1755#false} #72#return; {1755#false} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {1754#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1754#true} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {1754#true} assume !~bvslt32(~i~0, 5bv32); {1754#true} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {1754#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1754#true} is VALID [2018-11-23 10:21:26,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {1754#true} assume !!~bvslt32(~i~0, 5bv32);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; {1754#true} is VALID [2018-11-23 10:21:26,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {1754#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; {1754#true} is VALID [2018-11-23 10:21:26,734 INFO L256 TraceCheckUtils]: 26: Hoare triple {1755#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:21:26,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {1755#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1755#false} is VALID [2018-11-23 10:21:26,734 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1755#false} {1754#true} #70#return; {1755#false} is VALID [2018-11-23 10:21:26,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:21:26,735 INFO L273 TraceCheckUtils]: 22: Hoare triple {1755#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {1755#false} is VALID [2018-11-23 10:21:26,736 INFO L273 TraceCheckUtils]: 21: Hoare triple {1983#(bvslt avg_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:21:26,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {1987#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1983#(bvslt avg_~i~0 (_ bv5 32))} is VALID [2018-11-23 10:21:26,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {1987#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);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; {1987#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:26,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {1754#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; {1987#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:26,738 INFO L256 TraceCheckUtils]: 17: Hoare triple {1754#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:21:26,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {1754#true} assume !~bvslt32(~i~1, 5bv32); {1754#true} is VALID [2018-11-23 10:21:26,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,738 INFO L273 TraceCheckUtils]: 14: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {1754#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1754#true} is VALID [2018-11-23 10:21:26,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {1754#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {1754#true} is VALID [2018-11-23 10:21:26,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {1754#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {1754#true} is VALID [2018-11-23 10:21:26,740 INFO L256 TraceCheckUtils]: 4: Hoare triple {1754#true} call #t~ret12 := main(); {1754#true} is VALID [2018-11-23 10:21:26,740 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1754#true} {1754#true} #66#return; {1754#true} is VALID [2018-11-23 10:21:26,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:21:26,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {1754#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1754#true} is VALID [2018-11-23 10:21:26,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {1754#true} call ULTIMATE.init(); {1754#true} is VALID [2018-11-23 10:21:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 10:21:26,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:26,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:21:26,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 10:21:26,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:26,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:21:26,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:27,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:21:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:21:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:21:27,001 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-23 10:21:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,649 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 10:21:27,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:21:27,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 10:21:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:21:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:21:27,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 10:21:27,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:27,967 INFO L225 Difference]: With dead ends: 60 [2018-11-23 10:21:27,967 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:21:27,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:21:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:21:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 10:21:27,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:27,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 10:21:27,991 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:21:27,991 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:21:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,994 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 10:21:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:21:27,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:27,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:27,996 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:21:27,996 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:21:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:27,999 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 10:21:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:21:27,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:28,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:28,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:28,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:21:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 10:21:28,002 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 48 [2018-11-23 10:21:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:28,003 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 10:21:28,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:21:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:21:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 10:21:28,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:28,005 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 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:28,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:28,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2123804435, now seen corresponding path program 3 times [2018-11-23 10:21:28,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:28,033 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:21:28,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:21:28,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:28,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:29,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {2281#true} call ULTIMATE.init(); {2281#true} is VALID [2018-11-23 10:21:29,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {2281#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2281#true} is VALID [2018-11-23 10:21:29,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:21:29,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} #66#return; {2281#true} is VALID [2018-11-23 10:21:29,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {2281#true} call #t~ret12 := main(); {2281#true} is VALID [2018-11-23 10:21:29,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {2281#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2281#true} is VALID [2018-11-23 10:21:29,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {2281#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2281#true} is VALID [2018-11-23 10:21:29,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2281#true} is VALID [2018-11-23 10:21:29,082 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2281#true} is VALID [2018-11-23 10:21:29,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {2281#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2281#true} is VALID [2018-11-23 10:21:29,083 INFO L273 TraceCheckUtils]: 10: Hoare triple {2281#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2281#true} is VALID [2018-11-23 10:21:29,083 INFO L273 TraceCheckUtils]: 11: Hoare triple {2281#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2281#true} is VALID [2018-11-23 10:21:29,083 INFO L273 TraceCheckUtils]: 12: Hoare triple {2281#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2281#true} is VALID [2018-11-23 10:21:29,084 INFO L273 TraceCheckUtils]: 13: Hoare triple {2281#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2281#true} is VALID [2018-11-23 10:21:29,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {2281#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2281#true} is VALID [2018-11-23 10:21:29,084 INFO L273 TraceCheckUtils]: 15: Hoare triple {2281#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2281#true} is VALID [2018-11-23 10:21:29,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {2281#true} assume !~bvslt32(~i~1, 5bv32); {2281#true} is VALID [2018-11-23 10:21:29,084 INFO L256 TraceCheckUtils]: 17: Hoare triple {2281#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2281#true} is VALID [2018-11-23 10:21:29,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {2281#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; {2281#true} is VALID [2018-11-23 10:21:29,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,086 INFO L273 TraceCheckUtils]: 25: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {2281#true} assume !~bvslt32(~i~0, 5bv32); {2281#true} is VALID [2018-11-23 10:21:29,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {2281#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2281#true} is VALID [2018-11-23 10:21:29,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:21:29,088 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2281#true} {2281#true} #70#return; {2281#true} is VALID [2018-11-23 10:21:29,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {2281#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2281#true} is VALID [2018-11-23 10:21:29,088 INFO L256 TraceCheckUtils]: 32: Hoare triple {2281#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2281#true} is VALID [2018-11-23 10:21:29,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {2281#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; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 34: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {2281#true} assume !!~bvslt32(~i~0, 5bv32);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; {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {2281#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L273 TraceCheckUtils]: 42: Hoare triple {2281#true} assume !~bvslt32(~i~0, 5bv32); {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L273 TraceCheckUtils]: 43: Hoare triple {2281#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L273 TraceCheckUtils]: 44: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:21:29,090 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2281#true} {2281#true} #72#return; {2281#true} is VALID [2018-11-23 10:21:29,091 INFO L273 TraceCheckUtils]: 46: Hoare triple {2281#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2424#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:21:29,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {2424#(= main_~i~2 (_ bv0 32))} assume !~bvslt32(~i~2, 4bv32); {2282#false} is VALID [2018-11-23 10:21:29,092 INFO L273 TraceCheckUtils]: 48: Hoare triple {2282#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2282#false} is VALID [2018-11-23 10:21:29,092 INFO L256 TraceCheckUtils]: 49: Hoare triple {2282#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2282#false} is VALID [2018-11-23 10:21:29,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {2282#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; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 51: Hoare triple {2282#false} assume !!~bvslt32(~i~0, 5bv32);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; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 52: Hoare triple {2282#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 53: Hoare triple {2282#false} assume !!~bvslt32(~i~0, 5bv32);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; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 54: Hoare triple {2282#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 55: Hoare triple {2282#false} assume !!~bvslt32(~i~0, 5bv32);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; {2282#false} is VALID [2018-11-23 10:21:29,093 INFO L273 TraceCheckUtils]: 56: Hoare triple {2282#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L273 TraceCheckUtils]: 57: Hoare triple {2282#false} assume !!~bvslt32(~i~0, 5bv32);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; {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L273 TraceCheckUtils]: 58: Hoare triple {2282#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L273 TraceCheckUtils]: 59: Hoare triple {2282#false} assume !~bvslt32(~i~0, 5bv32); {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L273 TraceCheckUtils]: 60: Hoare triple {2282#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L273 TraceCheckUtils]: 61: Hoare triple {2282#false} assume true; {2282#false} is VALID [2018-11-23 10:21:29,094 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2282#false} {2282#false} #74#return; {2282#false} is VALID [2018-11-23 10:21:29,095 INFO L273 TraceCheckUtils]: 63: Hoare triple {2282#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2282#false} is VALID [2018-11-23 10:21:29,095 INFO L273 TraceCheckUtils]: 64: Hoare triple {2282#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2282#false} is VALID [2018-11-23 10:21:29,095 INFO L273 TraceCheckUtils]: 65: Hoare triple {2282#false} assume !false; {2282#false} is VALID [2018-11-23 10:21:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 10:21:29,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:21:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:21:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:21:29,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 10:21:29,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:29,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:21:29,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:29,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:21:29,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:21:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:29,360 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2018-11-23 10:21:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:29,673 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 10:21:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:21:29,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 10:21:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:21:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:21:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:21:29,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 10:21:29,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:29,949 INFO L225 Difference]: With dead ends: 63 [2018-11-23 10:21:29,950 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 10:21:29,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:21:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 10:21:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 10:21:29,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:29,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 10:21:29,979 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 10:21:29,979 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 10:21:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:29,981 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 10:21:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 10:21:29,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:29,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:29,982 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 10:21:29,982 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 10:21:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:29,984 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 10:21:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 10:21:29,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:29,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:29,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:29,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:21:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 10:21:29,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 66 [2018-11-23 10:21:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:29,988 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 10:21:29,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:21:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 10:21:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 10:21:29,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:29,989 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 5, 5, 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:29,989 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:29,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1321158677, now seen corresponding path program 1 times [2018-11-23 10:21:29,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:30,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:21:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:31,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:31,224 INFO L256 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2018-11-23 10:21:31,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {2724#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2724#true} is VALID [2018-11-23 10:21:31,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:21:31,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #66#return; {2724#true} is VALID [2018-11-23 10:21:31,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret12 := main(); {2724#true} is VALID [2018-11-23 10:21:31,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {2724#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2724#true} is VALID [2018-11-23 10:21:31,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {2724#true} assume !~bvslt32(~i~1, 5bv32); {2724#true} is VALID [2018-11-23 10:21:31,227 INFO L256 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:21:31,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {2724#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; {2783#(= (_ bv0 32) avg_~i~0)} is VALID [2018-11-23 10:21:31,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {2783#(= (_ bv0 32) avg_~i~0)} assume !!~bvslt32(~i~0, 5bv32);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; {2783#(= (_ bv0 32) avg_~i~0)} is VALID [2018-11-23 10:21:31,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {2783#(= (_ bv0 32) avg_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2790#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,229 INFO L273 TraceCheckUtils]: 21: Hoare triple {2790#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);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; {2790#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {2790#(= (bvadd avg_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2797#(= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {2797#(= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);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; {2797#(= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {2797#(= (bvadd avg_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2804#(= (bvadd avg_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(= (bvadd avg_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);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; {2804#(= (bvadd avg_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:21:31,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(= (bvadd avg_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2811#(= (_ bv4 32) avg_~i~0)} is VALID [2018-11-23 10:21:31,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#(= (_ bv4 32) avg_~i~0)} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:21:31,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {2725#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2725#false} is VALID [2018-11-23 10:21:31,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:21:31,232 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2725#false} {2724#true} #70#return; {2725#false} is VALID [2018-11-23 10:21:31,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {2725#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,233 INFO L256 TraceCheckUtils]: 32: Hoare triple {2725#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2725#false} is VALID [2018-11-23 10:21:31,233 INFO L273 TraceCheckUtils]: 33: Hoare triple {2725#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; {2725#false} is VALID [2018-11-23 10:21:31,233 INFO L273 TraceCheckUtils]: 34: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,234 INFO L273 TraceCheckUtils]: 40: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {2725#false} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:21:31,235 INFO L273 TraceCheckUtils]: 43: Hoare triple {2725#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2725#false} is VALID [2018-11-23 10:21:31,235 INFO L273 TraceCheckUtils]: 44: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:21:31,236 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2725#false} {2725#false} #72#return; {2725#false} is VALID [2018-11-23 10:21:31,236 INFO L273 TraceCheckUtils]: 46: Hoare triple {2725#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2725#false} is VALID [2018-11-23 10:21:31,236 INFO L273 TraceCheckUtils]: 47: Hoare triple {2725#false} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {2725#false} is VALID [2018-11-23 10:21:31,236 INFO L273 TraceCheckUtils]: 48: Hoare triple {2725#false} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2725#false} is VALID [2018-11-23 10:21:31,236 INFO L273 TraceCheckUtils]: 49: Hoare triple {2725#false} assume !~bvslt32(~i~2, 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 50: Hoare triple {2725#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L256 TraceCheckUtils]: 51: Hoare triple {2725#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 52: Hoare triple {2725#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; {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 53: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 54: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 55: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,237 INFO L273 TraceCheckUtils]: 56: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 57: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 58: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 59: Hoare triple {2725#false} assume !!~bvslt32(~i~0, 5bv32);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; {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {2725#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 61: Hoare triple {2725#false} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:21:31,238 INFO L273 TraceCheckUtils]: 62: Hoare triple {2725#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2725#false} is VALID [2018-11-23 10:21:31,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:21:31,239 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2725#false} {2725#false} #74#return; {2725#false} is VALID [2018-11-23 10:21:31,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {2725#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2725#false} is VALID [2018-11-23 10:21:31,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {2725#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2725#false} is VALID [2018-11-23 10:21:31,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2018-11-23 10:21:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 10:21:31,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:31,497 INFO L273 TraceCheckUtils]: 67: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 66: Hoare triple {2725#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2725#false} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {2725#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2725#false} is VALID [2018-11-23 10:21:31,498 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2724#true} {2725#false} #74#return; {2725#false} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 63: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {2724#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2724#true} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 61: Hoare triple {2724#true} assume !~bvslt32(~i~0, 5bv32); {2724#true} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 58: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 56: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 54: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,499 INFO L273 TraceCheckUtils]: 53: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,500 INFO L273 TraceCheckUtils]: 52: Hoare triple {2724#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; {2724#true} is VALID [2018-11-23 10:21:31,500 INFO L256 TraceCheckUtils]: 51: Hoare triple {2725#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:21:31,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {2725#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,500 INFO L273 TraceCheckUtils]: 49: Hoare triple {2725#false} assume !~bvslt32(~i~2, 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,500 INFO L273 TraceCheckUtils]: 48: Hoare triple {2725#false} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2725#false} is VALID [2018-11-23 10:21:31,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {2725#false} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {2725#false} is VALID [2018-11-23 10:21:31,501 INFO L273 TraceCheckUtils]: 46: Hoare triple {2725#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2725#false} is VALID [2018-11-23 10:21:31,501 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2724#true} {2725#false} #72#return; {2725#false} is VALID [2018-11-23 10:21:31,501 INFO L273 TraceCheckUtils]: 44: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:21:31,501 INFO L273 TraceCheckUtils]: 43: Hoare triple {2724#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {2724#true} assume !~bvslt32(~i~0, 5bv32); {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 41: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 40: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 39: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {2724#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2724#true} is VALID [2018-11-23 10:21:31,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {2724#true} assume !!~bvslt32(~i~0, 5bv32);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; {2724#true} is VALID [2018-11-23 10:21:31,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {2724#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; {2724#true} is VALID [2018-11-23 10:21:31,503 INFO L256 TraceCheckUtils]: 32: Hoare triple {2725#false} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:21:31,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {2725#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2725#false} is VALID [2018-11-23 10:21:31,504 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2725#false} {2724#true} #70#return; {2725#false} is VALID [2018-11-23 10:21:31,504 INFO L273 TraceCheckUtils]: 29: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:21:31,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {2725#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {2725#false} is VALID [2018-11-23 10:21:31,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {3058#(bvslt avg_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:21:31,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3058#(bvslt avg_~i~0 (_ bv5 32))} is VALID [2018-11-23 10:21:31,518 INFO L273 TraceCheckUtils]: 25: Hoare triple {3062#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);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; {3062#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {3069#(bvslt (bvadd avg_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3062#(bvslt (bvadd avg_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {3069#(bvslt (bvadd avg_~i~0 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);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; {3069#(bvslt (bvadd avg_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,526 INFO L273 TraceCheckUtils]: 22: Hoare triple {3076#(bvslt (bvadd avg_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3069#(bvslt (bvadd avg_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {3076#(bvslt (bvadd avg_~i~0 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);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; {3076#(bvslt (bvadd avg_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(bvslt (bvadd avg_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3076#(bvslt (bvadd avg_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {3083#(bvslt (bvadd avg_~i~0 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);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; {3083#(bvslt (bvadd avg_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {2724#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; {3083#(bvslt (bvadd avg_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:21:31,531 INFO L256 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:21:31,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {2724#true} assume !~bvslt32(~i~1, 5bv32); {2724#true} is VALID [2018-11-23 10:21:31,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {2724#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {2724#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {2724#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L256 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret12 := main(); {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #66#return; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L273 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {2724#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2724#true} is VALID [2018-11-23 10:21:31,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2018-11-23 10:21:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:21:31,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:31,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:21:31,544 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-11-23 10:21:31,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:31,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:21:31,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:31,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:21:31,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:21:31,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:21:31,843 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2018-11-23 10:21:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,079 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 10:21:33,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:21:33,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-11-23 10:21:33,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:21:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 10:21:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:21:33,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 10:21:33,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2018-11-23 10:21:33,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:33,367 INFO L225 Difference]: With dead ends: 71 [2018-11-23 10:21:33,367 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 10:21:33,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:21:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 10:21:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 10:21:33,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:33,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 10:21:33,392 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 10:21:33,393 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 10:21:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,395 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:21:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:21:33,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:33,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:33,396 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 10:21:33,396 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 10:21:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:33,398 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:21:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:21:33,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:33,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:33,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:33,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 10:21:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 10:21:33,400 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 68 [2018-11-23 10:21:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:33,401 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 10:21:33,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:21:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 10:21:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 10:21:33,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:33,402 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 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,402 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:33,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:33,402 INFO L82 PathProgramCache]: Analyzing trace with hash 616014441, now seen corresponding path program 2 times [2018-11-23 10:21:33,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:33,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:33,424 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:21:34,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:21:34,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:35,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:35,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 10:21:35,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3405#true} is VALID [2018-11-23 10:21:35,161 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #66#return; {3405#true} is VALID [2018-11-23 10:21:35,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret12 := main(); {3405#true} is VALID [2018-11-23 10:21:35,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3405#true} is VALID [2018-11-23 10:21:35,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#true} assume !~bvslt32(~i~1, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L256 TraceCheckUtils]: 17: Hoare triple {3405#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#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; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 28: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {3405#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3405#true} is VALID [2018-11-23 10:21:35,165 INFO L273 TraceCheckUtils]: 31: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3405#true} {3405#true} #70#return; {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {3405#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L256 TraceCheckUtils]: 34: Hoare triple {3405#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {3405#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; {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,167 INFO L273 TraceCheckUtils]: 42: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L273 TraceCheckUtils]: 44: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L273 TraceCheckUtils]: 45: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L273 TraceCheckUtils]: 46: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L273 TraceCheckUtils]: 47: Hoare triple {3405#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,168 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3405#true} {3405#true} #72#return; {3405#true} is VALID [2018-11-23 10:21:35,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {3405#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3560#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:21:35,176 INFO L273 TraceCheckUtils]: 51: Hoare triple {3560#(= main_~i~2 (_ bv0 32))} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {3560#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-23 10:21:35,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {3560#(= main_~i~2 (_ bv0 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3567#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-23 10:21:35,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {3567#(= (_ bv1 32) main_~i~2)} assume !~bvslt32(~i~2, 4bv32); {3406#false} is VALID [2018-11-23 10:21:35,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {3406#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {3406#false} is VALID [2018-11-23 10:21:35,177 INFO L256 TraceCheckUtils]: 55: Hoare triple {3406#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {3406#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; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {3406#false} assume !!~bvslt32(~i~0, 5bv32);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; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {3406#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {3406#false} assume !!~bvslt32(~i~0, 5bv32);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; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {3406#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {3406#false} assume !!~bvslt32(~i~0, 5bv32);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; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {3406#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#false} is VALID [2018-11-23 10:21:35,178 INFO L273 TraceCheckUtils]: 63: Hoare triple {3406#false} assume !!~bvslt32(~i~0, 5bv32);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; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {3406#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {3406#false} assume !!~bvslt32(~i~0, 5bv32);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; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {3406#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 67: Hoare triple {3406#false} assume !~bvslt32(~i~0, 5bv32); {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 68: Hoare triple {3406#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 69: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3406#false} {3406#false} #74#return; {3406#false} is VALID [2018-11-23 10:21:35,179 INFO L273 TraceCheckUtils]: 71: Hoare triple {3406#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3406#false} is VALID [2018-11-23 10:21:35,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {3406#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3406#false} is VALID [2018-11-23 10:21:35,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 10:21:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 130 proven. 1 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-23 10:21:35,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:21:35,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 10:21:35,318 INFO L273 TraceCheckUtils]: 72: Hoare triple {3406#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3406#false} is VALID [2018-11-23 10:21:35,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {3406#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3406#false} is VALID [2018-11-23 10:21:35,319 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3405#true} {3406#false} #74#return; {3406#false} is VALID [2018-11-23 10:21:35,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,319 INFO L273 TraceCheckUtils]: 68: Hoare triple {3405#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3405#true} is VALID [2018-11-23 10:21:35,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 66: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 65: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 64: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,320 INFO L273 TraceCheckUtils]: 61: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 59: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 58: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 57: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 56: Hoare triple {3405#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; {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L256 TraceCheckUtils]: 55: Hoare triple {3406#false} call #t~ret11 := avg(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:21:35,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {3406#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {3406#false} is VALID [2018-11-23 10:21:35,322 INFO L273 TraceCheckUtils]: 53: Hoare triple {3691#(bvslt main_~i~2 (_ bv4 32))} assume !~bvslt32(~i~2, 4bv32); {3406#false} is VALID [2018-11-23 10:21:35,322 INFO L273 TraceCheckUtils]: 52: Hoare triple {3695#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3691#(bvslt main_~i~2 (_ bv4 32))} is VALID [2018-11-23 10:21:35,322 INFO L273 TraceCheckUtils]: 51: Hoare triple {3695#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {3695#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-23 10:21:35,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {3405#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3695#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-23 10:21:35,323 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3405#true} {3405#true} #72#return; {3405#true} is VALID [2018-11-23 10:21:35,323 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,323 INFO L273 TraceCheckUtils]: 47: Hoare triple {3405#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3405#true} is VALID [2018-11-23 10:21:35,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 45: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 44: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 43: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 42: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 41: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 40: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 39: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,324 INFO L273 TraceCheckUtils]: 38: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L273 TraceCheckUtils]: 36: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {3405#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; {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L256 TraceCheckUtils]: 34: Hoare triple {3405#true} call #t~ret7 := avg(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {3405#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3405#true} is VALID [2018-11-23 10:21:35,325 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3405#true} {3405#true} #70#return; {3405#true} is VALID [2018-11-23 10:21:35,326 INFO L273 TraceCheckUtils]: 31: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {3405#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(5bv32))[32:0]; {3405#true} is VALID [2018-11-23 10:21:35,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,326 INFO L273 TraceCheckUtils]: 28: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,327 INFO L273 TraceCheckUtils]: 26: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,327 INFO L273 TraceCheckUtils]: 25: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {3405#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#true} assume !!~bvslt32(~i~0, 5bv32);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; {3405#true} is VALID [2018-11-23 10:21:35,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#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; {3405#true} is VALID [2018-11-23 10:21:35,329 INFO L256 TraceCheckUtils]: 17: Hoare triple {3405#true} call #t~ret4 := avg(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:21:35,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#true} assume !~bvslt32(~i~1, 5bv32); {3405#true} is VALID [2018-11-23 10:21:35,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {3405#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3405#true} is VALID [2018-11-23 10:21:35,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {3405#true} assume !!~bvslt32(~i~1, 5bv32);call write~intINTTYPE4(#t~nondet3, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~nondet3; {3405#true} is VALID [2018-11-23 10:21:35,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32);havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0bv32; {3405#true} is VALID [2018-11-23 10:21:35,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret12 := main(); {3405#true} is VALID [2018-11-23 10:21:35,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #66#return; {3405#true} is VALID [2018-11-23 10:21:35,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:21:35,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3405#true} is VALID [2018-11-23 10:21:35,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 10:21:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-23 10:21:35,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:21:35,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:21:35,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-23 10:21:35,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:21:35,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:21:35,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:35,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:21:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:21:35,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:21:35,577 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-23 10:21:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:36,323 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 10:21:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:21:36,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-23 10:21:36,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:21:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:21:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:21:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:21:36,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 10:21:36,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:21:36,612 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:21:36,612 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:21:36,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:21:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:21:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 10:21:36,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:36,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 10:21:36,670 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 10:21:36,670 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 10:21:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:36,672 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 10:21:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:21:36,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:36,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:36,672 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 10:21:36,672 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 10:21:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:36,674 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 10:21:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:21:36,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:36,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:36,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:36,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 10:21:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 10:21:36,678 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 74 [2018-11-23 10:21:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:36,678 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 10:21:36,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:21:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:21:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 10:21:36,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:36,679 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 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:36,680 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:36,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:36,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1471357923, now seen corresponding path program 3 times [2018-11-23 10:21:36,680 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:36,680 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:36,706 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2