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-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:26:45,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:26:45,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:26:45,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:26:45,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:26:45,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:26:45,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:26:45,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:26:45,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:26:45,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:26:45,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:26:45,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:26:45,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:26:45,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:26:45,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:26:45,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:26:45,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:26:45,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:26:45,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:26:45,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:26:45,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:26:45,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:26:45,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:26:45,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:26:45,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:26:45,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:26:45,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:26:45,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:26:45,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:26:45,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:26:45,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:26:45,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:26:45,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:26:45,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:26:45,658 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:26:45,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:26:45,659 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:45,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:26:45,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:26:45,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:26:45,686 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:26:45,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:26:45,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:26:45,688 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:26:45,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:26:45,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:26:45,688 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:26:45,688 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:26:45,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:26:45,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:26:45,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:26:45,689 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:26:45,689 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:26:45,691 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:26:45,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:26:45,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:26:45,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:26:45,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:26:45,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:26:45,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:26:45,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:26:45,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:26:45,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:26:45,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:26:45,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:26:45,693 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:26:45,694 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:26:45,694 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:26:45,694 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:26:45,694 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:26:45,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:26:45,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:26:45,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:26:45,783 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:26:45,784 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:26:45,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-23 11:26:45,846 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcee7d63e/e30d58cf396647c0a8a160fb3be1ae4d/FLAG7c3c49c81 [2018-11-23 11:26:46,273 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:26:46,274 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call1_true-termination.i [2018-11-23 11:26:46,280 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcee7d63e/e30d58cf396647c0a8a160fb3be1ae4d/FLAG7c3c49c81 [2018-11-23 11:26:46,643 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcee7d63e/e30d58cf396647c0a8a160fb3be1ae4d [2018-11-23 11:26:46,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:26:46,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:26:46,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:46,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:26:46,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:26:46,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:46" (1/1) ... [2018-11-23 11:26:46,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423b3e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:46, skipping insertion in model container [2018-11-23 11:26:46,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:26:46" (1/1) ... [2018-11-23 11:26:46,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:26:46,704 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:26:46,939 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:46,947 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:26:46,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:26:47,010 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:26:47,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:47 WrapperNode [2018-11-23 11:26:47,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:26:47,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:47,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:26:47,012 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:26:47,024 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:47" (1/1) ... [2018-11-23 11:26:47,034 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:47" (1/1) ... [2018-11-23 11:26:47,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:26:47,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:26:47,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:26:47,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:26:47,057 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:47" (1/1) ... [2018-11-23 11:26:47,058 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:47" (1/1) ... [2018-11-23 11:26:47,061 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:47" (1/1) ... [2018-11-23 11:26:47,061 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:47" (1/1) ... [2018-11-23 11:26:47,084 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:47" (1/1) ... [2018-11-23 11:26:47,089 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:47" (1/1) ... [2018-11-23 11:26:47,090 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:47" (1/1) ... [2018-11-23 11:26:47,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:26:47,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:26:47,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:26:47,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:26:47,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:47" (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:47,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:26:47,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:26:47,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:26:47,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:26:47,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:26:47,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:26:47,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:26:47,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:26:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:26:47,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:26:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:26:47,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:26:47,689 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:26:47,689 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:26:47,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:47 BoogieIcfgContainer [2018-11-23 11:26:47,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:26:47,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:26:47,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:26:47,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:26:47,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:26:46" (1/3) ... [2018-11-23 11:26:47,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6421b74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:47, skipping insertion in model container [2018-11-23 11:26:47,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:26:47" (2/3) ... [2018-11-23 11:26:47,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6421b74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:26:47, skipping insertion in model container [2018-11-23 11:26:47,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:26:47" (3/3) ... [2018-11-23 11:26:47,700 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call1_true-termination.i [2018-11-23 11:26:47,711 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:26:47,719 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:26:47,738 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:26:47,771 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:26:47,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:26:47,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:26:47,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:26:47,773 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:26:47,773 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:26:47,773 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:26:47,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:26:47,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:26:47,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:26:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:26:47,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:47,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:47,801 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:47,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash -267856937, now seen corresponding path program 1 times [2018-11-23 11:26:47,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:47,813 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:47,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:47,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:47,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:26:47,984 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:47,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:26:47,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #35#return; {24#true} is VALID [2018-11-23 11:26:47,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-23 11:26:47,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {24#true} is VALID [2018-11-23 11:26:47,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-23 11:26:47,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {25#false} is VALID [2018-11-23 11:26:47,995 INFO L256 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {25#false} is VALID [2018-11-23 11:26:47,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-23 11:26:47,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:26:47,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:26:47,999 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:47,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:48,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:48,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:26:48,008 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:26:48,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:48,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:26:48,058 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:48,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:26:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:26:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:26:48,071 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 11:26:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,367 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:26:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:26:48,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 11:26:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:26:48,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:26:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-23 11:26:48,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-23 11:26:48,586 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:48,598 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:26:48,599 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:26:48,603 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:48,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:26:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:26:48,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:48,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:48,643 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:48,643 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,646 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:26:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:48,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:48,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:48,647 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:48,648 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:26:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:48,651 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 11:26:48,651 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:48,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:48,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:48,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:48,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 11:26:48,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 11:26:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:48,656 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 11:26:48,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:26:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 11:26:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:26:48,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:48,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:48,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:48,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:48,659 INFO L82 PathProgramCache]: Analyzing trace with hash -439631843, now seen corresponding path program 1 times [2018-11-23 11:26:48,659 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:48,659 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:48,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:48,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:48,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-23 11:26:48,810 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:48,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-23 11:26:48,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #35#return; {153#true} is VALID [2018-11-23 11:26:48,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret2 := main(); {153#true} is VALID [2018-11-23 11:26:48,814 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {173#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:48,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {173#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {154#false} is VALID [2018-11-23 11:26:48,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {154#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {154#false} is VALID [2018-11-23 11:26:48,815 INFO L256 TraceCheckUtils]: 8: Hoare triple {154#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {154#false} is VALID [2018-11-23 11:26:48,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-23 11:26:48,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} assume 0bv32 == ~cond; {154#false} is VALID [2018-11-23 11:26:48,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-23 11:26:48,817 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:48,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:26:48,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:26:48,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:26:48,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:26:48,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:48,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:26:48,864 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:48,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:26:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:26:48,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:26:48,865 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2018-11-23 11:26:49,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,021 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 11:26:49,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:26:49,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 11:26:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:26:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:26:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-11-23 11:26:49,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-11-23 11:26:49,089 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:49,090 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:26:49,091 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 11:26:49,092 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:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 11:26:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 11:26:49,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:49,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:49,114 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:49,114 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 11:26:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,116 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:26:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:26:49,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:49,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:49,117 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 11:26:49,117 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 11:26:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:49,119 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 11:26:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 11:26:49,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:49,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:49,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:49,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:26:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:26:49,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 11:26:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:49,123 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:26:49,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:26:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:26:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:26:49,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:49,124 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:49,124 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1874839487, now seen corresponding path program 1 times [2018-11-23 11:26:49,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:49,125 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:49,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:26:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:49,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:49,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:26:49,251 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:49,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:26:49,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:26:49,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret2 := main(); {278#true} is VALID [2018-11-23 11:26:49,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:49,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {298#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {298#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:49,255 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:49,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {279#false} is VALID [2018-11-23 11:26:49,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:26:49,257 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:26:49,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:26:49,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:26:49,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:26:49,260 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:49,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:49,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 11:26:49,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0bv32 == ~cond; {279#false} is VALID [2018-11-23 11:26:49,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 11:26:49,648 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {279#false} is VALID [2018-11-23 11:26:49,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {279#false} is VALID [2018-11-23 11:26:49,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {339#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {279#false} is VALID [2018-11-23 11:26:49,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {339#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:49,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:49,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {343#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:49,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret2 := main(); {278#true} is VALID [2018-11-23 11:26:49,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #35#return; {278#true} is VALID [2018-11-23 11:26:49,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 11:26:49,655 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:49,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 11:26:49,657 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:49,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:49,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:26:49,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:26:49,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:49,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:26:49,709 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:49,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:26:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:26:49,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:26:49,710 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-23 11:26:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,283 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:26:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:26:50,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 11:26:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:26:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:26:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:26:50,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:26:50,461 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:50,462 INFO L225 Difference]: With dead ends: 27 [2018-11-23 11:26:50,462 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:26:50,463 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:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:26:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:26:50,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:50,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:50,484 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:50,484 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,486 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:50,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:50,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:50,488 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:50,488 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:26:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:50,490 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:26:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:50,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:50,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:50,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:50,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:26:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:26:50,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:26:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:50,494 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:26:50,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:26:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:26:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:26:50,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:50,495 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:50,495 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:50,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:50,496 INFO L82 PathProgramCache]: Analyzing trace with hash 815274917, now seen corresponding path program 2 times [2018-11-23 11:26:50,496 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:50,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:50,516 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:50,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:50,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:50,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:50,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:26:50,681 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:50,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:26:50,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:26:50,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret2 := main(); {483#true} is VALID [2018-11-23 11:26:50,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:50,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {503#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:50,688 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:50,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {510#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:50,690 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:50,694 INFO L273 TraceCheckUtils]: 10: Hoare triple {517#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {517#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:50,704 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:50,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {524#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:50,705 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:50,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {531#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {484#false} is VALID [2018-11-23 11:26:50,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:26:50,706 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:26:50,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:26:50,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:26:50,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:26:50,708 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:50,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:51,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 11:26:51,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {484#false} assume 0bv32 == ~cond; {484#false} is VALID [2018-11-23 11:26:51,152 INFO L273 TraceCheckUtils]: 17: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 11:26:51,153 INFO L256 TraceCheckUtils]: 16: Hoare triple {484#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {484#false} is VALID [2018-11-23 11:26:51,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {484#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {484#false} is VALID [2018-11-23 11:26:51,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {565#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {484#false} is VALID [2018-11-23 11:26:51,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {565#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:51,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {576#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {583#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {590#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:51,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret2 := main(); {483#true} is VALID [2018-11-23 11:26:51,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #35#return; {483#true} is VALID [2018-11-23 11:26:51,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 11:26:51,169 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,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 11:26:51,170 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,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:51,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:26:51,172 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:26:51,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:51,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:26:51,227 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:51,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:26:51,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:26:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:26:51,228 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-11-23 11:26:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,875 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:26:51,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:26:51,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-11-23 11:26:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:26:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:26:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2018-11-23 11:26:51,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2018-11-23 11:26:51,972 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:51,975 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:26:51,975 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:26:51,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:26:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:26:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:26:51,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:51,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:51,994 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:51,994 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:51,997 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:26:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:51,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:51,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:51,998 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:51,998 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:26:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:52,001 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:26:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:52,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:52,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:52,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:52,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:26:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:26:52,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:26:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:52,005 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:26:52,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:26:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:26:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:26:52,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:52,007 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:52,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:52,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash 489362929, now seen corresponding path program 3 times [2018-11-23 11:26:52,008 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:52,008 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:52,028 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:26:52,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:26:52,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:52,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:52,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-23 11:26:52,805 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:52,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-23 11:26:52,806 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #35#return; {796#true} is VALID [2018-11-23 11:26:52,806 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret2 := main(); {796#true} is VALID [2018-11-23 11:26:52,806 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {816#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:52,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {816#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {816#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:52,808 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:52,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {823#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:52,810 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:52,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {830#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {830#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:52,812 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:52,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {837#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:52,818 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:52,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {844#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {844#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:52,821 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:52,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {851#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:52,828 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:52,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {858#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {858#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:52,830 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:52,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {865#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:52,833 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:52,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {872#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {872#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:52,836 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:52,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {879#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:52,837 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:52,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {886#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {797#false} is VALID [2018-11-23 11:26:52,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {797#false} is VALID [2018-11-23 11:26:52,839 INFO L256 TraceCheckUtils]: 28: Hoare triple {797#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {797#false} is VALID [2018-11-23 11:26:52,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {797#false} ~cond := #in~cond; {797#false} is VALID [2018-11-23 11:26:52,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} assume 0bv32 == ~cond; {797#false} is VALID [2018-11-23 11:26:52,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-23 11:26:52,844 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:52,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:53,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {797#false} assume !false; {797#false} is VALID [2018-11-23 11:26:53,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {797#false} assume 0bv32 == ~cond; {797#false} is VALID [2018-11-23 11:26:53,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {797#false} ~cond := #in~cond; {797#false} is VALID [2018-11-23 11:26:53,480 INFO L256 TraceCheckUtils]: 28: Hoare triple {797#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {797#false} is VALID [2018-11-23 11:26:53,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {797#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {797#false} is VALID [2018-11-23 11:26:53,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {920#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {797#false} is VALID [2018-11-23 11:26:53,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {920#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:53,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {924#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {931#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {938#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {945#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {952#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {959#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,507 INFO L273 TraceCheckUtils]: 12: Hoare triple {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,510 INFO L273 TraceCheckUtils]: 11: Hoare triple {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {966#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {980#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {796#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {987#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:53,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret2 := main(); {796#true} is VALID [2018-11-23 11:26:53,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #35#return; {796#true} is VALID [2018-11-23 11:26:53,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2018-11-23 11:26:53,519 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:53,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2018-11-23 11:26:53,524 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:53,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:53,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:26:53,529 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:26:53,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:53,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:26:53,673 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:53,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:26:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:26:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:26:53,674 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-23 11:26:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,386 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 11:26:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:26:56,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 11:26:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 11:26:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:26:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2018-11-23 11:26:56,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 74 transitions. [2018-11-23 11:26:56,548 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:56,550 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:26:56,551 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:26:56,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:26:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:26:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:26:56,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:56,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:56,623 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:56,623 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,626 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:56,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:56,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:56,628 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:56,628 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:26:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:56,631 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:26:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:56,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:56,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:56,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:56,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:26:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:26:56,636 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:26:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:56,636 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:26:56,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:26:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:26:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:26:56,638 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:56,639 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:56,639 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:56,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1038560119, now seen corresponding path program 4 times [2018-11-23 11:26:56,640 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:56,640 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:56,659 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:26:56,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:26:56,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:56,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:57,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:26:57,426 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:57,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:26:57,427 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 11:26:57,427 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret2 := main(); {1325#true} is VALID [2018-11-23 11:26:57,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {1345#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:57,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {1345#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1345#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:26:57,428 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:57,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1352#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,429 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:57,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {1359#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1359#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:26:57,430 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:57,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1366#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,431 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:57,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {1373#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1373#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:26:57,433 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:57,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1380#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,434 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:57,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1387#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:26:57,435 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:57,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1394#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,437 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:57,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {1401#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:26:57,438 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:57,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1408#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,440 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:57,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1415#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1415#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:26:57,441 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:57,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1422#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,442 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:57,443 INFO L273 TraceCheckUtils]: 30: Hoare triple {1429#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1429#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 11:26:57,444 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:57,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1436#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,445 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:57,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {1443#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1443#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 11:26:57,447 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:57,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1450#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,453 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:57,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1457#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 11:26:57,454 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:57,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1464#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,455 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:57,455 INFO L273 TraceCheckUtils]: 42: Hoare triple {1471#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1471#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 11:26:57,456 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:57,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1478#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,457 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:57,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {1485#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1485#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 11:26:57,464 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:57,465 INFO L273 TraceCheckUtils]: 48: Hoare triple {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1492#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:57,474 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:57,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {1499#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {1326#false} is VALID [2018-11-23 11:26:57,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {1326#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {1326#false} is VALID [2018-11-23 11:26:57,475 INFO L256 TraceCheckUtils]: 52: Hoare triple {1326#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {1326#false} is VALID [2018-11-23 11:26:57,475 INFO L273 TraceCheckUtils]: 53: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:26:57,476 INFO L273 TraceCheckUtils]: 54: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:26:57,476 INFO L273 TraceCheckUtils]: 55: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:26:57,481 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:57,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:59,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2018-11-23 11:26:59,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {1326#false} assume 0bv32 == ~cond; {1326#false} is VALID [2018-11-23 11:26:59,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {1326#false} ~cond := #in~cond; {1326#false} is VALID [2018-11-23 11:26:59,719 INFO L256 TraceCheckUtils]: 52: Hoare triple {1326#false} call __VERIFIER_assert((if 1023bv32 != #t~mem1 then 1bv32 else 0bv32)); {1326#false} is VALID [2018-11-23 11:26:59,719 INFO L273 TraceCheckUtils]: 51: Hoare triple {1326#false} call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(4092bv32, ~#A~0.offset), 4bv32); {1326#false} is VALID [2018-11-23 11:26:59,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {1533#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {1326#false} is VALID [2018-11-23 11:26:59,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1533#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-23 11:26:59,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,725 INFO L273 TraceCheckUtils]: 47: Hoare triple {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1537#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,728 INFO L273 TraceCheckUtils]: 45: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1544#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,729 INFO L273 TraceCheckUtils]: 44: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,733 INFO L273 TraceCheckUtils]: 43: Hoare triple {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1551#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,736 INFO L273 TraceCheckUtils]: 42: Hoare triple {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1558#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1565#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1572#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1579#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,756 INFO L273 TraceCheckUtils]: 33: Hoare triple {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1586#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,760 INFO L273 TraceCheckUtils]: 31: Hoare triple {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1593#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,760 INFO L273 TraceCheckUtils]: 30: Hoare triple {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1600#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,764 INFO L273 TraceCheckUtils]: 28: Hoare triple {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,768 INFO L273 TraceCheckUtils]: 27: Hoare triple {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1607#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1614#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1621#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1628#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,781 INFO L273 TraceCheckUtils]: 20: Hoare triple {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1635#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1642#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,795 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1649#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1656#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1663#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1670#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1677#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,820 INFO L273 TraceCheckUtils]: 6: Hoare triple {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(~i~0, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {1325#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(8192bv32);havoc ~i~0;~i~0 := 0bv32; {1684#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-23 11:26:59,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret2 := main(); {1325#true} is VALID [2018-11-23 11:26:59,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #35#return; {1325#true} is VALID [2018-11-23 11:26:59,821 INFO L273 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2018-11-23 11:26:59,821 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,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2018-11-23 11:26:59,827 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,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:26:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:26:59,831 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-11-23 11:26:59,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:26:59,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:27:00,107 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:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:27:00,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:27:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:27:00,109 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 48 states. [2018-11-23 11:27:05,030 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:27:05,489 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:27:05,980 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:27:06,507 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:27:07,000 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:27:12,731 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2018-11-23 11:27:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:13,409 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-23 11:27:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:27:13,409 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 56 [2018-11-23 11:27:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:27:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 134 transitions. [2018-11-23 11:27:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:27:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 134 transitions. [2018-11-23 11:27:13,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 134 transitions. [2018-11-23 11:27:13,718 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:13,723 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:27:13,723 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:27:13,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:27:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:27:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 11:27:13,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:27:13,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:13,789 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:13,789 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:13,794 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:27:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:13,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:13,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:13,795 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:13,795 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:27:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:27:13,800 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:27:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:13,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:27:13,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:27:13,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:27:13,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:27:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:27:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-23 11:27:13,806 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2018-11-23 11:27:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:27:13,806 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-23 11:27:13,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:27:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:27:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:27:13,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:27:13,810 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:27:13,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:27:13,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:27:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash 382171577, now seen corresponding path program 5 times [2018-11-23 11:27:13,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:27:13,811 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:13,844 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1