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/loop-acceleration/array_false-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:46,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:46,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:46,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:46,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:46,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:46,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:46,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:46,957 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:46,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:46,959 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:46,959 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:46,960 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:46,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:46,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:46,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:46,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:46,965 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:46,967 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:46,969 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:46,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:46,971 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:46,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:46,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:46,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:46,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:46,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:46,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:46,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:46,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:46,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:46,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:46,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:46,983 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:46,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:46,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:46,986 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 11:26:47,003 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:47,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:47,005 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:47,006 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:47,006 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:47,006 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:47,009 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:47,009 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:47,009 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:47,009 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:47,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:47,010 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:47,010 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:47,010 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:47,011 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:47,011 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:47,011 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:47,011 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:47,011 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:47,012 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:47,012 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:47,012 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:47,012 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:47,012 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:47,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:47,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:47,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:47,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:47,015 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:47,015 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:47,015 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:47,015 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:47,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:47,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:47,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:47,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:47,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:47,084 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:47,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-23 11:26:47,145 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed94c7e7/174e49fd5e7e4bc18b794169ded6af24/FLAG48dacf553 [2018-11-23 11:26:47,620 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:47,620 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call2_true-termination.i [2018-11-23 11:26:47,626 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed94c7e7/174e49fd5e7e4bc18b794169ded6af24/FLAG48dacf553 [2018-11-23 11:26:47,943 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fed94c7e7/174e49fd5e7e4bc18b794169ded6af24 [2018-11-23 11:26:47,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:47,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:47,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:47,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:47,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:47,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:47" (1/1) ... [2018-11-23 11:26:47,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0b3694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:47, skipping insertion in model container [2018-11-23 11:26:47,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:47" (1/1) ... [2018-11-23 11:26:47,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:48,000 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:48,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:48,226 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:48,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:48,286 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:48,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48 WrapperNode [2018-11-23 11:26:48,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:48,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:48,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:48,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:48,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:48,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:48,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:48,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:48,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (1/1) ... [2018-11-23 11:26:48,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:48,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:48,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:48,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:48,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (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 11:26:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:26:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:26:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:48,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:48,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:26:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:26:48,940 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:48,941 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:26:48,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:48 BoogieIcfgContainer [2018-11-23 11:26:48,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:48,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:48,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:48,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:48,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:47" (1/3) ... [2018-11-23 11:26:48,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a630b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:48, skipping insertion in model container [2018-11-23 11:26:48,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:48" (2/3) ... [2018-11-23 11:26:48,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a630b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:48, skipping insertion in model container [2018-11-23 11:26:48,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:48" (3/3) ... [2018-11-23 11:26:48,950 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call2_true-termination.i [2018-11-23 11:26:48,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:48,969 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:48,988 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:49,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:49,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:49,033 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:49,034 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:49,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:49,034 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:49,034 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:49,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:49,035 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:26:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:26:49,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:49,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:49,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:49,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 11:26:49,073 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:49,074 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 11:26:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:49,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:49,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:26:49,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {24#true} is VALID [2018-11-23 11:26:49,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:26:49,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 11:26:49,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2018-11-23 11:26:49,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {24#true} is VALID [2018-11-23 11:26:49,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:26:49,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {25#false} is VALID [2018-11-23 11:26:49,221 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:26:49,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:26:49,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:26:49,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:26:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:49,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:26:49,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:26:49,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:49,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:26:49,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:49,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:26:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:26:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:49,346 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:26:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,700 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:26:49,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:26:49,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:26:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:26:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:26:49,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 11:26:49,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:49,896 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:26:49,896 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:26:49,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 11:26:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:26:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:26:49,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:49,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:49,946 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:49,946 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,949 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:26:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:49,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:49,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:49,950 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:49,950 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,953 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:26:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:49,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:49,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:49,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:49,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:26:49,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 11:26:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:49,959 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:26:49,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:26:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:26:49,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:49,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:49,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:49,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 11:26:49,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:49,962 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 11:26:49,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:50,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:50,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-23 11:26:50,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {153#true} is VALID [2018-11-23 11:26:50,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-23 11:26:50,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #35#return; {153#true} is VALID [2018-11-23 11:26:50,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret4 := main(); {153#true} is VALID [2018-11-23 11:26:50,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {173#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:50,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {173#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 2048bv32); {154#false} is VALID [2018-11-23 11:26:50,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {154#false} is VALID [2018-11-23 11:26:50,173 INFO L256 TraceCheckUtils]: 8: Hoare triple {154#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {154#false} is VALID [2018-11-23 11:26:50,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-23 11:26:50,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} assume 0bv32 == ~cond; {154#false} is VALID [2018-11-23 11:26:50,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-23 11:26:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:50,175 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:50,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:50,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:26:50,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:26:50,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:50,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:26:50,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:50,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:26:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:26:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:50,201 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 11:26:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,290 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 11:26:50,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:26:50,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:26:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:50,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:26:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:26:50,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 11:26:50,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:50,401 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:26:50,401 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:26:50,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 11:26:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:26:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:26:50,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:50,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:50,421 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:50,421 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,423 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:26:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:26:50,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:50,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:50,425 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 11:26:50,425 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 11:26:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,427 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:26:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:26:50,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:50,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:50,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:50,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:26:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:26:50,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 11:26:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:50,430 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:26:50,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:26:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:26:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:26:50,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:50,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:50,432 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:50,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 11:26:50,433 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:50,433 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 11:26:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:50,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:50,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:26:50,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-23 11:26:50,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:26:50,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:26:50,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret4 := main(); {278#true} is VALID [2018-11-23 11:26:50,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:50,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:50,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {298#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {305#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:50,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 2048bv32); {279#false} is VALID [2018-11-23 11:26:50,817 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:26:50,817 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:26:50,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:26:50,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:26:50,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:26:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:50,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:51,031 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:26:51,032 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:26:51,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:26:51,032 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:26:51,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:26:51,033 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(bvslt main_~i~0 (_ bv2048 32))} assume !~bvslt32(~i~0, 2048bv32); {279#false} is VALID [2018-11-23 11:26:51,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {339#(bvslt main_~i~0 (_ bv2048 32))} is VALID [2018-11-23 11:26:51,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:51,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:51,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret4 := main(); {278#true} is VALID [2018-11-23 11:26:51,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:26:51,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:26:51,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {278#true} is VALID [2018-11-23 11:26:51,041 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:26:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:26:51,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:26:51,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:51,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:51,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:51,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:51,095 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-23 11:26:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,399 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:26:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:51,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:26:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:26:51,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:51,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:26:51,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:26:51,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:51,464 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:26:51,465 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:26:51,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:26:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:26:51,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:26:51,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:51,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:51,480 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:51,480 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,482 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:51,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:51,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:51,485 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:51,485 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,487 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:51,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:51,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:51,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:51,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:26:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:26:51,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:26:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:51,491 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:26:51,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:26:51,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:51,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:51,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:51,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 2 times [2018-11-23 11:26:51,495 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:51,496 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 11:26:51,513 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:51,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:51,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:51,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:51,764 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:26:51,765 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {483#true} is VALID [2018-11-23 11:26:51,765 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:26:51,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:26:51,766 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret4 := main(); {483#true} is VALID [2018-11-23 11:26:51,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:51,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:51,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {503#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:51,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:51,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {517#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:51,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {517#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:51,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {517#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:51,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:51,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {531#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:51,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {531#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 2048bv32); {484#false} is VALID [2018-11-23 11:26:51,794 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:26:51,794 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:26:51,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:26:51,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:26:51,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:26:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:51,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:52,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:26:52,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:26:52,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:26:52,086 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:26:52,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:26:52,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(bvslt main_~i~0 (_ bv2048 32))} assume !~bvslt32(~i~0, 2048bv32); {484#false} is VALID [2018-11-23 11:26:52,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {565#(bvslt main_~i~0 (_ bv2048 32))} is VALID [2018-11-23 11:26:52,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,102 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:52,104 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret4 := main(); {483#true} is VALID [2018-11-23 11:26:52,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:26:52,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:26:52,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {483#true} is VALID [2018-11-23 11:26:52,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:26:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:52,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:52,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:26:52,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:26:52,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:52,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:26:52,170 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 11:26:52,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:26:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:26:52,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:52,171 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-11-23 11:26:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:53,078 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:26:53,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:26:53,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:26:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:26:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:26:53,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2018-11-23 11:26:53,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:53,217 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:26:53,217 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:26:53,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:26:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:26:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:26:53,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:53,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:53,250 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:53,250 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:53,254 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:26:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:53,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:53,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:53,254 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:53,255 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:53,257 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:26:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:53,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:53,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:53,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:53,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:26:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:26:53,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:26:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:53,262 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:26:53,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:26:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:26:53,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:53,263 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:53,264 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:53,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 3 times [2018-11-23 11:26:53,265 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:53,265 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 11:26:53,282 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:53,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:26:53,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:53,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:54,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-23 11:26:54,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-23 11:26:54,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-23 11:26:54,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #35#return; {796#true} is VALID [2018-11-23 11:26:54,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret4 := main(); {796#true} is VALID [2018-11-23 11:26:54,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {816#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:54,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:54,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {830#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:54,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {830#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {830#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:54,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {830#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {844#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:54,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {844#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {844#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:54,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {844#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,287 INFO L273 TraceCheckUtils]: 16: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {858#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:54,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {858#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {858#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:54,303 INFO L273 TraceCheckUtils]: 19: Hoare triple {858#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {872#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:54,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {872#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {872#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:54,305 INFO L273 TraceCheckUtils]: 23: Hoare triple {872#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:54,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {886#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:26:54,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {886#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 2048bv32); {797#false} is VALID [2018-11-23 11:26:54,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {797#false} is VALID [2018-11-23 11:26:54,309 INFO L256 TraceCheckUtils]: 28: Hoare triple {797#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {797#false} is VALID [2018-11-23 11:26:54,309 INFO L273 TraceCheckUtils]: 29: Hoare triple {797#false} ~cond := #in~cond; {797#false} is VALID [2018-11-23 11:26:54,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} assume 0bv32 == ~cond; {797#false} is VALID [2018-11-23 11:26:54,310 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-23 11:26:54,314 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:54,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:54,936 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-23 11:26:54,936 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} assume 0bv32 == ~cond; {797#false} is VALID [2018-11-23 11:26:54,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {797#false} ~cond := #in~cond; {797#false} is VALID [2018-11-23 11:26:54,938 INFO L256 TraceCheckUtils]: 28: Hoare triple {797#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {797#false} is VALID [2018-11-23 11:26:54,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {797#false} is VALID [2018-11-23 11:26:54,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {920#(bvslt main_~i~0 (_ bv2048 32))} assume !~bvslt32(~i~0, 2048bv32); {797#false} is VALID [2018-11-23 11:26:54,940 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {920#(bvslt main_~i~0 (_ bv2048 32))} is VALID [2018-11-23 11:26:54,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,943 INFO L273 TraceCheckUtils]: 23: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,947 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,958 INFO L273 TraceCheckUtils]: 15: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,959 INFO L273 TraceCheckUtils]: 14: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} is VALID [2018-11-23 11:26:54,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret4 := main(); {796#true} is VALID [2018-11-23 11:26:54,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #35#return; {796#true} is VALID [2018-11-23 11:26:54,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-23 11:26:54,976 INFO L273 TraceCheckUtils]: 1: Hoare triple {796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {796#true} is VALID [2018-11-23 11:26:54,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-23 11:26:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:54,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:54,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:26:54,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:26:54,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:54,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:26:55,145 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 11:26:55,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:26:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:26:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:26:55,147 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-23 11:26:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:58,258 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 11:26:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:26:58,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:26:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 11:26:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 11:26:58,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 74 transitions. [2018-11-23 11:26:58,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:58,427 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:26:58,427 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:26:58,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:26:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:26:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:26:58,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:58,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:58,472 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:58,472 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:58,475 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:58,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:58,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:58,477 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:58,477 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:58,480 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:58,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:58,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:58,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:58,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:26:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:26:58,485 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:26:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:58,485 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:26:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:26:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:26:58,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:58,488 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:58,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:58,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:58,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 4 times [2018-11-23 11:26:58,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:58,489 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 11:26:58,509 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:26:58,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:26:58,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:58,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:59,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:26:59,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1325#true} is VALID [2018-11-23 11:26:59,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:26:59,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 11:26:59,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 11:26:59,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {1345#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:59,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {1345#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1345#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:59,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {1345#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,239 INFO L273 TraceCheckUtils]: 8: Hoare triple {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1359#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:59,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {1359#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1359#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:59,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1359#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1373#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:59,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1373#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1373#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:59,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1373#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1387#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:59,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1387#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:59,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1401#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:59,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {1401#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:59,248 INFO L273 TraceCheckUtils]: 23: Hoare triple {1401#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,249 INFO L273 TraceCheckUtils]: 25: Hoare triple {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1415#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:26:59,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {1415#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1415#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:26:59,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {1415#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,252 INFO L273 TraceCheckUtils]: 28: Hoare triple {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,252 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1429#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 11:26:59,265 INFO L273 TraceCheckUtils]: 30: Hoare triple {1429#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1429#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 11:26:59,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {1429#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1443#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 11:26:59,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {1443#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1443#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 11:26:59,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {1443#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1457#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 11:26:59,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1457#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 11:26:59,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {1457#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,275 INFO L273 TraceCheckUtils]: 41: Hoare triple {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1471#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 11:26:59,276 INFO L273 TraceCheckUtils]: 42: Hoare triple {1471#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1471#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 11:26:59,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {1471#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1485#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 11:26:59,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {1485#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1485#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 11:26:59,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {1485#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1499#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:59,296 INFO L273 TraceCheckUtils]: 50: Hoare triple {1499#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 2048bv32); {1326#false} is VALID [2018-11-23 11:26:59,296 INFO L273 TraceCheckUtils]: 51: Hoare triple {1326#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {1326#false} is VALID [2018-11-23 11:26:59,296 INFO L256 TraceCheckUtils]: 52: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {1326#false} is VALID [2018-11-23 11:26:59,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:26:59,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:26:59,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:26:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:59,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:27:01,349 INFO L273 TraceCheckUtils]: 55: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:27:01,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:27:01,350 INFO L273 TraceCheckUtils]: 53: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:27:01,350 INFO L256 TraceCheckUtils]: 52: Hoare triple {1326#false} call __VERIFIER_assert((if #t~mem2 != #t~mem3 then 1bv32 else 0bv32)); {1326#false} is VALID [2018-11-23 11:27:01,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {1326#false} call #t~mem2 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4096bv32, ~#A~0.offset), 4bv32);call #t~mem3 := read~intINTTYPE4(~#B~0.base, ~bvadd32(4096bv32, ~#B~0.offset), 4bv32); {1326#false} is VALID [2018-11-23 11:27:01,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {1533#(bvslt main_~i~0 (_ bv2048 32))} assume !~bvslt32(~i~0, 2048bv32); {1326#false} is VALID [2018-11-23 11:27:01,353 INFO L273 TraceCheckUtils]: 49: Hoare triple {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1533#(bvslt main_~i~0 (_ bv2048 32))} is VALID [2018-11-23 11:27:01,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,358 INFO L273 TraceCheckUtils]: 47: Hoare triple {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,359 INFO L273 TraceCheckUtils]: 46: Hoare triple {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,362 INFO L273 TraceCheckUtils]: 44: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,366 INFO L273 TraceCheckUtils]: 43: Hoare triple {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,372 INFO L273 TraceCheckUtils]: 41: Hoare triple {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,373 INFO L273 TraceCheckUtils]: 40: Hoare triple {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,377 INFO L273 TraceCheckUtils]: 38: Hoare triple {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,380 INFO L273 TraceCheckUtils]: 37: Hoare triple {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,380 INFO L273 TraceCheckUtils]: 36: Hoare triple {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,383 INFO L273 TraceCheckUtils]: 35: Hoare triple {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,389 INFO L273 TraceCheckUtils]: 33: Hoare triple {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,389 INFO L273 TraceCheckUtils]: 32: Hoare triple {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,413 INFO L273 TraceCheckUtils]: 18: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv2048 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv2048 32))} assume !!~bvslt32(~i~0, 2048bv32);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~tmp~0 := #t~mem1;havoc #t~mem1;call write~intINTTYPE4(~tmp~0, ~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;havoc ~tmp~0;~i~0 := 0bv32; {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv2048 32))} is VALID [2018-11-23 11:27:01,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret4 := main(); {1325#true} is VALID [2018-11-23 11:27:01,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 11:27:01,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:27:01,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1325#true} is VALID [2018-11-23 11:27:01,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:27:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:27:01,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:27:01,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:27:01,463 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-11-23 11:27:01,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:27:01,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:27:01,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:01,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:27:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:27:01,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:27:01,918 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 48 states. [2018-11-23 11:27:07,891 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:27:08,389 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:27:09,312 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:27:09,791 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:27:12,900 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:27:16,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:16,129 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-23 11:27:16,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:27:16,130 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-11-23 11:27:16,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 134 transitions. [2018-11-23 11:27:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 134 transitions. [2018-11-23 11:27:16,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 134 transitions. [2018-11-23 11:27:16,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:27:16,469 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:27:16,470 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:27:16,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:27:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:27:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 11:27:16,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:16,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:16,648 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:16,648 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:16,653 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:27:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:16,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:16,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:16,654 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:16,655 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:16,659 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:27:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:16,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:16,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:16,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:16,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:27:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-23 11:27:16,665 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2018-11-23 11:27:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:16,665 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-23 11:27:16,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:27:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:27:16,669 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:16,669 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:16,669 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:16,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 5 times [2018-11-23 11:27:16,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:16,671 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 11:27:16,708 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1