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/sum05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:25:03,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:25:03,327 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:25:03,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:25:03,346 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:25:03,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:25:03,349 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:25:03,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:25:03,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:25:03,356 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:25:03,357 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:25:03,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:25:03,358 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:25:03,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:25:03,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:25:03,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:25:03,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:25:03,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:25:03,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:25:03,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:25:03,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:25:03,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:25:03,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:25:03,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:25:03,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:25:03,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:25:03,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:25:03,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:25:03,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:25:03,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:25:03,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:25:03,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:25:03,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:25:03,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:25:03,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:25:03,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:25:03,383 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:25:03,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:25:03,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:25:03,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:25:03,406 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:25:03,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:25:03,407 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:25:03,407 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:25:03,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:25:03,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:25:03,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:25:03,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:25:03,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:25:03,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:25:03,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:25:03,409 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:25:03,409 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:25:03,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:25:03,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:25:03,409 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:25:03,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:25:03,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:25:03,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:25:03,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:25:03,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:25:03,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:25:03,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:25:03,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:25:03,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:25:03,412 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:25:03,412 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:25:03,412 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:25:03,412 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:25:03,413 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:25:03,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:25:03,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:25:03,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:25:03,490 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:25:03,491 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:25:03,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-23 10:25:03,566 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb6f24d5/fc376d80664d4a459d1e88da846aa3f7/FLAGc31fa707d [2018-11-23 10:25:04,097 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:25:04,099 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum05_true-unreach-call_true-termination.i [2018-11-23 10:25:04,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb6f24d5/fc376d80664d4a459d1e88da846aa3f7/FLAGc31fa707d [2018-11-23 10:25:04,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb6f24d5/fc376d80664d4a459d1e88da846aa3f7 [2018-11-23 10:25:04,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:25:04,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:25:04,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:04,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:25:04,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:25:04,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,447 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:25:04, skipping insertion in model container [2018-11-23 10:25:04,447 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:25:04,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:25:04,751 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:04,772 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:25:04,805 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:25:04,826 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:25:04,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04 WrapperNode [2018-11-23 10:25:04,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:25:04,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:04,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:25:04,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:25:04,839 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:25:04" (1/1) ... [2018-11-23 10:25:04,850 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:25:04" (1/1) ... [2018-11-23 10:25:04,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:25:04,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:25:04,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:25:04,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:25:04,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (1/1) ... [2018-11-23 10:25:04,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:25:04,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:25:04,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:25:04,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:25:04,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (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:25:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:25:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:25:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:25:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:25:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:25:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:25:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2018-11-23 10:25:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2018-11-23 10:25:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:25:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:25:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:25:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:25:05,691 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:25:05,692 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:25:05,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:05 BoogieIcfgContainer [2018-11-23 10:25:05,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:25:05,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:25:05,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:25:05,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:25:05,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:25:04" (1/3) ... [2018-11-23 10:25:05,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143ec4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:05, skipping insertion in model container [2018-11-23 10:25:05,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:25:04" (2/3) ... [2018-11-23 10:25:05,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143ec4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:25:05, skipping insertion in model container [2018-11-23 10:25:05,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:25:05" (3/3) ... [2018-11-23 10:25:05,701 INFO L112 eAbstractionObserver]: Analyzing ICFG sum05_true-unreach-call_true-termination.i [2018-11-23 10:25:05,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:25:05,718 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:25:05,738 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:25:05,771 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:25:05,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:25:05,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:25:05,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:25:05,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:25:05,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:25:05,773 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:25:05,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:25:05,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:25:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:25:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:05,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:05,801 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:25:05,803 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:05,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:05,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 10:25:05,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:05,815 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:25:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:05,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:06,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:25:06,200 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:25:06,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:25:06,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 10:25:06,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret12 := main(); {34#true} is VALID [2018-11-23 10:25:06,203 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:25:06,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 10:25:06,204 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:06,205 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:25:06,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:06,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:06,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:06,206 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {35#false} #70#return; {35#false} is VALID [2018-11-23 10:25:06,206 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:25:06,207 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:06,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {35#false} is VALID [2018-11-23 10:25:06,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:06,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:06,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:06,209 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #72#return; {35#false} is VALID [2018-11-23 10:25:06,209 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:25:06,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:06,210 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:25:06,210 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:25:06,210 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:25:06,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 10:25:06,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~ret~0[32:0]; {35#false} is VALID [2018-11-23 10:25:06,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:25:06,212 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #74#return; {35#false} is VALID [2018-11-23 10:25:06,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {35#false} is VALID [2018-11-23 10:25:06,212 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:25:06,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:25:06,220 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:25:06,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:25:06,241 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:06,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:06,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:25:06,524 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:25:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:25:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:25:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:25:06,536 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 10:25:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:06,663 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 10:25:06,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:25:06,664 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 10:25:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:06,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:25:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:25:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 10:25:06,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 10:25:06,992 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:25:07,003 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:25:07,003 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:25:07,007 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:25:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:25:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:25:07,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:07,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,065 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,065 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:07,071 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:25:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:07,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:07,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:07,073 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,073 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:25:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:07,078 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:25:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:07,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:07,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:07,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:07,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:25:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 10:25:07,086 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 10:25:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 10:25:07,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:25:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:25:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:25:07,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:07,089 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:25:07,089 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:07,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 10:25:07,090 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:07,091 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:25:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:07,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:07,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {291#true} call ULTIMATE.init(); {291#true} is VALID [2018-11-23 10:25:07,710 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:25:07,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {291#true} assume true; {291#true} is VALID [2018-11-23 10:25:07,710 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {291#true} {291#true} #66#return; {291#true} is VALID [2018-11-23 10:25:07,710 INFO L256 TraceCheckUtils]: 4: Hoare triple {291#true} call #t~ret12 := main(); {291#true} is VALID [2018-11-23 10:25:07,711 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:25:07,712 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:25:07,712 INFO L256 TraceCheckUtils]: 7: Hoare triple {292#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:07,712 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:25:07,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:25:07,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:07,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:07,713 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {292#false} {292#false} #70#return; {292#false} is VALID [2018-11-23 10:25:07,714 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:25:07,714 INFO L256 TraceCheckUtils]: 14: Hoare triple {292#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:07,715 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:25:07,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:25:07,715 INFO L273 TraceCheckUtils]: 17: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:07,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:07,716 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {292#false} {292#false} #72#return; {292#false} is VALID [2018-11-23 10:25:07,716 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:25:07,716 INFO L273 TraceCheckUtils]: 21: Hoare triple {292#false} assume !~bvslt32(~i~2, 4bv32); {292#false} is VALID [2018-11-23 10:25:07,717 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:25:07,717 INFO L256 TraceCheckUtils]: 23: Hoare triple {292#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {292#false} is VALID [2018-11-23 10:25:07,717 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:25:07,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {292#false} assume !~bvslt32(~i~0, 5bv32); {292#false} is VALID [2018-11-23 10:25:07,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {292#false} #res := ~ret~0[32:0]; {292#false} is VALID [2018-11-23 10:25:07,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {292#false} assume true; {292#false} is VALID [2018-11-23 10:25:07,719 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {292#false} {292#false} #74#return; {292#false} is VALID [2018-11-23 10:25:07,719 INFO L273 TraceCheckUtils]: 29: Hoare triple {292#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {292#false} is VALID [2018-11-23 10:25:07,719 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:25:07,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {292#false} assume !false; {292#false} is VALID [2018-11-23 10:25:07,722 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:25:07,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:25:07,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:07,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:07,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:25:07,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:07,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:07,831 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:25:07,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:07,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:07,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:07,832 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 10:25:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,119 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 10:25:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:08,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 10:25:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:25:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:25:08,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 10:25:08,296 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:25:08,299 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:25:08,300 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:25:08,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:25:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 10:25:08,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:08,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:08,326 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:08,327 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 10:25:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,330 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:25:08,332 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:25:08,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,333 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 10:25:08,333 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 10:25:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:08,336 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 10:25:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 10:25:08,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:08,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:08,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:08,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:25:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 10:25:08,341 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 10:25:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:08,341 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 10:25:08,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 10:25:08,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 10:25:08,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:08,343 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:25:08,344 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:08,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 10:25:08,345 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:08,345 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:25:08,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:25:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:08,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:08,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:25:08,551 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:25:08,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:08,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:25:08,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:25:08,554 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:25:08,554 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:25:08,555 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:25:08,557 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:25:08,557 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:08,557 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:25:08,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:25:08,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:08,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:08,559 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {549#false} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:25:08,559 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:25:08,560 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:08,561 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:25:08,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:25:08,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:08,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:08,562 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {549#false} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:25:08,562 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:25:08,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 4bv32); {549#false} is VALID [2018-11-23 10:25:08,563 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:25:08,563 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {549#false} is VALID [2018-11-23 10:25:08,564 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:25:08,564 INFO L273 TraceCheckUtils]: 27: Hoare triple {549#false} assume !~bvslt32(~i~0, 5bv32); {549#false} is VALID [2018-11-23 10:25:08,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {549#false} #res := ~ret~0[32:0]; {549#false} is VALID [2018-11-23 10:25:08,565 INFO L273 TraceCheckUtils]: 29: Hoare triple {549#false} assume true; {549#false} is VALID [2018-11-23 10:25:08,565 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {549#false} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:25:08,565 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:25:08,566 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:25:08,566 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:25:08,568 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:25:08,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:08,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {549#false} assume !false; {549#false} is VALID [2018-11-23 10:25:08,776 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:25:08,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {549#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {549#false} is VALID [2018-11-23 10:25:08,777 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {548#true} {549#false} #74#return; {549#false} is VALID [2018-11-23 10:25:08,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:08,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:08,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:25:08,778 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:25:08,778 INFO L256 TraceCheckUtils]: 25: Hoare triple {549#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:08,779 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:25:08,779 INFO L273 TraceCheckUtils]: 23: Hoare triple {549#false} assume !~bvslt32(~i~2, 4bv32); {549#false} is VALID [2018-11-23 10:25:08,779 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:25:08,780 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {548#true} {549#false} #72#return; {549#false} is VALID [2018-11-23 10:25:08,780 INFO L273 TraceCheckUtils]: 20: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:08,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:08,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:25:08,781 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:25:08,781 INFO L256 TraceCheckUtils]: 16: Hoare triple {549#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:08,781 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:25:08,782 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {548#true} {549#false} #70#return; {549#false} is VALID [2018-11-23 10:25:08,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:08,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {548#true} #res := ~ret~0[32:0]; {548#true} is VALID [2018-11-23 10:25:08,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {548#true} assume !~bvslt32(~i~0, 5bv32); {548#true} is VALID [2018-11-23 10:25:08,783 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:25:08,783 INFO L256 TraceCheckUtils]: 9: Hoare triple {549#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {548#true} is VALID [2018-11-23 10:25:08,785 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:25:08,787 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:25:08,787 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:25:08,802 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:25:08,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {548#true} call #t~ret12 := main(); {548#true} is VALID [2018-11-23 10:25:08,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {548#true} {548#true} #66#return; {548#true} is VALID [2018-11-23 10:25:08,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {548#true} assume true; {548#true} is VALID [2018-11-23 10:25:08,804 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:25:08,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {548#true} call ULTIMATE.init(); {548#true} is VALID [2018-11-23 10:25:08,806 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:25:08,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:08,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:08,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:25:08,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:08,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:08,884 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:25:08,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:08,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:08,885 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-23 10:25:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,281 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-23 10:25:09,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:09,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-23 10:25:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:09,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:25:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-23 10:25:09,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-23 10:25:09,409 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:25:09,411 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:25:09,412 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:25:09,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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:25:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:25:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 10:25:09,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:09,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:09,435 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:09,435 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,438 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:25:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:09,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,439 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:09,440 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:25:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,444 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 10:25:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:09,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:09,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:25:09,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 10:25:09,448 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 34 [2018-11-23 10:25:09,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:09,449 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 10:25:09,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:09,449 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:25:09,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:25:09,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:09,451 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:25:09,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:09,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash -821989805, now seen corresponding path program 2 times [2018-11-23 10:25:09,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:09,452 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:25:09,478 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:09,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:25:09,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:09,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:09,646 INFO L256 TraceCheckUtils]: 0: Hoare triple {945#true} call ULTIMATE.init(); {945#true} is VALID [2018-11-23 10:25:09,646 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:25:09,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:09,647 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} #66#return; {945#true} is VALID [2018-11-23 10:25:09,647 INFO L256 TraceCheckUtils]: 4: Hoare triple {945#true} call #t~ret12 := main(); {945#true} is VALID [2018-11-23 10:25:09,647 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:25:09,648 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:25:09,648 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:25:09,648 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:25:09,648 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:25:09,648 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:25:09,649 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:25:09,649 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:25:09,649 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:25:09,649 INFO L273 TraceCheckUtils]: 14: Hoare triple {945#true} assume !~bvslt32(~i~1, 5bv32); {945#true} is VALID [2018-11-23 10:25:09,649 INFO L256 TraceCheckUtils]: 15: Hoare triple {945#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:09,650 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:25:09,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {945#true} assume !~bvslt32(~i~0, 5bv32); {945#true} is VALID [2018-11-23 10:25:09,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#true} #res := ~ret~0[32:0]; {945#true} is VALID [2018-11-23 10:25:09,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:09,651 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {945#true} {945#true} #70#return; {945#true} is VALID [2018-11-23 10:25:09,651 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:25:09,652 INFO L256 TraceCheckUtils]: 22: Hoare triple {945#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:09,652 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:25:09,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {945#true} assume !~bvslt32(~i~0, 5bv32); {945#true} is VALID [2018-11-23 10:25:09,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {945#true} #res := ~ret~0[32:0]; {945#true} is VALID [2018-11-23 10:25:09,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {945#true} assume true; {945#true} is VALID [2018-11-23 10:25:09,653 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {945#true} {945#true} #72#return; {945#true} is VALID [2018-11-23 10:25:09,653 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:25:09,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {945#true} assume !~bvslt32(~i~2, 4bv32); {945#true} is VALID [2018-11-23 10:25:09,654 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:25:09,654 INFO L256 TraceCheckUtils]: 31: Hoare triple {945#true} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {945#true} is VALID [2018-11-23 10:25:09,654 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#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:09,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {1046#(= sum_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {946#false} is VALID [2018-11-23 10:25:09,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {946#false} #res := ~ret~0[32:0]; {946#false} is VALID [2018-11-23 10:25:09,657 INFO L273 TraceCheckUtils]: 35: Hoare triple {946#false} assume true; {946#false} is VALID [2018-11-23 10:25:09,657 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {946#false} {945#true} #74#return; {946#false} is VALID [2018-11-23 10:25:09,658 INFO L273 TraceCheckUtils]: 37: Hoare triple {946#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {946#false} is VALID [2018-11-23 10:25:09,658 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:25:09,658 INFO L273 TraceCheckUtils]: 39: Hoare triple {946#false} assume !false; {946#false} is VALID [2018-11-23 10:25:09,660 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:25:09,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:09,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:09,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:09,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:25:09,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:09,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:09,719 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:25:09,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:09,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:09,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:09,720 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-23 10:25:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,850 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-23 10:25:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:09,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 10:25:09,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:25:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 10:25:09,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 10:25:09,946 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:25:09,948 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:25:09,948 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:25:09,949 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:25:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:25:09,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 10:25:09,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:09,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:09,971 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:09,971 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 10:25:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,976 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:25:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:25:09,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,977 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 10:25:09,977 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 10:25:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:09,980 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 10:25:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 10:25:09,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:09,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:09,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:09,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:25:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 10:25:09,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 40 [2018-11-23 10:25:09,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:09,985 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 10:25:09,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 10:25:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:25:09,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:09,987 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:25:09,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:09,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash -830087119, now seen corresponding path program 1 times [2018-11-23 10:25:09,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:09,988 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:25:10,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:10,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:10,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:25:10,305 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:25:10,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:25:10,307 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:25:10,315 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:25:10,316 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:25:10,317 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:25:10,317 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:25:10,319 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:25:10,321 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:25:10,321 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:25:10,323 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:25:10,324 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:25:10,329 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:25:10,329 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,329 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:25:10,329 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:25:10,330 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:25:10,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:25:10,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,331 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1261#false} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:25:10,331 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:25:10,332 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,332 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:25:10,332 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:25:10,332 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:25:10,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:25:10,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,333 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1261#false} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:25:10,334 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:25:10,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 4bv32); {1261#false} is VALID [2018-11-23 10:25:10,334 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:25:10,334 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1261#false} is VALID [2018-11-23 10:25:10,335 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:25:10,335 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:25:10,335 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:25:10,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {1261#false} assume !~bvslt32(~i~0, 5bv32); {1261#false} is VALID [2018-11-23 10:25:10,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {1261#false} #res := ~ret~0[32:0]; {1261#false} is VALID [2018-11-23 10:25:10,336 INFO L273 TraceCheckUtils]: 41: Hoare triple {1261#false} assume true; {1261#false} is VALID [2018-11-23 10:25:10,336 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1261#false} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:25:10,336 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:25:10,337 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:25:10,337 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:25:10,341 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:25:10,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:10,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2018-11-23 10:25:10,631 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:25:10,631 INFO L273 TraceCheckUtils]: 43: Hoare triple {1261#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1261#false} is VALID [2018-11-23 10:25:10,631 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1260#true} {1261#false} #74#return; {1261#false} is VALID [2018-11-23 10:25:10,632 INFO L273 TraceCheckUtils]: 41: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,632 INFO L273 TraceCheckUtils]: 40: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:10,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:25:10,633 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:25:10,633 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:25:10,633 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:25:10,634 INFO L256 TraceCheckUtils]: 35: Hoare triple {1261#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:10,634 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:25:10,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {1261#false} assume !~bvslt32(~i~2, 4bv32); {1261#false} is VALID [2018-11-23 10:25:10,634 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:25:10,635 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1260#true} {1261#false} #72#return; {1261#false} is VALID [2018-11-23 10:25:10,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:10,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:25:10,636 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:25:10,636 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:25:10,636 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:25:10,636 INFO L256 TraceCheckUtils]: 24: Hoare triple {1261#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:10,636 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:25:10,637 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1260#true} {1261#false} #70#return; {1261#false} is VALID [2018-11-23 10:25:10,637 INFO L273 TraceCheckUtils]: 21: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {1260#true} #res := ~ret~0[32:0]; {1260#true} is VALID [2018-11-23 10:25:10,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {1260#true} assume !~bvslt32(~i~0, 5bv32); {1260#true} is VALID [2018-11-23 10:25:10,637 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:25:10,637 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:25:10,638 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:25:10,638 INFO L256 TraceCheckUtils]: 15: Hoare triple {1261#false} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1260#true} is VALID [2018-11-23 10:25:10,638 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:25:10,640 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:25:10,640 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:25:10,645 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:25:10,647 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:25:10,653 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:25:10,657 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:25:10,661 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:25:10,662 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:25:10,663 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:25:10,663 INFO L256 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret12 := main(); {1260#true} is VALID [2018-11-23 10:25:10,663 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #66#return; {1260#true} is VALID [2018-11-23 10:25:10,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2018-11-23 10:25:10,664 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:25:10,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2018-11-23 10:25:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:25:10,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:10,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:25:10,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:25:10,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:10,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:25:10,819 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:25:10,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:25:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:25:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:25:10,820 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-11-23 10:25:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,656 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 10:25:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:25:11,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-11-23 10:25:11,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-23 10:25:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2018-11-23 10:25:11,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2018-11-23 10:25:11,796 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:25:11,798 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:25:11,799 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:25:11,800 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:25:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:25:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 10:25:11,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:11,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 10:25:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 10:25:11,834 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 10:25:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,837 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:25:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:25:11,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:11,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:11,839 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 10:25:11,839 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 10:25:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:11,841 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:25:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:25:11,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:11,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:11,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:11,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:25:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 10:25:11,845 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 46 [2018-11-23 10:25:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:11,846 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 10:25:11,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:25:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 10:25:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 10:25:11,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:11,848 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:25:11,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:11,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -565860077, now seen corresponding path program 2 times [2018-11-23 10:25:11,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:11,849 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:25:11,880 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:11,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:11,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:11,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:12,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {1754#true} call ULTIMATE.init(); {1754#true} is VALID [2018-11-23 10:25:12,094 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:25:12,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:25:12,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1754#true} {1754#true} #66#return; {1754#true} is VALID [2018-11-23 10:25:12,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {1754#true} call #t~ret12 := main(); {1754#true} is VALID [2018-11-23 10:25:12,095 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:25:12,095 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:25:12,096 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:25:12,096 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:25:12,096 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:25:12,097 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:25:12,097 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:25:12,097 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:25:12,097 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:25:12,097 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:25:12,097 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:25:12,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {1754#true} assume !~bvslt32(~i~1, 5bv32); {1754#true} is VALID [2018-11-23 10:25:12,098 INFO L256 TraceCheckUtils]: 17: Hoare triple {1754#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:25:12,098 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#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:12,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {1813#(= sum_~i~0 (_ 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; {1813#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:12,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {1813#(= sum_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1820#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:12,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {1820#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:25:12,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {1755#false} #res := ~ret~0[32:0]; {1755#false} is VALID [2018-11-23 10:25:12,100 INFO L273 TraceCheckUtils]: 23: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:25:12,100 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1755#false} {1754#true} #70#return; {1755#false} is VALID [2018-11-23 10:25:12,100 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:25:12,100 INFO L256 TraceCheckUtils]: 26: Hoare triple {1755#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1755#false} is VALID [2018-11-23 10:25:12,101 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:25:12,101 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:25:12,101 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:25:12,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {1755#false} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:25:12,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {1755#false} #res := ~ret~0[32:0]; {1755#false} is VALID [2018-11-23 10:25:12,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:25:12,102 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1755#false} {1755#false} #72#return; {1755#false} is VALID [2018-11-23 10:25:12,103 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:25:12,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {1755#false} assume !~bvslt32(~i~2, 4bv32); {1755#false} is VALID [2018-11-23 10:25:12,103 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:25:12,104 INFO L256 TraceCheckUtils]: 37: Hoare triple {1755#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1755#false} is VALID [2018-11-23 10:25:12,104 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:25:12,104 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:25:12,105 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:25:12,105 INFO L273 TraceCheckUtils]: 41: Hoare triple {1755#false} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:25:12,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {1755#false} #res := ~ret~0[32:0]; {1755#false} is VALID [2018-11-23 10:25:12,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:25:12,106 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1755#false} {1755#false} #74#return; {1755#false} is VALID [2018-11-23 10:25:12,106 INFO L273 TraceCheckUtils]: 45: Hoare triple {1755#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1755#false} is VALID [2018-11-23 10:25:12,106 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:25:12,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {1755#false} assume !false; {1755#false} is VALID [2018-11-23 10:25:12,108 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:25:12,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:12,228 INFO L273 TraceCheckUtils]: 47: Hoare triple {1755#false} assume !false; {1755#false} is VALID [2018-11-23 10:25:12,229 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:25:12,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {1755#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1755#false} is VALID [2018-11-23 10:25:12,230 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1754#true} {1755#false} #74#return; {1755#false} is VALID [2018-11-23 10:25:12,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:25:12,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {1754#true} #res := ~ret~0[32:0]; {1754#true} is VALID [2018-11-23 10:25:12,230 INFO L273 TraceCheckUtils]: 41: Hoare triple {1754#true} assume !~bvslt32(~i~0, 5bv32); {1754#true} is VALID [2018-11-23 10:25:12,231 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:25:12,231 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:25:12,231 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:25:12,231 INFO L256 TraceCheckUtils]: 37: Hoare triple {1755#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:25:12,231 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:25:12,232 INFO L273 TraceCheckUtils]: 35: Hoare triple {1755#false} assume !~bvslt32(~i~2, 4bv32); {1755#false} is VALID [2018-11-23 10:25:12,232 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:25:12,232 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1754#true} {1755#false} #72#return; {1755#false} is VALID [2018-11-23 10:25:12,232 INFO L273 TraceCheckUtils]: 32: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:25:12,232 INFO L273 TraceCheckUtils]: 31: Hoare triple {1754#true} #res := ~ret~0[32:0]; {1754#true} is VALID [2018-11-23 10:25:12,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {1754#true} assume !~bvslt32(~i~0, 5bv32); {1754#true} is VALID [2018-11-23 10:25:12,233 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:25:12,233 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:25:12,233 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:25:12,234 INFO L256 TraceCheckUtils]: 26: Hoare triple {1755#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:25:12,234 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:25:12,234 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1755#false} {1754#true} #70#return; {1755#false} is VALID [2018-11-23 10:25:12,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {1755#false} assume true; {1755#false} is VALID [2018-11-23 10:25:12,235 INFO L273 TraceCheckUtils]: 22: Hoare triple {1755#false} #res := ~ret~0[32:0]; {1755#false} is VALID [2018-11-23 10:25:12,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {1983#(bvslt sum_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {1755#false} is VALID [2018-11-23 10:25:12,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {1987#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1983#(bvslt sum_~i~0 (_ bv5 32))} is VALID [2018-11-23 10:25:12,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {1987#(bvslt (bvadd sum_~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 sum_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:12,237 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 sum_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:12,237 INFO L256 TraceCheckUtils]: 17: Hoare triple {1754#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {1754#true} is VALID [2018-11-23 10:25:12,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {1754#true} assume !~bvslt32(~i~1, 5bv32); {1754#true} is VALID [2018-11-23 10:25:12,237 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:25:12,237 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:25:12,238 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:25:12,238 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:25:12,238 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:25:12,238 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:25:12,238 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:25:12,239 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:25:12,239 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:25:12,239 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:25:12,239 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:25:12,240 INFO L256 TraceCheckUtils]: 4: Hoare triple {1754#true} call #t~ret12 := main(); {1754#true} is VALID [2018-11-23 10:25:12,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1754#true} {1754#true} #66#return; {1754#true} is VALID [2018-11-23 10:25:12,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {1754#true} assume true; {1754#true} is VALID [2018-11-23 10:25:12,241 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:25:12,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {1754#true} call ULTIMATE.init(); {1754#true} is VALID [2018-11-23 10:25:12,244 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:25:12,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:12,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:12,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 10:25:12,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:12,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:12,322 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:25:12,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:12,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:12,323 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-23 10:25:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,624 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 10:25:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:12,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-23 10:25:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:25:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-11-23 10:25:12,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2018-11-23 10:25:12,757 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:25:12,759 INFO L225 Difference]: With dead ends: 60 [2018-11-23 10:25:12,759 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:25:12,760 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:25:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:25:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 10:25:12,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:12,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 10:25:12,784 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:25:12,785 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:25:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,788 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 10:25:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:25:12,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:12,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:12,789 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:25:12,789 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:25:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:12,792 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 10:25:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:25:12,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:12,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:12,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:12,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:25:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 10:25:12,795 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 48 [2018-11-23 10:25:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:12,796 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 10:25:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 10:25:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 10:25:12,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:12,797 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:25:12,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:12,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1286466771, now seen corresponding path program 3 times [2018-11-23 10:25:12,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:12,798 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:25:12,815 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:25:12,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:25:12,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:12,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:12,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {2281#true} call ULTIMATE.init(); {2281#true} is VALID [2018-11-23 10:25:12,996 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:25:12,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:25:12,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2281#true} {2281#true} #66#return; {2281#true} is VALID [2018-11-23 10:25:12,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {2281#true} call #t~ret12 := main(); {2281#true} is VALID [2018-11-23 10:25:12,996 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:25:12,997 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:25:12,997 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:25:12,997 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:25:12,998 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:25:12,998 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:25:12,998 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:25:12,998 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:25:12,999 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:25:12,999 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:25:12,999 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:25:12,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {2281#true} assume !~bvslt32(~i~1, 5bv32); {2281#true} is VALID [2018-11-23 10:25:12,999 INFO L256 TraceCheckUtils]: 17: Hoare triple {2281#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2281#true} is VALID [2018-11-23 10:25:12,999 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:25:13,000 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:25:13,000 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:25:13,000 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:25:13,000 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:25:13,001 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:25:13,001 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:25:13,001 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:25:13,001 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:25:13,002 INFO L273 TraceCheckUtils]: 27: Hoare triple {2281#true} assume !~bvslt32(~i~0, 5bv32); {2281#true} is VALID [2018-11-23 10:25:13,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {2281#true} #res := ~ret~0[32:0]; {2281#true} is VALID [2018-11-23 10:25:13,002 INFO L273 TraceCheckUtils]: 29: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:25:13,002 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2281#true} {2281#true} #70#return; {2281#true} is VALID [2018-11-23 10:25:13,003 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:25:13,003 INFO L256 TraceCheckUtils]: 32: Hoare triple {2281#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2281#true} is VALID [2018-11-23 10:25:13,003 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:25:13,003 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:25:13,003 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:25:13,004 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:25:13,004 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:25:13,004 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:25:13,004 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:25:13,005 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:25:13,005 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:25:13,005 INFO L273 TraceCheckUtils]: 42: Hoare triple {2281#true} assume !~bvslt32(~i~0, 5bv32); {2281#true} is VALID [2018-11-23 10:25:13,005 INFO L273 TraceCheckUtils]: 43: Hoare triple {2281#true} #res := ~ret~0[32:0]; {2281#true} is VALID [2018-11-23 10:25:13,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {2281#true} assume true; {2281#true} is VALID [2018-11-23 10:25:13,006 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2281#true} {2281#true} #72#return; {2281#true} is VALID [2018-11-23 10:25:13,010 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:25:13,015 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:25:13,015 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:25:13,015 INFO L256 TraceCheckUtils]: 49: Hoare triple {2282#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2282#false} is VALID [2018-11-23 10:25:13,015 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:25:13,015 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:25:13,016 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:25:13,016 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:25:13,016 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:25:13,016 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:25:13,016 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:25:13,017 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:25:13,017 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:25:13,017 INFO L273 TraceCheckUtils]: 59: Hoare triple {2282#false} assume !~bvslt32(~i~0, 5bv32); {2282#false} is VALID [2018-11-23 10:25:13,017 INFO L273 TraceCheckUtils]: 60: Hoare triple {2282#false} #res := ~ret~0[32:0]; {2282#false} is VALID [2018-11-23 10:25:13,017 INFO L273 TraceCheckUtils]: 61: Hoare triple {2282#false} assume true; {2282#false} is VALID [2018-11-23 10:25:13,017 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2282#false} {2282#false} #74#return; {2282#false} is VALID [2018-11-23 10:25:13,018 INFO L273 TraceCheckUtils]: 63: Hoare triple {2282#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2282#false} is VALID [2018-11-23 10:25:13,018 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:25:13,018 INFO L273 TraceCheckUtils]: 65: Hoare triple {2282#false} assume !false; {2282#false} is VALID [2018-11-23 10:25:13,022 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:25:13,022 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:25:13,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:25:13,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:25:13,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 10:25:13,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:13,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:25:13,108 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:25:13,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:25:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:25:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:25:13,110 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 3 states. [2018-11-23 10:25:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,284 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-11-23 10:25:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:25:13,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-23 10:25:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:25:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:25:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 10:25:13,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 10:25:13,376 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:25:13,378 INFO L225 Difference]: With dead ends: 63 [2018-11-23 10:25:13,378 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 10:25:13,379 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:25:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 10:25:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 10:25:13,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:13,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 10:25:13,407 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 10:25:13,407 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 10:25:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,409 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 10:25:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 10:25:13,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:13,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:13,410 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 10:25:13,410 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 10:25:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:13,412 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-23 10:25:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 10:25:13,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:13,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:13,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:13,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:25:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 10:25:13,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 66 [2018-11-23 10:25:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:13,416 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 10:25:13,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:25:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 10:25:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 10:25:13,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:13,417 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:25:13,417 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:13,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash -778601941, now seen corresponding path program 1 times [2018-11-23 10:25:13,418 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:13,418 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:25:13,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:25:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:13,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:13,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2018-11-23 10:25:13,743 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:25:13,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:25:13,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #66#return; {2724#true} is VALID [2018-11-23 10:25:13,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret12 := main(); {2724#true} is VALID [2018-11-23 10:25:13,744 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:25:13,744 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:25:13,744 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:25:13,745 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:25:13,745 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:25:13,745 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:25:13,745 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:25:13,745 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:25:13,745 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:25:13,746 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:25:13,746 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:25:13,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {2724#true} assume !~bvslt32(~i~1, 5bv32); {2724#true} is VALID [2018-11-23 10:25:13,746 INFO L256 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:25:13,746 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#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:13,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {2783#(= sum_~i~0 (_ 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; {2783#(= sum_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:25:13,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {2783#(= sum_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2790#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:13,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {2790#(= (bvadd sum_~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 sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:13,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {2790#(= (bvadd sum_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2797#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:13,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {2797#(= (bvadd sum_~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 sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:13,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {2797#(= (bvadd sum_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2804#(= (_ bv3 32) sum_~i~0)} is VALID [2018-11-23 10:25:13,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(= (_ bv3 32) sum_~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; {2804#(= (_ bv3 32) sum_~i~0)} is VALID [2018-11-23 10:25:13,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {2804#(= (_ bv3 32) sum_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2811#(= (bvadd sum_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:25:13,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {2811#(= (bvadd sum_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:25:13,750 INFO L273 TraceCheckUtils]: 28: Hoare triple {2725#false} #res := ~ret~0[32:0]; {2725#false} is VALID [2018-11-23 10:25:13,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:25:13,751 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2725#false} {2724#true} #70#return; {2725#false} is VALID [2018-11-23 10:25:13,751 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:25:13,751 INFO L256 TraceCheckUtils]: 32: Hoare triple {2725#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2725#false} is VALID [2018-11-23 10:25:13,751 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:25:13,752 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:25:13,752 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:25:13,752 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:25:13,753 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:25:13,753 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:25:13,753 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:25:13,753 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:25:13,753 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:25:13,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {2725#false} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:25:13,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {2725#false} #res := ~ret~0[32:0]; {2725#false} is VALID [2018-11-23 10:25:13,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:25:13,754 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2725#false} {2725#false} #72#return; {2725#false} is VALID [2018-11-23 10:25:13,754 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:25:13,754 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:25:13,755 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:25:13,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {2725#false} assume !~bvslt32(~i~2, 4bv32); {2725#false} is VALID [2018-11-23 10:25:13,755 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:25:13,755 INFO L256 TraceCheckUtils]: 51: Hoare triple {2725#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2725#false} is VALID [2018-11-23 10:25:13,756 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:25:13,756 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:25:13,756 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:25:13,756 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:25:13,757 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:25:13,757 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:25:13,757 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:25:13,757 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:25:13,757 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:25:13,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {2725#false} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:25:13,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {2725#false} #res := ~ret~0[32:0]; {2725#false} is VALID [2018-11-23 10:25:13,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:25:13,758 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2725#false} {2725#false} #74#return; {2725#false} is VALID [2018-11-23 10:25:13,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {2725#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2725#false} is VALID [2018-11-23 10:25:13,759 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:25:13,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2018-11-23 10:25:13,763 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:25:13,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:14,055 INFO L273 TraceCheckUtils]: 67: Hoare triple {2725#false} assume !false; {2725#false} is VALID [2018-11-23 10:25:14,055 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:25:14,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {2725#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2725#false} is VALID [2018-11-23 10:25:14,056 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {2724#true} {2725#false} #74#return; {2725#false} is VALID [2018-11-23 10:25:14,056 INFO L273 TraceCheckUtils]: 63: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:25:14,056 INFO L273 TraceCheckUtils]: 62: Hoare triple {2724#true} #res := ~ret~0[32:0]; {2724#true} is VALID [2018-11-23 10:25:14,056 INFO L273 TraceCheckUtils]: 61: Hoare triple {2724#true} assume !~bvslt32(~i~0, 5bv32); {2724#true} is VALID [2018-11-23 10:25:14,056 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:25:14,057 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:25:14,057 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:25:14,057 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:25:14,057 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:25:14,057 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:25:14,057 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:25:14,058 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:25:14,058 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:25:14,058 INFO L256 TraceCheckUtils]: 51: Hoare triple {2725#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:25:14,058 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:25:14,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {2725#false} assume !~bvslt32(~i~2, 4bv32); {2725#false} is VALID [2018-11-23 10:25:14,059 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:25:14,059 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:25:14,059 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:25:14,059 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2724#true} {2725#false} #72#return; {2725#false} is VALID [2018-11-23 10:25:14,060 INFO L273 TraceCheckUtils]: 44: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:25:14,060 INFO L273 TraceCheckUtils]: 43: Hoare triple {2724#true} #res := ~ret~0[32:0]; {2724#true} is VALID [2018-11-23 10:25:14,060 INFO L273 TraceCheckUtils]: 42: Hoare triple {2724#true} assume !~bvslt32(~i~0, 5bv32); {2724#true} is VALID [2018-11-23 10:25:14,060 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:25:14,060 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:25:14,061 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:25:14,061 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:25:14,061 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:25:14,061 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:25:14,061 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:25:14,062 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:25:14,062 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:25:14,062 INFO L256 TraceCheckUtils]: 32: Hoare triple {2725#false} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:25:14,062 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:25:14,062 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2725#false} {2724#true} #70#return; {2725#false} is VALID [2018-11-23 10:25:14,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {2725#false} assume true; {2725#false} is VALID [2018-11-23 10:25:14,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {2725#false} #res := ~ret~0[32:0]; {2725#false} is VALID [2018-11-23 10:25:14,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {3058#(bvslt sum_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {2725#false} is VALID [2018-11-23 10:25:14,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {3062#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3058#(bvslt sum_~i~0 (_ bv5 32))} is VALID [2018-11-23 10:25:14,083 INFO L273 TraceCheckUtils]: 25: Hoare triple {3062#(bvslt (bvadd sum_~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 sum_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {3069#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3062#(bvslt (bvadd sum_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {3069#(bvslt (bvadd sum_~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 sum_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {3076#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3069#(bvslt (bvadd sum_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {3076#(bvslt (bvadd sum_~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 sum_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,102 INFO L273 TraceCheckUtils]: 20: Hoare triple {3083#(bvslt (bvadd sum_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3076#(bvslt (bvadd sum_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,102 INFO L273 TraceCheckUtils]: 19: Hoare triple {3083#(bvslt (bvadd sum_~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 sum_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,103 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 sum_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-23 10:25:14,103 INFO L256 TraceCheckUtils]: 17: Hoare triple {2724#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {2724#true} is VALID [2018-11-23 10:25:14,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {2724#true} assume !~bvslt32(~i~1, 5bv32); {2724#true} is VALID [2018-11-23 10:25:14,103 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:25:14,103 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:25:14,104 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:25:14,104 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:25:14,104 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:25:14,104 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:25:14,104 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:25:14,104 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:25:14,104 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:25:14,105 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:25:14,105 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:25:14,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {2724#true} call #t~ret12 := main(); {2724#true} is VALID [2018-11-23 10:25:14,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2724#true} {2724#true} #66#return; {2724#true} is VALID [2018-11-23 10:25:14,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {2724#true} assume true; {2724#true} is VALID [2018-11-23 10:25:14,105 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:25:14,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {2724#true} call ULTIMATE.init(); {2724#true} is VALID [2018-11-23 10:25:14,108 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:25:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:25:14,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-11-23 10:25:14,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:14,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:25:14,377 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:25:14,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:25:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:25:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:25:14,378 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 12 states. [2018-11-23 10:25:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:14,988 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-23 10:25:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:25:14,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-11-23 10:25:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 10:25:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:25:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-23 10:25:14,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2018-11-23 10:25:15,087 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:25:15,089 INFO L225 Difference]: With dead ends: 71 [2018-11-23 10:25:15,089 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 10:25:15,090 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:25:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 10:25:15,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 10:25:15,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:15,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 10:25:15,112 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 10:25:15,112 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 10:25:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:15,115 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:25:15,115 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:25:15,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:15,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:15,115 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 10:25:15,116 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 10:25:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:15,118 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 10:25:15,118 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 10:25:15,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:15,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:15,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:15,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 10:25:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-23 10:25:15,121 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 68 [2018-11-23 10:25:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:15,121 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-23 10:25:15,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:25:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 10:25:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 10:25:15,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:15,122 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:25:15,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:15,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -935540471, now seen corresponding path program 2 times [2018-11-23 10:25:15,123 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:15,123 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:25:15,140 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:25:15,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:25:15,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:25:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:25:15,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:25:15,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 10:25:15,432 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:25:15,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #66#return; {3405#true} is VALID [2018-11-23 10:25:15,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret12 := main(); {3405#true} is VALID [2018-11-23 10:25:15,433 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:25:15,434 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:25:15,434 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:25:15,434 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:25:15,434 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:25:15,434 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:25:15,434 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:25:15,435 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:25:15,435 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:25:15,435 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:25:15,435 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:25:15,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#true} assume !~bvslt32(~i~1, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,435 INFO L256 TraceCheckUtils]: 17: Hoare triple {3405#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:25:15,435 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,436 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:25:15,437 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:25:15,437 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:25:15,437 INFO L273 TraceCheckUtils]: 29: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,437 INFO L273 TraceCheckUtils]: 30: Hoare triple {3405#true} #res := ~ret~0[32:0]; {3405#true} is VALID [2018-11-23 10:25:15,437 INFO L273 TraceCheckUtils]: 31: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,437 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3405#true} {3405#true} #70#return; {3405#true} is VALID [2018-11-23 10:25:15,437 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:25:15,438 INFO L256 TraceCheckUtils]: 34: Hoare triple {3405#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:25:15,438 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:25:15,438 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:25:15,438 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:25:15,438 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:25:15,438 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:25:15,438 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:25:15,438 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:25:15,439 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:25:15,439 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:25:15,439 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:25:15,439 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:25:15,439 INFO L273 TraceCheckUtils]: 46: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,439 INFO L273 TraceCheckUtils]: 47: Hoare triple {3405#true} #res := ~ret~0[32:0]; {3405#true} is VALID [2018-11-23 10:25:15,439 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,440 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3405#true} {3405#true} #72#return; {3405#true} is VALID [2018-11-23 10:25:15,440 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:25:15,450 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:25:15,450 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:25:15,451 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:25:15,451 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:25:15,451 INFO L256 TraceCheckUtils]: 55: Hoare triple {3406#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3406#false} is VALID [2018-11-23 10:25:15,451 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:25:15,451 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:25:15,451 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,452 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:25:15,453 INFO L273 TraceCheckUtils]: 67: Hoare triple {3406#false} assume !~bvslt32(~i~0, 5bv32); {3406#false} is VALID [2018-11-23 10:25:15,453 INFO L273 TraceCheckUtils]: 68: Hoare triple {3406#false} #res := ~ret~0[32:0]; {3406#false} is VALID [2018-11-23 10:25:15,453 INFO L273 TraceCheckUtils]: 69: Hoare triple {3406#false} assume true; {3406#false} is VALID [2018-11-23 10:25:15,453 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3406#false} {3406#false} #74#return; {3406#false} is VALID [2018-11-23 10:25:15,453 INFO L273 TraceCheckUtils]: 71: Hoare triple {3406#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3406#false} is VALID [2018-11-23 10:25:15,453 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:25:15,453 INFO L273 TraceCheckUtils]: 73: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 10:25:15,456 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:25:15,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:25:15,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 10:25:15,586 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:25:15,586 INFO L273 TraceCheckUtils]: 71: Hoare triple {3406#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3406#false} is VALID [2018-11-23 10:25:15,586 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {3405#true} {3406#false} #74#return; {3406#false} is VALID [2018-11-23 10:25:15,586 INFO L273 TraceCheckUtils]: 69: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,586 INFO L273 TraceCheckUtils]: 68: Hoare triple {3405#true} #res := ~ret~0[32:0]; {3405#true} is VALID [2018-11-23 10:25:15,586 INFO L273 TraceCheckUtils]: 67: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,587 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:25:15,587 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:25:15,587 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:25:15,587 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:25:15,587 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:25:15,588 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:25:15,588 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:25:15,588 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:25:15,588 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:25:15,588 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:25:15,589 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:25:15,589 INFO L256 TraceCheckUtils]: 55: Hoare triple {3406#false} call #t~ret11 := sum(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:25:15,589 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:25:15,601 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:25:15,601 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:25:15,602 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:25:15,602 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:25:15,602 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3405#true} {3405#true} #72#return; {3405#true} is VALID [2018-11-23 10:25:15,603 INFO L273 TraceCheckUtils]: 48: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,603 INFO L273 TraceCheckUtils]: 47: Hoare triple {3405#true} #res := ~ret~0[32:0]; {3405#true} is VALID [2018-11-23 10:25:15,603 INFO L273 TraceCheckUtils]: 46: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,603 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:25:15,603 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:25:15,603 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:25:15,604 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:25:15,604 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:25:15,604 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:25:15,604 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:25:15,604 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:25:15,605 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:25:15,605 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:25:15,605 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:25:15,606 INFO L256 TraceCheckUtils]: 34: Hoare triple {3405#true} call #t~ret7 := sum(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:25:15,606 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:25:15,606 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3405#true} {3405#true} #70#return; {3405#true} is VALID [2018-11-23 10:25:15,606 INFO L273 TraceCheckUtils]: 31: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {3405#true} #res := ~ret~0[32:0]; {3405#true} is VALID [2018-11-23 10:25:15,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {3405#true} assume !~bvslt32(~i~0, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,607 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:25:15,607 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:25:15,607 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:25:15,608 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:25:15,608 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:25:15,608 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:25:15,608 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:25:15,608 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:25:15,608 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:25:15,609 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:25:15,609 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:25:15,609 INFO L256 TraceCheckUtils]: 17: Hoare triple {3405#true} call #t~ret4 := sum(~#x~0.base, ~#x~0.offset); {3405#true} is VALID [2018-11-23 10:25:15,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#true} assume !~bvslt32(~i~1, 5bv32); {3405#true} is VALID [2018-11-23 10:25:15,609 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:25:15,609 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:25:15,610 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:25:15,610 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:25:15,610 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:25:15,610 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:25:15,610 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:25:15,610 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:25:15,611 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:25:15,611 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:25:15,611 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:25:15,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret12 := main(); {3405#true} is VALID [2018-11-23 10:25:15,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #66#return; {3405#true} is VALID [2018-11-23 10:25:15,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 10:25:15,612 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:25:15,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 10:25:15,615 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:25:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:25:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:25:15,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-23 10:25:15,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:25:15,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:25:15,685 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:25:15,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:25:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:25:15,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:25:15,686 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-23 10:25:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,078 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-23 10:25:16,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:25:16,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-23 10:25:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:25:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:25:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:25:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 10:25:16,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 10:25:16,220 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:25:16,222 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:25:16,222 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:25:16,222 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:25:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:25:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 10:25:16,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:25:16,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 10:25:16,282 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 10:25:16,282 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 10:25:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,284 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 10:25:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:25:16,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:16,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:16,285 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 10:25:16,285 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 10:25:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:25:16,288 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-23 10:25:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:25:16,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:25:16,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:25:16,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:25:16,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:25:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 10:25:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 10:25:16,291 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 74 [2018-11-23 10:25:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:25:16,291 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 10:25:16,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:25:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:25:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 10:25:16,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:25:16,292 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:25:16,293 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:25:16,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:25:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1986573693, now seen corresponding path program 3 times [2018-11-23 10:25:16,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:25:16,294 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:25:16,325 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2