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/array-examples/standard_copy2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:54,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:54,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:54,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:54,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:54,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:54,700 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:54,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:54,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:54,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:54,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:54,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:54,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:54,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:54,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:54,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:54,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:54,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:54,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:54,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:54,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:54,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:54,727 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:54,727 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:54,727 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:54,728 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:54,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:54,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:54,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:54,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:54,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:54,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:54,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:54,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:54,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:54,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:54,736 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 09:54:54,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:54,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:54,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:54,757 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:54,757 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:54,757 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:54,758 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:54,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:54,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:54,758 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:54,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:54,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:54,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:54,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:54,760 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:54,760 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:54,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:54,761 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:54,761 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:54,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:54,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:54,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:54,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:54,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:54,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:54,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:54,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:54,764 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:54,764 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:54,765 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:54,765 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:54,765 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:54,765 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:54,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:54,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:54,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:54,850 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:54,850 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:54,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-23 09:54:54,918 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42b5c0d3/aa1db7e7556e4c54b3378a00ae7341d1/FLAGfc6c460d1 [2018-11-23 09:54:55,419 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,420 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_false-unreach-call_ground.i [2018-11-23 09:54:55,426 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42b5c0d3/aa1db7e7556e4c54b3378a00ae7341d1/FLAGfc6c460d1 [2018-11-23 09:54:55,759 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42b5c0d3/aa1db7e7556e4c54b3378a00ae7341d1 [2018-11-23 09:54:55,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:55,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:55,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:55,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:55,776 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:55,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb0fcf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:55, skipping insertion in model container [2018-11-23 09:54:55,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:55,812 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,068 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,133 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,232 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (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 09:54:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,026 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,026 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:54:57,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:55" (1/3) ... [2018-11-23 09:54:57,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fccf214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fccf214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,057 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy2_false-unreach-call_ground.i [2018-11-23 09:54:57,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,093 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,129 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,130 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,131 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,131 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,132 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,132 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,132 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,132 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 09:54:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:54:57,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash 415311520, now seen corresponding path program 1 times [2018-11-23 09:54:57,170 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,171 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 09:54:57,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 09:54:57,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 09:54:57,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 09:54:57,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-23 09:54:57,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret10 := main(); {33#true} is VALID [2018-11-23 09:54:57,502 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {33#true} is VALID [2018-11-23 09:54:57,503 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 09:54:57,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} havoc ~i~0;~i~0 := 0bv32; {34#false} is VALID [2018-11-23 09:54:57,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !~bvslt32(~i~0, 100000bv32); {34#false} is VALID [2018-11-23 09:54:57,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32; {34#false} is VALID [2018-11-23 09:54:57,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !~bvslt32(~i~0, 100000bv32); {34#false} is VALID [2018-11-23 09:54:57,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} havoc ~x~0;~x~0 := 0bv32; {34#false} is VALID [2018-11-23 09:54:57,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {34#false} is VALID [2018-11-23 09:54:57,505 INFO L256 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 09:54:57,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 09:54:57,506 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 09:54:57,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 09:54:57,510 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 09:54:57,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:57,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,521 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:54:57,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,646 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 09:54:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:57,867 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2018-11-23 09:54:57,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:57,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:54:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 09:54:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2018-11-23 09:54:57,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2018-11-23 09:54:58,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,138 INFO L225 Difference]: With dead ends: 52 [2018-11-23 09:54:58,138 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 09:54:58,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 09:54:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 09:54:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 09:54:58,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 09:54:58,189 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 09:54:58,190 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 09:54:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,194 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 09:54:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:54:58,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,196 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 09:54:58,196 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 09:54:58,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,201 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 09:54:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:54:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 09:54:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 09:54:58,207 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 09:54:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,208 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 09:54:58,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 09:54:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:54:58,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,210 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1687882214, now seen corresponding path program 1 times [2018-11-23 09:54:58,211 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,211 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 09:54:58,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:58,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-23 09:54:58,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {237#true} is VALID [2018-11-23 09:54:58,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-23 09:54:58,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #77#return; {237#true} is VALID [2018-11-23 09:54:58,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret10 := main(); {237#true} is VALID [2018-11-23 09:54:58,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {257#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:58,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {238#false} is VALID [2018-11-23 09:54:58,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {238#false} havoc ~i~0;~i~0 := 0bv32; {238#false} is VALID [2018-11-23 09:54:58,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {238#false} assume !~bvslt32(~i~0, 100000bv32); {238#false} is VALID [2018-11-23 09:54:58,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} ~i~0 := 0bv32; {238#false} is VALID [2018-11-23 09:54:58,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !~bvslt32(~i~0, 100000bv32); {238#false} is VALID [2018-11-23 09:54:58,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#false} havoc ~x~0;~x~0 := 0bv32; {238#false} is VALID [2018-11-23 09:54:58,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {238#false} is VALID [2018-11-23 09:54:58,386 INFO L256 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {238#false} is VALID [2018-11-23 09:54:58,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-23 09:54:58,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0bv32 == ~cond; {238#false} is VALID [2018-11-23 09:54:58,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-23 09:54:58,388 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 09:54:58,389 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:58,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:54:58,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:58,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:58,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:58,454 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-23 09:54:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,946 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 09:54:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:58,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:54:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 09:54:58,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-23 09:54:58,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-23 09:54:59,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,122 INFO L225 Difference]: With dead ends: 44 [2018-11-23 09:54:59,123 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 09:54:59,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 09:54:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 09:54:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 09:54:59,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:59,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 09:54:59,142 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 09:54:59,142 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 09:54:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,145 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 09:54:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 09:54:59,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,146 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 09:54:59,147 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 09:54:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,150 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 09:54:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 09:54:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:59,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:54:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 09:54:59,154 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2018-11-23 09:54:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:59,154 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 09:54:59,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:54:59,155 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 09:54:59,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:54:59,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:59,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:59,156 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:59,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:59,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1114616120, now seen corresponding path program 1 times [2018-11-23 09:54:59,157 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:59,157 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 09:54:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:59,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 09:54:59,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 09:54:59,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 09:54:59,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #77#return; {441#true} is VALID [2018-11-23 09:54:59,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret10 := main(); {441#true} is VALID [2018-11-23 09:54:59,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {461#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {461#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {468#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:54:59,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#false} havoc ~i~0;~i~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~i~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} havoc ~x~0;~x~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {442#false} is VALID [2018-11-23 09:54:59,425 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-23 09:54:59,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 09:54:59,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-23 09:54:59,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 09:54:59,427 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 09:54:59,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:54:59,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 09:54:59,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume 0bv32 == ~cond; {442#false} is VALID [2018-11-23 09:54:59,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-23 09:54:59,530 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-23 09:54:59,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {442#false} is VALID [2018-11-23 09:54:59,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} havoc ~x~0;~x~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~i~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#false} assume !~bvslt32(~i~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#false} havoc ~i~0;~i~0 := 0bv32; {442#false} is VALID [2018-11-23 09:54:59,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {532#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {442#false} is VALID [2018-11-23 09:54:59,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {532#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:54:59,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {536#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:54:59,547 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret10 := main(); {441#true} is VALID [2018-11-23 09:54:59,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #77#return; {441#true} is VALID [2018-11-23 09:54:59,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 09:54:59,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 09:54:59,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 09:54:59,551 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 09:54:59,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:54:59,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:54:59,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 09:54:59,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:54:59,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:54:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:54:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:54:59,609 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-11-23 09:55:00,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,188 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 09:55:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:00,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 09:55:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 09:55:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2018-11-23 09:55:00,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2018-11-23 09:55:00,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,444 INFO L225 Difference]: With dead ends: 49 [2018-11-23 09:55:00,444 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 09:55:00,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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 09:55:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 09:55:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 09:55:00,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 09:55:00,468 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 09:55:00,468 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 09:55:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,471 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 09:55:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 09:55:00,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,472 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 09:55:00,472 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 09:55:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,476 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 09:55:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 09:55:00,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 09:55:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 09:55:00,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2018-11-23 09:55:00,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,480 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 09:55:00,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 09:55:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:55:00,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash -933132910, now seen corresponding path program 2 times [2018-11-23 09:55:00,482 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,483 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 09:55:00,504 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:00,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:00,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {740#true} call ULTIMATE.init(); {740#true} is VALID [2018-11-23 09:55:00,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {740#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {740#true} is VALID [2018-11-23 09:55:00,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {740#true} assume true; {740#true} is VALID [2018-11-23 09:55:00,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {740#true} {740#true} #77#return; {740#true} is VALID [2018-11-23 09:55:00,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {740#true} call #t~ret10 := main(); {740#true} is VALID [2018-11-23 09:55:00,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {740#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {740#true} is VALID [2018-11-23 09:55:00,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {740#true} is VALID [2018-11-23 09:55:00,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 09:55:00,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {740#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {740#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 09:55:00,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {740#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {740#true} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {740#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {740#true} is VALID [2018-11-23 09:55:00,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {740#true} assume !~bvslt32(~a~0, 100000bv32); {740#true} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {740#true} havoc ~i~0;~i~0 := 0bv32; {790#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {790#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {741#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {741#false} ~i~0 := 0bv32; {741#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {741#false} assume !~bvslt32(~i~0, 100000bv32); {741#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {741#false} havoc ~x~0;~x~0 := 0bv32; {741#false} is VALID [2018-11-23 09:55:00,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {741#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {741#false} is VALID [2018-11-23 09:55:00,638 INFO L256 TraceCheckUtils]: 21: Hoare triple {741#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {741#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {741#false} ~cond := #in~cond; {741#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {741#false} assume 0bv32 == ~cond; {741#false} is VALID [2018-11-23 09:55:00,638 INFO L273 TraceCheckUtils]: 24: Hoare triple {741#false} assume !false; {741#false} is VALID [2018-11-23 09:55:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 09:55:00,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:00,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:00,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:00,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 09:55:00,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:00,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,674 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 3 states. [2018-11-23 09:55:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,830 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 09:55:00,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:00,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 09:55:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 09:55:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 09:55:00,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 09:55:00,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,953 INFO L225 Difference]: With dead ends: 50 [2018-11-23 09:55:00,953 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:55:00,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 09:55:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:55:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 09:55:00,970 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-23 09:55:00,970 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-23 09:55:00,970 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-23 09:55:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,974 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 09:55:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 09:55:00,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,975 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-23 09:55:00,975 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-23 09:55:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,978 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-23 09:55:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 09:55:00,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 09:55:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 09:55:00,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-11-23 09:55:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,981 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 09:55:00,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 09:55:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:55:00,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,983 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1532326002, now seen corresponding path program 1 times [2018-11-23 09:55:00,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,986 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 09:55:01,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 09:55:01,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1009#true} is VALID [2018-11-23 09:55:01,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 09:55:01,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #77#return; {1009#true} is VALID [2018-11-23 09:55:01,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret10 := main(); {1009#true} is VALID [2018-11-23 09:55:01,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1029#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {1029#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1029#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {1029#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1036#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:01,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {1036#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1036#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:01,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {1036#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1043#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:01,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {1043#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1043#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:01,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {1043#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1050#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:01,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {1050#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1050#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:01,203 INFO L273 TraceCheckUtils]: 13: Hoare triple {1050#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1057#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:01,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {1057#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#false} havoc ~i~0;~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,204 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1010#false} is VALID [2018-11-23 09:55:01,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1010#false} is VALID [2018-11-23 09:55:01,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#false} ~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1010#false} is VALID [2018-11-23 09:55:01,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1010#false} is VALID [2018-11-23 09:55:01,206 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} havoc ~x~0;~x~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1010#false} is VALID [2018-11-23 09:55:01,207 INFO L256 TraceCheckUtils]: 25: Hoare triple {1010#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {1010#false} is VALID [2018-11-23 09:55:01,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 09:55:01,207 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#false} assume 0bv32 == ~cond; {1010#false} is VALID [2018-11-23 09:55:01,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 09:55:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:55:01,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:01,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {1010#false} assume !false; {1010#false} is VALID [2018-11-23 09:55:01,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {1010#false} assume 0bv32 == ~cond; {1010#false} is VALID [2018-11-23 09:55:01,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {1010#false} ~cond := #in~cond; {1010#false} is VALID [2018-11-23 09:55:01,415 INFO L256 TraceCheckUtils]: 25: Hoare triple {1010#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {1010#false} is VALID [2018-11-23 09:55:01,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {1010#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1010#false} is VALID [2018-11-23 09:55:01,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {1010#false} havoc ~x~0;~x~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {1010#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1010#false} is VALID [2018-11-23 09:55:01,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1010#false} is VALID [2018-11-23 09:55:01,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {1010#false} ~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,418 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#false} assume !~bvslt32(~i~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {1010#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1010#false} is VALID [2018-11-23 09:55:01,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1010#false} is VALID [2018-11-23 09:55:01,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {1010#false} havoc ~i~0;~i~0 := 0bv32; {1010#false} is VALID [2018-11-23 09:55:01,421 INFO L273 TraceCheckUtils]: 14: Hoare triple {1145#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1010#false} is VALID [2018-11-23 09:55:01,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:01,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1149#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1156#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1163#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {1009#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1170#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:01,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {1009#true} call #t~ret10 := main(); {1009#true} is VALID [2018-11-23 09:55:01,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1009#true} {1009#true} #77#return; {1009#true} is VALID [2018-11-23 09:55:01,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {1009#true} assume true; {1009#true} is VALID [2018-11-23 09:55:01,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {1009#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1009#true} is VALID [2018-11-23 09:55:01,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {1009#true} call ULTIMATE.init(); {1009#true} is VALID [2018-11-23 09:55:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:55:01,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:01,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:01,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 09:55:01,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:01,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:01,545 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2018-11-23 09:55:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,692 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2018-11-23 09:55:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:02,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 09:55:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 09:55:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 72 transitions. [2018-11-23 09:55:02,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 72 transitions. [2018-11-23 09:55:02,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,867 INFO L225 Difference]: With dead ends: 65 [2018-11-23 09:55:02,868 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 09:55:02,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 09:55:02,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 09:55:02,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:02,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 09:55:02,900 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 09:55:02,900 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 09:55:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,903 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 09:55:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 09:55:02,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,904 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 09:55:02,905 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 09:55:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,907 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 09:55:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 09:55:02,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:02,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:55:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-11-23 09:55:02,911 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 29 [2018-11-23 09:55:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:02,912 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-11-23 09:55:02,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-11-23 09:55:02,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 09:55:02,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:02,914 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:02,914 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:02,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2035030978, now seen corresponding path program 2 times [2018-11-23 09:55:02,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:02,915 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 09:55:02,947 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:03,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:03,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:03,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:03,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-23 09:55:03,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-23 09:55:03,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-23 09:55:03,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #77#return; {1456#true} is VALID [2018-11-23 09:55:03,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret10 := main(); {1456#true} is VALID [2018-11-23 09:55:03,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1456#true} is VALID [2018-11-23 09:55:03,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,159 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#true} assume !~bvslt32(~a~0, 100000bv32); {1456#true} is VALID [2018-11-23 09:55:03,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#true} havoc ~i~0;~i~0 := 0bv32; {1456#true} is VALID [2018-11-23 09:55:03,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1456#true} is VALID [2018-11-23 09:55:03,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1456#true} is VALID [2018-11-23 09:55:03,163 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#true} assume !~bvslt32(~i~0, 100000bv32); {1456#true} is VALID [2018-11-23 09:55:03,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#true} ~i~0 := 0bv32; {1554#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:03,165 INFO L273 TraceCheckUtils]: 32: Hoare triple {1554#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1554#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:03,166 INFO L273 TraceCheckUtils]: 33: Hoare triple {1554#(= main_~i~0 (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:03,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {1561#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1457#false} is VALID [2018-11-23 09:55:03,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {1457#false} havoc ~x~0;~x~0 := 0bv32; {1457#false} is VALID [2018-11-23 09:55:03,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {1457#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1457#false} is VALID [2018-11-23 09:55:03,168 INFO L256 TraceCheckUtils]: 37: Hoare triple {1457#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {1457#false} is VALID [2018-11-23 09:55:03,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#false} ~cond := #in~cond; {1457#false} is VALID [2018-11-23 09:55:03,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {1457#false} assume 0bv32 == ~cond; {1457#false} is VALID [2018-11-23 09:55:03,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-23 09:55:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 09:55:03,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:03,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {1457#false} assume !false; {1457#false} is VALID [2018-11-23 09:55:03,261 INFO L273 TraceCheckUtils]: 39: Hoare triple {1457#false} assume 0bv32 == ~cond; {1457#false} is VALID [2018-11-23 09:55:03,262 INFO L273 TraceCheckUtils]: 38: Hoare triple {1457#false} ~cond := #in~cond; {1457#false} is VALID [2018-11-23 09:55:03,262 INFO L256 TraceCheckUtils]: 37: Hoare triple {1457#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {1457#false} is VALID [2018-11-23 09:55:03,262 INFO L273 TraceCheckUtils]: 36: Hoare triple {1457#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1457#false} is VALID [2018-11-23 09:55:03,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {1457#false} havoc ~x~0;~x~0 := 0bv32; {1457#false} is VALID [2018-11-23 09:55:03,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {1601#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1457#false} is VALID [2018-11-23 09:55:03,264 INFO L273 TraceCheckUtils]: 33: Hoare triple {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1601#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:03,271 INFO L273 TraceCheckUtils]: 32: Hoare triple {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {1456#true} ~i~0 := 0bv32; {1605#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:03,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {1456#true} assume !~bvslt32(~i~0, 100000bv32); {1456#true} is VALID [2018-11-23 09:55:03,272 INFO L273 TraceCheckUtils]: 29: Hoare triple {1456#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1456#true} is VALID [2018-11-23 09:55:03,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {1456#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1456#true} is VALID [2018-11-23 09:55:03,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {1456#true} havoc ~i~0;~i~0 := 0bv32; {1456#true} is VALID [2018-11-23 09:55:03,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {1456#true} assume !~bvslt32(~a~0, 100000bv32); {1456#true} is VALID [2018-11-23 09:55:03,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,275 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,275 INFO L273 TraceCheckUtils]: 20: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,275 INFO L273 TraceCheckUtils]: 19: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {1456#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1456#true} is VALID [2018-11-23 09:55:03,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {1456#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1456#true} is VALID [2018-11-23 09:55:03,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1456#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1456#true} is VALID [2018-11-23 09:55:03,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {1456#true} call #t~ret10 := main(); {1456#true} is VALID [2018-11-23 09:55:03,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1456#true} {1456#true} #77#return; {1456#true} is VALID [2018-11-23 09:55:03,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {1456#true} assume true; {1456#true} is VALID [2018-11-23 09:55:03,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1456#true} is VALID [2018-11-23 09:55:03,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {1456#true} call ULTIMATE.init(); {1456#true} is VALID [2018-11-23 09:55:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-23 09:55:03,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:03,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:55:03,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 09:55:03,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:03,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:55:03,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:03,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:55:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:55:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:55:03,370 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2018-11-23 09:55:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,773 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 09:55:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:55:03,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-23 09:55:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 09:55:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:55:03,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 09:55:03,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 09:55:03,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:03,916 INFO L225 Difference]: With dead ends: 73 [2018-11-23 09:55:03,916 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 09:55:03,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 09:55:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 09:55:03,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:03,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:03,965 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:03,965 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,967 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 09:55:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 09:55:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:03,968 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:03,969 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 09:55:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,971 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-11-23 09:55:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 09:55:03,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:03,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:03,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:03,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 09:55:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-23 09:55:03,976 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 41 [2018-11-23 09:55:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:03,976 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-23 09:55:03,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:55:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-23 09:55:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 09:55:03,978 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:03,978 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:03,978 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:03,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2090600522, now seen corresponding path program 3 times [2018-11-23 09:55:03,979 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:03,979 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 09:55:04,010 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:04,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 09:55:04,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:04,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:04,394 INFO L256 TraceCheckUtils]: 0: Hoare triple {2018#true} call ULTIMATE.init(); {2018#true} is VALID [2018-11-23 09:55:04,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {2018#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2018#true} is VALID [2018-11-23 09:55:04,395 INFO L273 TraceCheckUtils]: 2: Hoare triple {2018#true} assume true; {2018#true} is VALID [2018-11-23 09:55:04,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2018#true} {2018#true} #77#return; {2018#true} is VALID [2018-11-23 09:55:04,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {2018#true} call #t~ret10 := main(); {2018#true} is VALID [2018-11-23 09:55:04,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {2018#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2018#true} is VALID [2018-11-23 09:55:04,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,400 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,401 INFO L273 TraceCheckUtils]: 21: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,401 INFO L273 TraceCheckUtils]: 24: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 26: Hoare triple {2018#true} assume !~bvslt32(~a~0, 100000bv32); {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 27: Hoare triple {2018#true} havoc ~i~0;~i~0 := 0bv32; {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {2018#true} assume !~bvslt32(~i~0, 100000bv32); {2018#true} is VALID [2018-11-23 09:55:04,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {2018#true} ~i~0 := 0bv32; {2134#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,405 INFO L273 TraceCheckUtils]: 38: Hoare triple {2134#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2134#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,405 INFO L273 TraceCheckUtils]: 39: Hoare triple {2134#(= main_~i~0 (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:04,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:04,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2148#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:55:04,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {2148#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2148#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:55:04,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {2148#(= (_ bv2 32) main_~i~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:04,408 INFO L273 TraceCheckUtils]: 44: Hoare triple {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:04,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {2155#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2162#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:55:04,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {2162#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {2019#false} is VALID [2018-11-23 09:55:04,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {2019#false} havoc ~x~0;~x~0 := 0bv32; {2019#false} is VALID [2018-11-23 09:55:04,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {2019#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2019#false} is VALID [2018-11-23 09:55:04,411 INFO L256 TraceCheckUtils]: 49: Hoare triple {2019#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {2019#false} is VALID [2018-11-23 09:55:04,411 INFO L273 TraceCheckUtils]: 50: Hoare triple {2019#false} ~cond := #in~cond; {2019#false} is VALID [2018-11-23 09:55:04,411 INFO L273 TraceCheckUtils]: 51: Hoare triple {2019#false} assume 0bv32 == ~cond; {2019#false} is VALID [2018-11-23 09:55:04,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {2019#false} assume !false; {2019#false} is VALID [2018-11-23 09:55:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 09:55:04,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:04,659 INFO L273 TraceCheckUtils]: 52: Hoare triple {2019#false} assume !false; {2019#false} is VALID [2018-11-23 09:55:04,660 INFO L273 TraceCheckUtils]: 51: Hoare triple {2019#false} assume 0bv32 == ~cond; {2019#false} is VALID [2018-11-23 09:55:04,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {2019#false} ~cond := #in~cond; {2019#false} is VALID [2018-11-23 09:55:04,660 INFO L256 TraceCheckUtils]: 49: Hoare triple {2019#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {2019#false} is VALID [2018-11-23 09:55:04,661 INFO L273 TraceCheckUtils]: 48: Hoare triple {2019#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2019#false} is VALID [2018-11-23 09:55:04,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {2019#false} havoc ~x~0;~x~0 := 0bv32; {2019#false} is VALID [2018-11-23 09:55:04,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {2202#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2019#false} is VALID [2018-11-23 09:55:04,663 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2202#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:04,663 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2206#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2213#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,678 INFO L273 TraceCheckUtils]: 40: Hoare triple {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2220#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,686 INFO L273 TraceCheckUtils]: 37: Hoare triple {2018#true} ~i~0 := 0bv32; {2227#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:04,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {2018#true} assume !~bvslt32(~i~0, 100000bv32); {2018#true} is VALID [2018-11-23 09:55:04,686 INFO L273 TraceCheckUtils]: 35: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,686 INFO L273 TraceCheckUtils]: 34: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {2018#true} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2018#true} is VALID [2018-11-23 09:55:04,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {2018#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2018#true} is VALID [2018-11-23 09:55:04,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {2018#true} havoc ~i~0;~i~0 := 0bv32; {2018#true} is VALID [2018-11-23 09:55:04,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {2018#true} assume !~bvslt32(~a~0, 100000bv32); {2018#true} is VALID [2018-11-23 09:55:04,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {2018#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2018#true} is VALID [2018-11-23 09:55:04,692 INFO L273 TraceCheckUtils]: 6: Hoare triple {2018#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2018#true} is VALID [2018-11-23 09:55:04,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {2018#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2018#true} is VALID [2018-11-23 09:55:04,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {2018#true} call #t~ret10 := main(); {2018#true} is VALID [2018-11-23 09:55:04,692 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2018#true} {2018#true} #77#return; {2018#true} is VALID [2018-11-23 09:55:04,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {2018#true} assume true; {2018#true} is VALID [2018-11-23 09:55:04,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {2018#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2018#true} is VALID [2018-11-23 09:55:04,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {2018#true} call ULTIMATE.init(); {2018#true} is VALID [2018-11-23 09:55:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-23 09:55:04,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:04,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:55:04,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 09:55:04,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:04,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:55:04,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:55:04,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:55:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:55:04,778 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 12 states. [2018-11-23 09:55:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:06,468 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2018-11-23 09:55:06,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:55:06,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-11-23 09:55:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-23 09:55:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:55:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2018-11-23 09:55:06,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2018-11-23 09:55:06,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:06,810 INFO L225 Difference]: With dead ends: 103 [2018-11-23 09:55:06,810 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 09:55:06,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:55:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 09:55:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-23 09:55:06,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:06,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:06,846 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:06,846 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:06,849 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 09:55:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 09:55:06,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:06,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:06,849 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:06,849 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-23 09:55:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:06,852 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-23 09:55:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 09:55:06,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:06,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:06,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:06,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 09:55:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-23 09:55:06,856 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 53 [2018-11-23 09:55:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:06,857 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-23 09:55:06,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:55:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-23 09:55:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 09:55:06,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:06,859 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:06,859 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:06,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1161882210, now seen corresponding path program 4 times [2018-11-23 09:55:06,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:06,860 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:06,884 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:55:07,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:55:07,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:07,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:07,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 09:55:07,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-23 09:55:07,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 09:55:07,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #77#return; {2796#true} is VALID [2018-11-23 09:55:07,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret10 := main(); {2796#true} is VALID [2018-11-23 09:55:07,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2816#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:07,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {2816#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2816#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 09:55:07,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {2816#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2823#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:07,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {2823#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2823#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 09:55:07,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {2823#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2830#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:07,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {2830#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2830#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 09:55:07,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {2830#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2837#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:07,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {2837#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2837#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 09:55:07,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {2837#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2844#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:07,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {2844#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2844#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 09:55:07,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {2844#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2851#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:07,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {2851#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2851#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 09:55:07,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {2851#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2858#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:07,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {2858#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2858#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 09:55:07,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {2858#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2865#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:07,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {2865#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2865#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 09:55:07,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {2865#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2872#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:07,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {2872#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2872#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 09:55:07,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {2872#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2879#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:07,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {2879#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2879#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 09:55:07,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {2879#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2886#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 09:55:07,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {2886#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:07,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#false} havoc ~i~0;~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:07,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,493 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,493 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,494 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,494 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,496 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,496 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,497 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,497 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,497 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,497 INFO L273 TraceCheckUtils]: 44: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,497 INFO L273 TraceCheckUtils]: 45: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,498 INFO L273 TraceCheckUtils]: 46: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:07,498 INFO L273 TraceCheckUtils]: 47: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:07,498 INFO L273 TraceCheckUtils]: 48: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:07,498 INFO L273 TraceCheckUtils]: 49: Hoare triple {2797#false} ~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:07,498 INFO L273 TraceCheckUtils]: 50: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,499 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,499 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,499 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,499 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,500 INFO L273 TraceCheckUtils]: 56: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,500 INFO L273 TraceCheckUtils]: 57: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,500 INFO L273 TraceCheckUtils]: 58: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,500 INFO L273 TraceCheckUtils]: 59: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,500 INFO L273 TraceCheckUtils]: 60: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,501 INFO L273 TraceCheckUtils]: 61: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,501 INFO L273 TraceCheckUtils]: 64: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,501 INFO L273 TraceCheckUtils]: 65: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,502 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,502 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,502 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:07,502 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:07,502 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:07,503 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:07,503 INFO L273 TraceCheckUtils]: 72: Hoare triple {2797#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2797#false} is VALID [2018-11-23 09:55:07,503 INFO L256 TraceCheckUtils]: 73: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {2797#false} is VALID [2018-11-23 09:55:07,503 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 09:55:07,503 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume 0bv32 == ~cond; {2797#false} is VALID [2018-11-23 09:55:07,504 INFO L273 TraceCheckUtils]: 76: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 09:55:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 09:55:07,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:08,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-23 09:55:08,139 INFO L273 TraceCheckUtils]: 75: Hoare triple {2797#false} assume 0bv32 == ~cond; {2797#false} is VALID [2018-11-23 09:55:08,139 INFO L273 TraceCheckUtils]: 74: Hoare triple {2797#false} ~cond := #in~cond; {2797#false} is VALID [2018-11-23 09:55:08,139 INFO L256 TraceCheckUtils]: 73: Hoare triple {2797#false} call __VERIFIER_assert((if #t~mem8 == #t~mem9 then 1bv32 else 0bv32)); {2797#false} is VALID [2018-11-23 09:55:08,139 INFO L273 TraceCheckUtils]: 72: Hoare triple {2797#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem9 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2797#false} is VALID [2018-11-23 09:55:08,140 INFO L273 TraceCheckUtils]: 71: Hoare triple {2797#false} havoc ~x~0;~x~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:08,140 INFO L273 TraceCheckUtils]: 70: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:08,140 INFO L273 TraceCheckUtils]: 69: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 63: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,141 INFO L273 TraceCheckUtils]: 62: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 61: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 60: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 59: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 58: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,142 INFO L273 TraceCheckUtils]: 55: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 50: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {2797#false} ~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:08,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {2797#false} assume !~bvslt32(~i~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 47: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,144 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 31: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {2797#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {2797#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2797#false} is VALID [2018-11-23 09:55:08,146 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#false} havoc ~i~0;~i~0 := 0bv32; {2797#false} is VALID [2018-11-23 09:55:08,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {3190#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2797#false} is VALID [2018-11-23 09:55:08,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3190#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:08,148 INFO L273 TraceCheckUtils]: 24: Hoare triple {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3194#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3201#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,171 INFO L273 TraceCheckUtils]: 20: Hoare triple {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3208#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3215#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3222#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3229#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3236#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3250#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3257#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:08,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret10 := main(); {2796#true} is VALID [2018-11-23 09:55:08,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #77#return; {2796#true} is VALID [2018-11-23 09:55:08,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-23 09:55:08,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-23 09:55:08,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-23 09:55:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 09:55:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:55:08,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 09:55:08,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:08,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:55:08,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:08,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:55:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:55:08,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:55:08,375 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 24 states. [2018-11-23 09:55:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,327 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-11-23 09:55:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:55:12,328 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-11-23 09:55:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2018-11-23 09:55:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:55:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 102 transitions. [2018-11-23 09:55:12,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 102 transitions. [2018-11-23 09:55:12,548 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 09:55:12,550 INFO L225 Difference]: With dead ends: 161 [2018-11-23 09:55:12,550 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 09:55:12,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 131 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 09:55:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 09:55:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 09:55:12,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:12,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 106 states. [2018-11-23 09:55:12,631 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 09:55:12,631 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 09:55:12,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,635 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-23 09:55:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 09:55:12,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,635 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 106 states. [2018-11-23 09:55:12,635 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 106 states. [2018-11-23 09:55:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,639 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-11-23 09:55:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 09:55:12,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:12,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 09:55:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2018-11-23 09:55:12,643 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 77 [2018-11-23 09:55:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:12,643 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2018-11-23 09:55:12,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:55:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2018-11-23 09:55:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-23 09:55:12,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:12,645 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:12,645 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:12,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1973940218, now seen corresponding path program 5 times [2018-11-23 09:55:12,646 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:12,669 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1