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/AutomizerC.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-18e5b2d-m [2018-11-18 22:22:50,479 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:22:50,481 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:22:50,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:22:50,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:22:50,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:22:50,496 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:22:50,498 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:22:50,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:22:50,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:22:50,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:22:50,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:22:50,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:22:50,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:22:50,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:22:50,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:22:50,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:22:50,509 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:22:50,512 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:22:50,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:22:50,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:22:50,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:22:50,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:22:50,520 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:22:50,520 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:22:50,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:22:50,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:22:50,523 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:22:50,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:22:50,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:22:50,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:22:50,527 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:22:50,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:22:50,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:22:50,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:22:50,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:22:50,530 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-18 22:22:50,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:22:50,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:22:50,547 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:22:50,547 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:22:50,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:22:50,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:22:50,549 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:22:50,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:22:50,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:22:50,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:22:50,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:22:50,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:22:50,551 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:22:50,551 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:22:50,551 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:22:50,551 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:22:50,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:22:50,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:22:50,552 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:22:50,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:22:50,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:22:50,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:22:50,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:22:50,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:22:50,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:22:50,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:22:50,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:22:50,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:22:50,555 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:22:50,556 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:22:50,556 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:22:50,556 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:22:50,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:22:50,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:22:50,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:22:50,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:22:50,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:22:50,643 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:22:50,644 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-18 22:22:50,720 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0c4924d/ceefc93ca21f4b5e9c7c90480dd22ec7/FLAG98b6168b8 [2018-11-18 22:22:51,125 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:22:51,125 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-18 22:22:51,134 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0c4924d/ceefc93ca21f4b5e9c7c90480dd22ec7/FLAG98b6168b8 [2018-11-18 22:22:51,516 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b0c4924d/ceefc93ca21f4b5e9c7c90480dd22ec7 [2018-11-18 22:22:51,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:22:51,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:22:51,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:22:51,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:22:51,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:22:51,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402ac7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51, skipping insertion in model container [2018-11-18 22:22:51,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:22:51,580 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:22:51,817 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:22:51,832 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:22:51,892 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:22:51,923 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:22:51,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51 WrapperNode [2018-11-18 22:22:51,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:22:51,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:22:51,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:22:51,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:22:51,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:51,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:52,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (1/1) ... [2018-11-18 22:22:52,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:22:52,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:22:52,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:22:52,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:22:52,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (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-18 22:22:52,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:22:52,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:22:52,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:22:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:22:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:22:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:22:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 22:22:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:22:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 22:22:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 22:22:53,082 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:22:53,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:53 BoogieIcfgContainer [2018-11-18 22:22:53,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:22:53,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:22:53,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:22:53,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:22:53,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:22:51" (1/3) ... [2018-11-18 22:22:53,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbe9ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:53, skipping insertion in model container [2018-11-18 22:22:53,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:51" (2/3) ... [2018-11-18 22:22:53,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbe9ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:53, skipping insertion in model container [2018-11-18 22:22:53,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:53" (3/3) ... [2018-11-18 22:22:53,092 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-11-18 22:22:53,102 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:22:53,110 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-18 22:22:53,128 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-18 22:22:53,160 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:22:53,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:22:53,161 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:22:53,161 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:22:53,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:22:53,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:22:53,162 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:22:53,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:22:53,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:22:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 22:22:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 22:22:53,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:53,189 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:53,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-11-18 22:22:53,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:53,203 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-18 22:22:53,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:53,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:53,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-18 22:22:53,399 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-18 22:22:53,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-18 22:22:53,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #107#return; {45#true} is VALID [2018-11-18 22:22:53,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret9 := main(); {45#true} is VALID [2018-11-18 22:22:53,401 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-18 22:22:53,402 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-18 22:22:53,403 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-18 22:22:53,404 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-18 22:22:53,412 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-18 22:22:53,413 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-18 22:22:53,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume 0bv32 == ~__VERIFIER_assert__cond~3; {46#false} is VALID [2018-11-18 22:22:53,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-18 22:22:53,416 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-18 22:22:53,416 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:22:53,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:22:53,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:22:53,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 22:22:53,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:53,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:22:53,494 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-18 22:22:53,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:22:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:22:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:22:53,504 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-18 22:22:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:53,812 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2018-11-18 22:22:53,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:22:53,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-18 22:22:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 22:22:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:53,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-18 22:22:53,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-18 22:22:54,278 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-18 22:22:54,299 INFO L225 Difference]: With dead ends: 57 [2018-11-18 22:22:54,300 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 22:22:54,306 INFO L604 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-18 22:22:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 22:22:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-18 22:22:54,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:54,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-18 22:22:54,403 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-18 22:22:54,403 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-18 22:22:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:54,408 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 22:22:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:22:54,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:54,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:54,410 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-18 22:22:54,410 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-18 22:22:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:54,414 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-18 22:22:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:22:54,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:54,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:54,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:54,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-18 22:22:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-11-18 22:22:54,421 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-11-18 22:22:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:54,422 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-11-18 22:22:54,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:22:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-18 22:22:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:22:54,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:54,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:54,423 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:54,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:54,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-11-18 22:22:54,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:54,427 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-18 22:22:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:54,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:54,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {271#true} call ULTIMATE.init(); {271#true} is VALID [2018-11-18 22:22:54,562 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-18 22:22:54,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {271#true} assume true; {271#true} is VALID [2018-11-18 22:22:54,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {271#true} {271#true} #107#return; {271#true} is VALID [2018-11-18 22:22:54,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {271#true} call #t~ret9 := main(); {271#true} is VALID [2018-11-18 22:22:54,563 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-18 22:22:54,563 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-18 22:22:54,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {271#true} assume ~bvult32(~main__index2~0, 100000bv32); {271#true} is VALID [2018-11-18 22:22:54,564 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-18 22:22:54,564 INFO L273 TraceCheckUtils]: 9: Hoare triple {271#true} assume ~bvult32(~main__index1~0, 100000bv32); {271#true} is VALID [2018-11-18 22:22:54,567 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-18 22:22:54,569 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-18 22:22:54,570 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-18 22:22:54,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {272#false} assume !false; {272#false} is VALID [2018-11-18 22:22:54,572 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-18 22:22:54,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:22:54,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:22:54,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:22:54,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:22:54,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:54,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:22:54,603 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-18 22:22:54,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:22:54,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:22:54,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:22:54,605 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-11-18 22:22:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,031 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-18 22:22:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:22:55,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-18 22:22:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:22:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-18 22:22:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:22:55,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-18 22:22:55,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2018-11-18 22:22:55,194 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-18 22:22:55,199 INFO L225 Difference]: With dead ends: 53 [2018-11-18 22:22:55,199 INFO L226 Difference]: Without dead ends: 51 [2018-11-18 22:22:55,200 INFO L604 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-18 22:22:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-18 22:22:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-11-18 22:22:55,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:55,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 34 states. [2018-11-18 22:22:55,237 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 34 states. [2018-11-18 22:22:55,238 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 34 states. [2018-11-18 22:22:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,242 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:22:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:22:55,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:55,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:55,243 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 51 states. [2018-11-18 22:22:55,244 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 51 states. [2018-11-18 22:22:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,248 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-18 22:22:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-18 22:22:55,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:55,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:55,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:55,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:55,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:22:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 22:22:55,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-11-18 22:22:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:55,253 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 22:22:55,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:22:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 22:22:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:22:55,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:55,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:55,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:55,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:55,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-11-18 22:22:55,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:55,256 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-18 22:22:55,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:55,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:55,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {537#true} call ULTIMATE.init(); {537#true} is VALID [2018-11-18 22:22:55,384 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-18 22:22:55,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {537#true} assume true; {537#true} is VALID [2018-11-18 22:22:55,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {537#true} {537#true} #107#return; {537#true} is VALID [2018-11-18 22:22:55,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {537#true} call #t~ret9 := main(); {537#true} is VALID [2018-11-18 22:22:55,385 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-18 22:22:55,387 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-18 22:22:55,387 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-18 22:22:55,388 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-18 22:22:55,388 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-18 22:22:55,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {538#false} is VALID [2018-11-18 22:22:55,389 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-18 22:22:55,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {538#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {538#false} is VALID [2018-11-18 22:22:55,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {538#false} assume !false; {538#false} is VALID [2018-11-18 22:22:55,392 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-18 22:22:55,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:22:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:22:55,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:22:55,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 22:22:55,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:55,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:22:55,473 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-18 22:22:55,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:22:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:22:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:22:55,474 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-11-18 22:22:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,664 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-18 22:22:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:22:55,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-18 22:22:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:22:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2018-11-18 22:22:55,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2018-11-18 22:22:55,848 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-18 22:22:55,850 INFO L225 Difference]: With dead ends: 62 [2018-11-18 22:22:55,850 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 22:22:55,851 INFO L604 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-18 22:22:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 22:22:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-11-18 22:22:55,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:55,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 34 states. [2018-11-18 22:22:55,887 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 34 states. [2018-11-18 22:22:55,887 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 34 states. [2018-11-18 22:22:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,890 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-18 22:22:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 22:22:55,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:55,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:55,892 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 41 states. [2018-11-18 22:22:55,893 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 41 states. [2018-11-18 22:22:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:55,897 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-18 22:22:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-18 22:22:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:55,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:55,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:55,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 22:22:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-18 22:22:55,901 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-11-18 22:22:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:55,901 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-18 22:22:55,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:22:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 22:22:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 22:22:55,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:55,902 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:22:55,903 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:55,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-11-18 22:22:55,904 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:55,904 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-18 22:22:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:22:56,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {793#true} call ULTIMATE.init(); {793#true} is VALID [2018-11-18 22:22:56,031 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-18 22:22:56,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {793#true} assume true; {793#true} is VALID [2018-11-18 22:22:56,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {793#true} {793#true} #107#return; {793#true} is VALID [2018-11-18 22:22:56,032 INFO L256 TraceCheckUtils]: 4: Hoare triple {793#true} call #t~ret9 := main(); {793#true} is VALID [2018-11-18 22:22:56,032 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-18 22:22:56,032 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-18 22:22:56,033 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-18 22:22:56,035 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-18 22:22:56,035 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-18 22:22:56,040 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-18 22:22:56,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {794#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {794#false} is VALID [2018-11-18 22:22:56,040 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-18 22:22:56,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {794#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {794#false} is VALID [2018-11-18 22:22:56,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {794#false} assume !false; {794#false} is VALID [2018-11-18 22:22:56,042 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-18 22:22:56,042 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:22:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:22:56,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:22:56,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:22:56,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:22:56,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:22:56,071 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-18 22:22:56,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:22:56,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:22:56,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:22:56,071 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-11-18 22:22:56,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:56,219 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-18 22:22:56,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:22:56,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 22:22:56,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:22:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-18 22:22:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:22:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-18 22:22:56,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-18 22:22:56,312 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-18 22:22:56,314 INFO L225 Difference]: With dead ends: 56 [2018-11-18 22:22:56,314 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 22:22:56,315 INFO L604 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-18 22:22:56,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 22:22:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-18 22:22:56,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:22:56,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 29 states. [2018-11-18 22:22:56,325 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 29 states. [2018-11-18 22:22:56,325 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 29 states. [2018-11-18 22:22:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:56,328 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 22:22:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 22:22:56,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:56,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:56,329 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 35 states. [2018-11-18 22:22:56,330 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 35 states. [2018-11-18 22:22:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:22:56,332 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-18 22:22:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 22:22:56,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:22:56,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:22:56,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:22:56,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:22:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 22:22:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 22:22:56,335 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-11-18 22:22:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:22:56,335 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 22:22:56,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:22:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 22:22:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 22:22:56,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:22:56,337 INFO L375 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-18 22:22:56,337 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:22:56,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:22:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-11-18 22:22:56,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:22:56,338 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-18 22:22:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:22:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:22:57,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:23:03,915 INFO L303 Elim1Store]: Index analysis took 2014 ms [2018-11-18 22:23:03,921 INFO L477 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-18 22:23:07,964 WARN L669 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-18 22:23:07,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:23:09,974 WARN L669 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-18 22:23:09,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 22:23:10,013 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:23:10,048 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 22:23:10,250 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:23:10,252 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:795) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:763) 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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-18 22:23:10,256 INFO L168 Benchmark]: Toolchain (without parser) took 18728.28 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -441.0 MB). Peak memory consumption was 273.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:23:10,258 INFO L168 Benchmark]: CDTParser took 0.22 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-18 22:23:10,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.11 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-18 22:23:10,259 INFO L168 Benchmark]: Boogie Preprocessor took 85.65 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-18 22:23:10,260 INFO L168 Benchmark]: RCFGBuilder took 1072.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:23:10,261 INFO L168 Benchmark]: TraceAbstraction took 17170.39 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: 293.0 MB). Peak memory consumption was 293.0 MB. Max. memory is 7.1 GB. [2018-11-18 22:23:10,265 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.22 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 395.11 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 Preprocessor took 85.65 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 1072.19 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17170.39 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: 293.0 MB). Peak memory consumption was 293.0 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...