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_two_index_07_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:13:40,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:13:40,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:13:40,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:13:40,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:13:40,519 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:13:40,521 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:13:40,523 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:13:40,526 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:13:40,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:13:40,531 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:13:40,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:13:40,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:13:40,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:13:40,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:13:40,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:13:40,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:13:40,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:13:40,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:13:40,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:13:40,559 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:13:40,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:13:40,564 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:13:40,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:13:40,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:13:40,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:13:40,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:13:40,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:13:40,569 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:13:40,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:13:40,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:13:40,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:13:40,573 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:13:40,573 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:13:40,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:13:40,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:13:40,578 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:13:40,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:13:40,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:13:40,604 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:13:40,604 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:13:40,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:13:40,605 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:13:40,605 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:13:40,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:13:40,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:13:40,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:13:40,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:13:40,606 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:13:40,607 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:13:40,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:13:40,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:13:40,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:13:40,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:13:40,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:13:40,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:13:40,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:40,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:13:40,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:13:40,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:13:40,611 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:13:40,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:13:40,611 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:13:40,612 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:13:40,612 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:13:40,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:13:40,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:13:40,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:13:40,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:13:40,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:13:40,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_07_true-unreach-call.i [2018-11-23 10:13:40,763 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b1986b2/5b6865c99e2f4d6e8856e00c349f4648/FLAGea8f57a03 [2018-11-23 10:13:41,207 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:13:41,207 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_07_true-unreach-call.i [2018-11-23 10:13:41,216 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b1986b2/5b6865c99e2f4d6e8856e00c349f4648/FLAGea8f57a03 [2018-11-23 10:13:41,575 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b1986b2/5b6865c99e2f4d6e8856e00c349f4648 [2018-11-23 10:13:41,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:13:41,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:13:41,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:41,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:13:41,592 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:13:41,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:41,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c25f363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41, skipping insertion in model container [2018-11-23 10:13:41,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:41,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:13:41,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:13:41,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:41,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:13:41,950 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:13:41,979 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:13:41,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41 WrapperNode [2018-11-23 10:13:41,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:13:41,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:41,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:13:41,981 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:13:41,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:13:42,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:13:42,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:13:42,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:13:42,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,052 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... [2018-11-23 10:13:42,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:13:42,055 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:13:42,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:13:42,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:13:42,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:13:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:13:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:13:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:13:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:13:42,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:13:42,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:13:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:13:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:13:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:13:42,198 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:13:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:13:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:13:42,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:13:42,780 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:13:42,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:42 BoogieIcfgContainer [2018-11-23 10:13:42,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:13:42,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:13:42,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:13:42,786 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:13:42,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:13:41" (1/3) ... [2018-11-23 10:13:42,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d907cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:42, skipping insertion in model container [2018-11-23 10:13:42,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:13:41" (2/3) ... [2018-11-23 10:13:42,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d907cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:13:42, skipping insertion in model container [2018-11-23 10:13:42,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:13:42" (3/3) ... [2018-11-23 10:13:42,791 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_07_true-unreach-call.i [2018-11-23 10:13:42,803 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:13:42,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:13:42,833 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:13:42,865 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:13:42,866 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:13:42,866 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:13:42,866 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:13:42,867 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:13:42,867 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:13:42,867 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:13:42,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:13:42,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:13:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:13:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:42,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:42,897 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:42,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2029643862, now seen corresponding path program 1 times [2018-11-23 10:13:42,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:42,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:43,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:43,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:13:43,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 10:13:43,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:13:43,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #60#return; {27#true} is VALID [2018-11-23 10:13:43,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret4 := main(); {27#true} is VALID [2018-11-23 10:13:43,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 10:13:43,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:13:43,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 1bv32; {28#false} is VALID [2018-11-23 10:13:43,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !~bvslt32(~i~0, 100000bv32); {28#false} is VALID [2018-11-23 10:13:43,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} ~i~0 := 1bv32;~j~0 := 0bv32; {28#false} is VALID [2018-11-23 10:13:43,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {28#false} is VALID [2018-11-23 10:13:43,103 INFO L256 TraceCheckUtils]: 11: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:13:43,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:13:43,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:13:43,104 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:13:43,108 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 10:13:43,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:13:43,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:43,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:13:43,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:43,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:43,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:13:43,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:43,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:13:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:13:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:43,343 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:13:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:43,704 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-11-23 10:13:43,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:13:43,704 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:13:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:13:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 10:13:43,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 10:13:43,931 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:43,943 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:13:43,943 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:13:43,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:13:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:13:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:13:43,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:43,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:43,991 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:43,991 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:43,994 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:43,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:43,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:43,996 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:43,996 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:13:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,000 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 10:13:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:44,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:44,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:44,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:44,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:13:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 10:13:44,005 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 10:13:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:44,006 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 10:13:44,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:13:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 10:13:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:13:44,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:44,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:44,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:44,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:44,008 INFO L82 PathProgramCache]: Analyzing trace with hash 905206694, now seen corresponding path program 1 times [2018-11-23 10:13:44,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:44,009 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:44,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:44,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 10:13:44,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {193#true} is VALID [2018-11-23 10:13:44,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 10:13:44,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {193#true} {193#true} #60#return; {193#true} is VALID [2018-11-23 10:13:44,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 10:13:44,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {213#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:44,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:44,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#false} ~i~0 := 1bv32; {194#false} is VALID [2018-11-23 10:13:44,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {194#false} assume !~bvslt32(~i~0, 100000bv32); {194#false} is VALID [2018-11-23 10:13:44,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~i~0 := 1bv32;~j~0 := 0bv32; {194#false} is VALID [2018-11-23 10:13:44,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {194#false} is VALID [2018-11-23 10:13:44,397 INFO L256 TraceCheckUtils]: 11: Hoare triple {194#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {194#false} is VALID [2018-11-23 10:13:44,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 10:13:44,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {194#false} assume 0bv32 == ~cond; {194#false} is VALID [2018-11-23 10:13:44,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 10:13:44,400 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 10:13:44,400 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:13:44,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:13:44,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:13:44,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:44,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:44,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:13:44,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:44,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:13:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:13:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:44,483 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-11-23 10:13:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,608 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:13:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:13:44,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:13:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:13:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 10:13:44,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 10:13:44,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:44,741 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:13:44,742 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:13:44,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:13:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:13:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:13:44,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:44,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:44,752 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:44,752 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,755 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:44,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:44,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:44,756 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:44,756 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:13:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:44,759 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:13:44,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:44,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:44,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:44,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:44,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:13:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:13:44,762 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2018-11-23 10:13:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:44,763 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:13:44,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:13:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:13:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:13:44,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:44,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:44,764 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:44,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash -764882998, now seen corresponding path program 1 times [2018-11-23 10:13:44,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:44,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:44,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:44,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:44,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:44,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:44,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:44,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:44,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:44,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:44,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {380#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:44,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:44,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:44,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:44,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:44,935 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:44,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:44,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:44,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:44,938 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 10:13:44,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:45,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-23 10:13:45,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {357#false} assume 0bv32 == ~cond; {357#false} is VALID [2018-11-23 10:13:45,363 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-23 10:13:45,363 INFO L256 TraceCheckUtils]: 12: Hoare triple {357#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-23 10:13:45,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {357#false} is VALID [2018-11-23 10:13:45,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {357#false} ~i~0 := 1bv32;~j~0 := 0bv32; {357#false} is VALID [2018-11-23 10:13:45,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#false} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:45,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {357#false} ~i~0 := 1bv32; {357#false} is VALID [2018-11-23 10:13:45,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {357#false} is VALID [2018-11-23 10:13:45,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {432#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:45,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {436#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:45,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-23 10:13:45,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #60#return; {356#true} is VALID [2018-11-23 10:13:45,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-23 10:13:45,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-23 10:13:45,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-23 10:13:45,392 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 10:13:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:13:45,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:45,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:45,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:13:45,503 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 10:13:45,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:13:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:13:45,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:13:45,504 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:13:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:46,031 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:13:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:13:46,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:13:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:13:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 10:13:46,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 10:13:46,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:46,210 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:13:46,210 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:13:46,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:13:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:13:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 10:13:46,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:46,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:46,238 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:46,238 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 10:13:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:46,243 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:46,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:46,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:46,245 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:46,245 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 10:13:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:46,248 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 10:13:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:13:46,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:46,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:46,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:46,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:13:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 10:13:46,252 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-23 10:13:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:46,252 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 10:13:46,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:13:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 10:13:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:13:46,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:46,254 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:46,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:46,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -897319674, now seen corresponding path program 1 times [2018-11-23 10:13:46,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:46,255 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:46,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:13:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:46,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:46,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:46,476 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:46,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:46,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:46,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:46,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {647#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:46,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {647#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:46,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {651#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:46,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {655#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:46,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {659#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:46,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {663#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:46,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:46,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:46,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:46,486 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:46,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:46,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:46,487 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:46,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:46,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:46,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:46,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:46,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {628#false} assume !false; {628#false} is VALID [2018-11-23 10:13:46,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#false} assume 0bv32 == ~cond; {628#false} is VALID [2018-11-23 10:13:46,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#false} ~cond := #in~cond; {628#false} is VALID [2018-11-23 10:13:46,666 INFO L256 TraceCheckUtils]: 17: Hoare triple {628#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {628#false} is VALID [2018-11-23 10:13:46,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {628#false} is VALID [2018-11-23 10:13:46,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {628#false} ~i~0 := 1bv32;~j~0 := 0bv32; {628#false} is VALID [2018-11-23 10:13:46,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {628#false} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:46,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:46,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {628#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {628#false} is VALID [2018-11-23 10:13:46,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#false} ~i~0 := 1bv32; {628#false} is VALID [2018-11-23 10:13:46,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {727#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {628#false} is VALID [2018-11-23 10:13:46,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {727#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:46,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {731#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:46,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {735#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:46,684 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {739#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:46,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {627#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {743#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:46,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {627#true} call #t~ret4 := main(); {627#true} is VALID [2018-11-23 10:13:46,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {627#true} {627#true} #60#return; {627#true} is VALID [2018-11-23 10:13:46,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {627#true} assume true; {627#true} is VALID [2018-11-23 10:13:46,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {627#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {627#true} is VALID [2018-11-23 10:13:46,686 INFO L256 TraceCheckUtils]: 0: Hoare triple {627#true} call ULTIMATE.init(); {627#true} is VALID [2018-11-23 10:13:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:13:46,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:46,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:13:46,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:46,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:46,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:13:46,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:46,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:13:46,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:13:46,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:13:46,743 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 12 states. [2018-11-23 10:13:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,222 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 10:13:48,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:13:48,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 10:13:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:13:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:13:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:13:48,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 10:13:48,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:48,359 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:13:48,359 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:13:48,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:13:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-11-23 10:13:48,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:48,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:48,388 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:48,388 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2018-11-23 10:13:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,391 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:13:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:13:48,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:48,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:48,392 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2018-11-23 10:13:48,393 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2018-11-23 10:13:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:48,395 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:13:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:13:48,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:48,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:48,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:48,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:13:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 10:13:48,399 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-11-23 10:13:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:48,399 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 10:13:48,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:13:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 10:13:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:13:48,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:48,401 INFO L402 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:48,401 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:48,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -3011962, now seen corresponding path program 2 times [2018-11-23 10:13:48,402 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:48,435 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:13:48,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:13:48,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:48,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:48,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2018-11-23 10:13:48,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {980#true} is VALID [2018-11-23 10:13:48,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2018-11-23 10:13:48,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #60#return; {980#true} is VALID [2018-11-23 10:13:48,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret4 := main(); {980#true} is VALID [2018-11-23 10:13:48,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {980#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {980#true} is VALID [2018-11-23 10:13:48,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,613 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#true} assume !~bvslt32(~i~0, 100000bv32); {980#true} is VALID [2018-11-23 10:13:48,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#true} ~i~0 := 1bv32; {1036#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:48,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {1036#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1040#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:48,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {1040#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1044#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:48,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {1044#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {981#false} is VALID [2018-11-23 10:13:48,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {981#false} ~i~0 := 1bv32;~j~0 := 0bv32; {981#false} is VALID [2018-11-23 10:13:48,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {981#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {981#false} is VALID [2018-11-23 10:13:48,622 INFO L256 TraceCheckUtils]: 23: Hoare triple {981#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {981#false} is VALID [2018-11-23 10:13:48,623 INFO L273 TraceCheckUtils]: 24: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2018-11-23 10:13:48,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {981#false} assume 0bv32 == ~cond; {981#false} is VALID [2018-11-23 10:13:48,624 INFO L273 TraceCheckUtils]: 26: Hoare triple {981#false} assume !false; {981#false} is VALID [2018-11-23 10:13:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:48,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:48,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {981#false} assume !false; {981#false} is VALID [2018-11-23 10:13:48,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {981#false} assume 0bv32 == ~cond; {981#false} is VALID [2018-11-23 10:13:48,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {981#false} ~cond := #in~cond; {981#false} is VALID [2018-11-23 10:13:48,715 INFO L256 TraceCheckUtils]: 23: Hoare triple {981#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {981#false} is VALID [2018-11-23 10:13:48,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {981#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {981#false} is VALID [2018-11-23 10:13:48,716 INFO L273 TraceCheckUtils]: 21: Hoare triple {981#false} ~i~0 := 1bv32;~j~0 := 0bv32; {981#false} is VALID [2018-11-23 10:13:48,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {1084#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {981#false} is VALID [2018-11-23 10:13:48,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {1088#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1084#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:48,722 INFO L273 TraceCheckUtils]: 18: Hoare triple {1092#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1088#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:48,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {980#true} ~i~0 := 1bv32; {1092#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:48,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#true} assume !~bvslt32(~i~0, 100000bv32); {980#true} is VALID [2018-11-23 10:13:48,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {980#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {980#true} is VALID [2018-11-23 10:13:48,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {980#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {980#true} is VALID [2018-11-23 10:13:48,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {980#true} call #t~ret4 := main(); {980#true} is VALID [2018-11-23 10:13:48,726 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {980#true} {980#true} #60#return; {980#true} is VALID [2018-11-23 10:13:48,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {980#true} assume true; {980#true} is VALID [2018-11-23 10:13:48,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {980#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {980#true} is VALID [2018-11-23 10:13:48,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {980#true} call ULTIMATE.init(); {980#true} is VALID [2018-11-23 10:13:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:48,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:48,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:13:48,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 10:13:48,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:48,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:13:48,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:48,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:13:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:13:48,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:13:48,784 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-11-23 10:13:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:49,691 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 10:13:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 10:13:49,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-23 10:13:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:13:49,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 10:13:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:13:49,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 10:13:49,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 10:13:49,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:49,868 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:13:49,869 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 10:13:49,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:13:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 10:13:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-23 10:13:49,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:49,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:49,942 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:49,942 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-23 10:13:49,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:49,946 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 10:13:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 10:13:49,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:49,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:49,947 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-23 10:13:49,948 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-23 10:13:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:49,951 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 10:13:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 10:13:49,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:49,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:49,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:49,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 10:13:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 10:13:49,955 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 27 [2018-11-23 10:13:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:49,955 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 10:13:49,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:13:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 10:13:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:13:49,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:49,957 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:49,957 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:49,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1389169850, now seen corresponding path program 3 times [2018-11-23 10:13:49,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:49,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:49,980 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:13:50,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:13:50,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:50,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:50,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 10:13:50,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 10:13:50,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 10:13:50,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #60#return; {1417#true} is VALID [2018-11-23 10:13:50,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret4 := main(); {1417#true} is VALID [2018-11-23 10:13:50,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1417#true} is VALID [2018-11-23 10:13:50,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {1417#true} assume !~bvslt32(~i~0, 100000bv32); {1417#true} is VALID [2018-11-23 10:13:50,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {1417#true} ~i~0 := 1bv32; {1473#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {1473#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1477#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {1477#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1481#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {1481#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1485#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {1485#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1489#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:13:50,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {1489#(= (_ bv29 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1493#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {1493#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1497#(= (bvadd main_~i~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:50,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {1497#(= (bvadd main_~i~0 (_ bv4294967253 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1418#false} is VALID [2018-11-23 10:13:50,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1418#false} is VALID [2018-11-23 10:13:50,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {1418#false} is VALID [2018-11-23 10:13:50,635 INFO L256 TraceCheckUtils]: 27: Hoare triple {1418#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 10:13:50,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 10:13:50,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 10:13:50,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 10:13:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:50,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:50,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {1418#false} assume !false; {1418#false} is VALID [2018-11-23 10:13:50,907 INFO L273 TraceCheckUtils]: 29: Hoare triple {1418#false} assume 0bv32 == ~cond; {1418#false} is VALID [2018-11-23 10:13:50,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {1418#false} ~cond := #in~cond; {1418#false} is VALID [2018-11-23 10:13:50,908 INFO L256 TraceCheckUtils]: 27: Hoare triple {1418#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1418#false} is VALID [2018-11-23 10:13:50,908 INFO L273 TraceCheckUtils]: 26: Hoare triple {1418#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {1418#false} is VALID [2018-11-23 10:13:50,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {1418#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1418#false} is VALID [2018-11-23 10:13:50,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {1537#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1418#false} is VALID [2018-11-23 10:13:50,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1537#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:50,920 INFO L273 TraceCheckUtils]: 22: Hoare triple {1545#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {1549#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1545#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {1553#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1549#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1553#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,947 INFO L273 TraceCheckUtils]: 18: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1557#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {1417#true} ~i~0 := 1bv32; {1561#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:50,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {1417#true} assume !~bvslt32(~i~0, 100000bv32); {1417#true} is VALID [2018-11-23 10:13:50,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,949 INFO L273 TraceCheckUtils]: 14: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,950 INFO L273 TraceCheckUtils]: 9: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {1417#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1417#true} is VALID [2018-11-23 10:13:50,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {1417#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1417#true} is VALID [2018-11-23 10:13:50,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {1417#true} call #t~ret4 := main(); {1417#true} is VALID [2018-11-23 10:13:50,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1417#true} {1417#true} #60#return; {1417#true} is VALID [2018-11-23 10:13:50,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {1417#true} assume true; {1417#true} is VALID [2018-11-23 10:13:50,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {1417#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1417#true} is VALID [2018-11-23 10:13:50,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {1417#true} call ULTIMATE.init(); {1417#true} is VALID [2018-11-23 10:13:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-23 10:13:50,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:50,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:13:50,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 10:13:50,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:50,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:13:51,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:51,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:13:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:13:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:13:51,030 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 16 states. [2018-11-23 10:13:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,330 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2018-11-23 10:13:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 10:13:55,330 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-23 10:13:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:13:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:13:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:13:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:13:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 113 transitions. [2018-11-23 10:13:55,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 113 transitions. [2018-11-23 10:13:55,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:55,640 INFO L225 Difference]: With dead ends: 93 [2018-11-23 10:13:55,640 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 10:13:55,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-23 10:13:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 10:13:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 43. [2018-11-23 10:13:55,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:13:55,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 43 states. [2018-11-23 10:13:55,731 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 43 states. [2018-11-23 10:13:55,731 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 43 states. [2018-11-23 10:13:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,739 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:13:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:13:55,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,742 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 83 states. [2018-11-23 10:13:55,742 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 83 states. [2018-11-23 10:13:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:13:55,751 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2018-11-23 10:13:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2018-11-23 10:13:55,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:13:55,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:13:55,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:13:55,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:13:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:13:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-11-23 10:13:55,754 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 31 [2018-11-23 10:13:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:13:55,755 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-11-23 10:13:55,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:13:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 10:13:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 10:13:55,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:13:55,758 INFO L402 BasicCegarLoop]: trace histogram [14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:13:55,758 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:13:55,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:13:55,760 INFO L82 PathProgramCache]: Analyzing trace with hash -4348730, now seen corresponding path program 4 times [2018-11-23 10:13:55,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:13:55,761 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:13:55,788 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:13:55,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:13:55,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:13:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:13:55,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:13:56,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:13:56,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2034#true} is VALID [2018-11-23 10:13:56,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:13:56,291 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #60#return; {2034#true} is VALID [2018-11-23 10:13:56,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret4 := main(); {2034#true} is VALID [2018-11-23 10:13:56,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2054#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:13:56,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {2054#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2058#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2062#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {2062#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2066#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {2066#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2070#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {2070#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2074#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {2074#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2078#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:13:56,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {2078#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2082#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {2082#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2086#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:13:56,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {2086#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2090#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,303 INFO L273 TraceCheckUtils]: 15: Hoare triple {2090#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2094#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:13:56,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {2094#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:13:56,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {2035#false} ~i~0 := 1bv32; {2035#false} is VALID [2018-11-23 10:13:56,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {2035#false} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:13:56,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {2035#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2035#false} is VALID [2018-11-23 10:13:56,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {2035#false} is VALID [2018-11-23 10:13:56,309 INFO L256 TraceCheckUtils]: 35: Hoare triple {2035#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2035#false} is VALID [2018-11-23 10:13:56,309 INFO L273 TraceCheckUtils]: 36: Hoare triple {2035#false} ~cond := #in~cond; {2035#false} is VALID [2018-11-23 10:13:56,310 INFO L273 TraceCheckUtils]: 37: Hoare triple {2035#false} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:13:56,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:13:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:13:56,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:13:56,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:13:56,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {2035#false} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:13:56,738 INFO L273 TraceCheckUtils]: 36: Hoare triple {2035#false} ~cond := #in~cond; {2035#false} is VALID [2018-11-23 10:13:56,739 INFO L256 TraceCheckUtils]: 35: Hoare triple {2035#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2035#false} is VALID [2018-11-23 10:13:56,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(7bv32, ~j~0)))), 4bv32); {2035#false} is VALID [2018-11-23 10:13:56,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {2035#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2035#false} is VALID [2018-11-23 10:13:56,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {2035#false} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:13:56,740 INFO L273 TraceCheckUtils]: 31: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,740 INFO L273 TraceCheckUtils]: 30: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 26: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 25: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {2035#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(7bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2035#false} is VALID [2018-11-23 10:13:56,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {2035#false} ~i~0 := 1bv32; {2035#false} is VALID [2018-11-23 10:13:56,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2035#false} is VALID [2018-11-23 10:13:56,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {2234#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2230#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:13:56,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {2238#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2234#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2238#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {2246#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2242#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {2250#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2246#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {2254#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2250#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {2258#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2254#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {2262#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2258#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {2266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2262#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {2270#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {2266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2270#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:13:56,792 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret4 := main(); {2034#true} is VALID [2018-11-23 10:13:56,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #60#return; {2034#true} is VALID [2018-11-23 10:13:56,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:13:56,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2034#true} is VALID [2018-11-23 10:13:56,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:13:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-23 10:13:56,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:13:56,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:13:56,796 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-23 10:13:56,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:13:56,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:13:56,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:13:56,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:13:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:13:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:13:56,898 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 24 states. [2018-11-23 10:14:01,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:01,076 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-11-23 10:14:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:14:01,077 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-11-23 10:14:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:14:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 10:14:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:14:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 88 transitions. [2018-11-23 10:14:01,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 88 transitions. [2018-11-23 10:14:01,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:14:01,315 INFO L225 Difference]: With dead ends: 93 [2018-11-23 10:14:01,315 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 10:14:01,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 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 10:14:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 10:14:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-11-23 10:14:01,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:14:01,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:01,379 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:01,379 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 55 states. [2018-11-23 10:14:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:01,382 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 10:14:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 10:14:01,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:01,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:01,383 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 67 states. [2018-11-23 10:14:01,383 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 67 states. [2018-11-23 10:14:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:14:01,386 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 10:14:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-23 10:14:01,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:14:01,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:14:01,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:14:01,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:14:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 10:14:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-11-23 10:14:01,389 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 39 [2018-11-23 10:14:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:14:01,390 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-11-23 10:14:01,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:14:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 10:14:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 10:14:01,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:14:01,391 INFO L402 BasicCegarLoop]: trace histogram [22, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:14:01,391 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:14:01,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:14:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1896931270, now seen corresponding path program 5 times [2018-11-23 10:14:01,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:14:01,392 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:14:01,414 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1