java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:31:59,992 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:31:59,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:00,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:00,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:00,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:00,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:00,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:00,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:00,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:00,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:00,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:00,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:00,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:00,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:00,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:00,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:00,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:00,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:00,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:00,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:00,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:00,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:00,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:00,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:00,044 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:00,045 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:00,046 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:00,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:00,048 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:00,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:00,049 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:00,049 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:00,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:00,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:00,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:00,051 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:32:00,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:00,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:00,068 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:00,068 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:00,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:00,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:00,069 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:00,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:00,070 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:00,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:00,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:00,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:00,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:00,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:00,072 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:00,072 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:00,072 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:00,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:00,073 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:00,074 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:00,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:00,074 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:00,074 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:00,075 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:00,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:00,075 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:00,075 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:00,075 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:00,076 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:00,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:00,077 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:00,077 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:00,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:00,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:00,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:00,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:00,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:00,142 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:00,143 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-23 11:32:00,207 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055ba3370/3ba79b59779743e29f6b7595b7455483/FLAGd29d04c79 [2018-11-23 11:32:00,625 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:00,626 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-23 11:32:00,634 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055ba3370/3ba79b59779743e29f6b7595b7455483/FLAGd29d04c79 [2018-11-23 11:32:00,977 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055ba3370/3ba79b59779743e29f6b7595b7455483 [2018-11-23 11:32:00,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:00,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:00,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:00,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:00,993 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:00,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:00,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035785c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:00, skipping insertion in model container [2018-11-23 11:32:00,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:00" (1/1) ... [2018-11-23 11:32:01,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:01,041 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:01,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:01,291 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:01,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:01,365 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:01,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01 WrapperNode [2018-11-23 11:32:01,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:01,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:01,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:01,367 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:01,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:01,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:01,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:01,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:01,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... [2018-11-23 11:32:01,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:01,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:01,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:01,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:01,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:01,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:32:01,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:32:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:01,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:01,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:01,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:32:02,706 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:02,706 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:32:02,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:02 BoogieIcfgContainer [2018-11-23 11:32:02,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:02,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:02,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:02,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:02,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:00" (1/3) ... [2018-11-23 11:32:02,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76221e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:02, skipping insertion in model container [2018-11-23 11:32:02,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:01" (2/3) ... [2018-11-23 11:32:02,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76221e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:02, skipping insertion in model container [2018-11-23 11:32:02,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:02" (3/3) ... [2018-11-23 11:32:02,717 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-23 11:32:02,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:02,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 11:32:02,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 11:32:02,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:02,794 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:02,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:02,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:02,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:02,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:02,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:02,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:02,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 11:32:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:32:02,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:02,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:02,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:02,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:02,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-11-23 11:32:02,840 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:02,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:02,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:02,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:03,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 11:32:03,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {45#true} is VALID [2018-11-23 11:32:03,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 11:32:03,185 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #107#return; {45#true} is VALID [2018-11-23 11:32:03,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret9 := main(); {45#true} is VALID [2018-11-23 11:32:03,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {65#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:03,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {65#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:03,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {65#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index2~0, 100000bv32); {65#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:03,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {65#(= main_~main__loop_entered~0 (_ bv0 32))} assume !~bvult32(~main__index1~0, ~main__index2~0); {65#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-23 11:32:03,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {65#(= main_~main__loop_entered~0 (_ bv0 32))} assume !(0bv32 == ~main__loop_entered~0); {46#false} is VALID [2018-11-23 11:32:03,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume ~bvult32(~main__index2~0, ~main__index1~0);havoc ~__tmp_4~0;call #t~mem7 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32);~__tmp_4~0 := (if #t~mem7 == #t~mem8 then 1bv32 else 0bv32);havoc #t~mem7;havoc #t~mem8;havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {46#false} is VALID [2018-11-23 11:32:03,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume 0bv32 == ~__VERIFIER_assert__cond~3; {46#false} is VALID [2018-11-23 11:32:03,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 11:32:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:03,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:03,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:03,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:03,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:32:03,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:03,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:03,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:03,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:03,312 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-23 11:32:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:03,663 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-23 11:32:03,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:03,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 11:32:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-23 11:32:03,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-23 11:32:03,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-23 11:32:04,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:04,138 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:32:04,139 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:32:04,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:04,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:32:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 11:32:04,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:04,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 11:32:04,305 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 11:32:04,306 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 11:32:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:04,310 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 11:32:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 11:32:04,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:04,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:04,312 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 11:32:04,312 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 11:32:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:04,318 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 11:32:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 11:32:04,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:04,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:04,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:04,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:32:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-23 11:32:04,327 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-11-23 11:32:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:04,327 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-23 11:32:04,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-23 11:32:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:04,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:04,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:04,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:04,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:04,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-11-23 11:32:04,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:04,330 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:04,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:04,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:04,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2018-11-23 11:32:04,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {271#true} is VALID [2018-11-23 11:32:04,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2018-11-23 11:32:04,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #107#return; {271#true} is VALID [2018-11-23 11:32:04,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret9 := main(); {271#true} is VALID [2018-11-23 11:32:04,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {271#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {271#true} is VALID [2018-11-23 11:32:04,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {271#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {271#true} is VALID [2018-11-23 11:32:04,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {271#true} assume ~bvult32(~main__index2~0, 100000bv32); {271#true} is VALID [2018-11-23 11:32:04,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {271#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {271#true} is VALID [2018-11-23 11:32:04,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {271#true} assume ~bvult32(~main__index1~0, 100000bv32); {271#true} is VALID [2018-11-23 11:32:04,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {271#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {306#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} is VALID [2018-11-23 11:32:04,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {306#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {310#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:04,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {310#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {272#false} is VALID [2018-11-23 11:32:04,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {272#false} assume !false; {272#false} is VALID [2018-11-23 11:32:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:04,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:04,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:32:04,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:32:04,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:04,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:32:04,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:04,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:32:04,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:32:04,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:32:04,551 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-23 11:32:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,015 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-23 11:32:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:32:05,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 11:32:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:32:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:32:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:32:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-23 11:32:05,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-23 11:32:05,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:05,215 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:32:05,215 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:32:05,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:32:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:32:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-23 11:32:05,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:05,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 34 states. [2018-11-23 11:32:05,280 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 34 states. [2018-11-23 11:32:05,280 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 34 states. [2018-11-23 11:32:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,283 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:32:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:32:05,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:05,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:05,285 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 51 states. [2018-11-23 11:32:05,285 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 51 states. [2018-11-23 11:32:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,290 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 11:32:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-23 11:32:05,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:05,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:05,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:05,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:32:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-23 11:32:05,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-11-23 11:32:05,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:05,295 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-23 11:32:05,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:32:05,295 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 11:32:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:05,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:05,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:05,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:05,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-11-23 11:32:05,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:05,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:05,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:05,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2018-11-23 11:32:05,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {537#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {537#true} is VALID [2018-11-23 11:32:05,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2018-11-23 11:32:05,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #107#return; {537#true} is VALID [2018-11-23 11:32:05,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret9 := main(); {537#true} is VALID [2018-11-23 11:32:05,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {537#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {537#true} is VALID [2018-11-23 11:32:05,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {537#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {560#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:05,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {560#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index2~0, 100000bv32); {560#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:05,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {560#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {560#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:05,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {560#(bvult main_~main__index1~0 (_ bv100000 32))} assume !~bvult32(~main__index1~0, 100000bv32); {538#false} is VALID [2018-11-23 11:32:05,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {538#false} is VALID [2018-11-23 11:32:05,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {538#false} is VALID [2018-11-23 11:32:05,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {538#false} is VALID [2018-11-23 11:32:05,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {538#false} assume !false; {538#false} is VALID [2018-11-23 11:32:05,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:05,457 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:05,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:05,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:05,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:32:05,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:05,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:05,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:05,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:05,485 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-11-23 11:32:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,700 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 11:32:05,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:05,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:32:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 11:32:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-23 11:32:05,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-23 11:32:05,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:05,854 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:32:05,854 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:32:05,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:32:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-23 11:32:05,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:05,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-23 11:32:05,903 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-23 11:32:05,903 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-23 11:32:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,906 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 11:32:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 11:32:05,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:05,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:05,908 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-23 11:32:05,908 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-23 11:32:05,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:05,911 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-23 11:32:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 11:32:05,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:05,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:05,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:05,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:32:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 11:32:05,914 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-11-23 11:32:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:05,915 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 11:32:05,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:32:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:32:05,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:05,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:05,917 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:05,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-11-23 11:32:05,917 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:05,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:06,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {793#true} is VALID [2018-11-23 11:32:06,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {793#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {793#true} is VALID [2018-11-23 11:32:06,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {793#true} assume true; {793#true} is VALID [2018-11-23 11:32:06,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {793#true} {793#true} #107#return; {793#true} is VALID [2018-11-23 11:32:06,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {793#true} call #t~ret9 := main(); {793#true} is VALID [2018-11-23 11:32:06,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {793#true} call ~#main__array~0.base, ~#main__array~0.offset := #Ultimate.alloc(400000bv32);havoc ~main__index1~0;havoc ~main__index2~0;~main__loop_entered~0 := 0bv32;~main__index1~0 := #t~nondet1;havoc #t~nondet1; {793#true} is VALID [2018-11-23 11:32:06,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {793#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {793#true} is VALID [2018-11-23 11:32:06,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {793#true} assume ~bvult32(~main__index2~0, 100000bv32); {819#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:06,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {819#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {819#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:06,032 INFO L273 TraceCheckUtils]: 9: Hoare triple {819#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, 100000bv32); {819#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-23 11:32:06,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {819#(bvult main_~main__index2~0 (_ bv100000 32))} assume !~bvult32(~main__index2~0, 100000bv32); {794#false} is VALID [2018-11-23 11:32:06,037 INFO L273 TraceCheckUtils]: 11: Hoare triple {794#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {794#false} is VALID [2018-11-23 11:32:06,037 INFO L273 TraceCheckUtils]: 12: Hoare triple {794#false} havoc ~__tmp_1~0;~__tmp_1~0 := ~main____CPAchecker_TMP_0~0;havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {794#false} is VALID [2018-11-23 11:32:06,037 INFO L273 TraceCheckUtils]: 13: Hoare triple {794#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {794#false} is VALID [2018-11-23 11:32:06,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {794#false} assume !false; {794#false} is VALID [2018-11-23 11:32:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:06,038 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 (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:32:06,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:06,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:06,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:32:06,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:06,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:06,072 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 11:32:06,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:06,073 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-11-23 11:32:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:06,221 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 11:32:06,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:06,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:32:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:32:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:32:06,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 11:32:06,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:06,341 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:32:06,341 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 11:32:06,342 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 11:32:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 11:32:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-23 11:32:06,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:06,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 29 states. [2018-11-23 11:32:06,356 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 29 states. [2018-11-23 11:32:06,357 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 29 states. [2018-11-23 11:32:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:06,360 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:32:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:32:06,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:06,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:06,361 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 35 states. [2018-11-23 11:32:06,361 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 35 states. [2018-11-23 11:32:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:06,363 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 11:32:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 11:32:06,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:06,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:06,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:06,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:32:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 11:32:06,366 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-23 11:32:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:06,367 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 11:32:06,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 11:32:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:32:06,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:06,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:06,369 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:06,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-11-23 11:32:06,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:06,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:07,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:14,006 INFO L303 Elim1Store]: Index analysis took 2007 ms [2018-11-23 11:32:14,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-23 11:32:18,065 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (let ((.cse0 (bvmul (_ bv4 32) main_~main__index2~0))) (= (bvadd |main_~#main__array~0.offset| .cse0) (bvadd |main_~#main__array~0.offset| .cse0 (_ bv4 32)))) [2018-11-23 11:32:18,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:32:20,069 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index1~0) (_ bv4294967292 32)) (bvadd |main_~#main__array~0.offset| (bvmul (_ bv4 32) main_~main__index2~0) (_ bv4 32))) [2018-11-23 11:32:20,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:32:20,124 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:32:20,148 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:32:20,349 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:20,351 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation at de.uni_freiburg.informatik.ultimate.util.datastructures.ThreeValuedEquivalenceRelation.getEqualityStatus(ThreeValuedEquivalenceRelation.java:275) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.cheapAndSimpleIndexValueAnalysis(Elim1Store.java:796) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:764) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:32:20,355 INFO L168 Benchmark]: Toolchain (without parser) took 19368.17 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -408.0 MB). Peak memory consumption was 269.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:20,357 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:20,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:20,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:20,359 INFO L168 Benchmark]: Boogie Preprocessor took 43.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:32:20,360 INFO L168 Benchmark]: RCFGBuilder took 1264.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:20,361 INFO L168 Benchmark]: TraceAbstraction took 17646.10 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 282.4 MB). Peak memory consumption was 282.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:32:20,365 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 376.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1264.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -701.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17646.10 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 282.4 MB). Peak memory consumption was 282.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Cannot get equality status from inconsistent ThreeValuedEquivalenceRelation: de.uni_freiburg.informatik.ultimate.util.datastructures.ThreeValuedEquivalenceRelation.getEqualityStatus(ThreeValuedEquivalenceRelation.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...