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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:41:44,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:41:44,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:41:44,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:41:44,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:41:44,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:41:44,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:41:44,216 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:41:44,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:41:44,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:41:44,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:41:44,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:41:44,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:41:44,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:41:44,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:41:44,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:41:44,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:41:44,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:41:44,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:41:44,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:41:44,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:41:44,245 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:41:44,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:41:44,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:41:44,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:41:44,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:41:44,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:41:44,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:41:44,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:41:44,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:41:44,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:41:44,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:41:44,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:41:44,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:41:44,254 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:41:44,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:41:44,255 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-14 16:41:44,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:41:44,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:41:44,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:41:44,271 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:41:44,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:41:44,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:41:44,272 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:41:44,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:41:44,272 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:41:44,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:41:44,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:41:44,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:41:44,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:41:44,274 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:41:44,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:41:44,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:41:44,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:41:44,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:41:44,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:41:44,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:41:44,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:41:44,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:41:44,276 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:41:44,276 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:41:44,277 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:41:44,277 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:41:44,277 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:41:44,320 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:41:44,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:41:44,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:41:44,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:41:44,346 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:41:44,347 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+nlh-reducer.c [2018-11-14 16:41:44,414 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54280f21/f1323050546c4c2dbcaa7138df1396d0/FLAG36db291a7 [2018-11-14 16:41:44,922 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:41:44,923 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-14 16:41:44,934 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54280f21/f1323050546c4c2dbcaa7138df1396d0/FLAG36db291a7 [2018-11-14 16:41:44,947 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54280f21/f1323050546c4c2dbcaa7138df1396d0 [2018-11-14 16:41:44,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:41:44,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:41:44,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:41:44,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:41:44,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:41:44,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:41:44" (1/1) ... [2018-11-14 16:41:44,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:44, skipping insertion in model container [2018-11-14 16:41:44,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:41:44" (1/1) ... [2018-11-14 16:41:44,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:41:45,002 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:41:45,221 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:41:45,227 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:41:45,274 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:41:45,307 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:41:45,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45 WrapperNode [2018-11-14 16:41:45,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:41:45,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:41:45,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:41:45,309 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:41:45,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (1/1) ... [2018-11-14 16:41:45,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:41:45,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:41:45,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:41:45,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:41:45,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (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-14 16:41:45,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:41:45,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:41:45,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:41:45,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:41:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:41:45,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:41:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:41:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:41:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:41:45,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:41:46,367 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:41:46,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:41:46 BoogieIcfgContainer [2018-11-14 16:41:46,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:41:46,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:41:46,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:41:46,372 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:41:46,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:41:44" (1/3) ... [2018-11-14 16:41:46,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4e80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:41:46, skipping insertion in model container [2018-11-14 16:41:46,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:41:45" (2/3) ... [2018-11-14 16:41:46,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4e80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:41:46, skipping insertion in model container [2018-11-14 16:41:46,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:41:46" (3/3) ... [2018-11-14 16:41:46,376 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-14 16:41:46,386 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:41:46,396 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-14 16:41:46,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-14 16:41:46,447 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:41:46,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:41:46,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:41:46,448 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:41:46,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:41:46,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:41:46,450 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:41:46,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:41:46,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:41:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 16:41:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:41:46,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:41:46,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:41:46,481 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:41:46,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:41:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-11-14 16:41:46,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:41:46,493 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-14 16:41:46,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:41:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:46,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:41:46,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 16:41:46,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {39#true} is VALID [2018-11-14 16:41:46,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 16:41:46,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #92#return; {39#true} is VALID [2018-11-14 16:41:46,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret7 := main(); {39#true} is VALID [2018-11-14 16:41:46,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#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; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 16:41:46,727 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 16:41:46,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume ~bvult32(~main__index2~0, 100000bv32); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 16:41:46,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !~bvult32(~main__index1~0, ~main__index2~0); {59#(= main_~main__loop_entered~0 (_ bv0 32))} is VALID [2018-11-14 16:41:46,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {59#(= main_~main__loop_entered~0 (_ bv0 32))} assume !(~main__loop_entered~0 == 0bv32); {40#false} is VALID [2018-11-14 16:41:46,738 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume ~bvult32(~main__index2~0, ~main__index1~0);havoc ~__tmp_3~0;call #t~mem5 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index1~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#main__array~0.base, ~bvadd32(~#main__array~0.offset, ~bvmul32(4bv32, ~main__index2~0)), 4bv32);~__tmp_3~0 := (if #t~mem5 == #t~mem6 then 1bv32 else 0bv32);havoc #t~mem6;havoc #t~mem5;havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {40#false} is VALID [2018-11-14 16:41:46,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} assume ~__VERIFIER_assert__cond~2 == 0bv32; {40#false} is VALID [2018-11-14 16:41:46,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 16:41:46,742 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-14 16:41:46,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:41:46,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:41:46,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:41:46,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:41:46,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:41:46,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:41:46,836 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-14 16:41:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:41:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:41:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:41:46,850 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-14 16:41:47,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:47,195 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-11-14 16:41:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:41:47,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-14 16:41:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:41:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 16:41:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2018-11-14 16:41:47,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2018-11-14 16:41:47,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:41:47,495 INFO L225 Difference]: With dead ends: 51 [2018-11-14 16:41:47,496 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 16:41:47,499 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-14 16:41:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 16:41:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-14 16:41:47,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:41:47,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-14 16:41:47,653 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-14 16:41:47,654 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-14 16:41:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:47,661 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 16:41:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 16:41:47,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:47,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:47,662 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-14 16:41:47,662 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-14 16:41:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:47,669 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 16:41:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 16:41:47,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:47,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:47,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:41:47,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:41:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:41:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 16:41:47,676 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-11-14 16:41:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:41:47,677 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 16:41:47,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:41:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 16:41:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:41:47,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:41:47,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:41:47,678 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:41:47,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:41:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-11-14 16:41:47,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:41:47,679 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-14 16:41:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:41:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:47,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:41:47,976 INFO L256 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2018-11-14 16:41:47,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {256#true} is VALID [2018-11-14 16:41:47,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2018-11-14 16:41:47,977 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #92#return; {256#true} is VALID [2018-11-14 16:41:47,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret7 := main(); {256#true} is VALID [2018-11-14 16:41:47,978 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#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; {256#true} is VALID [2018-11-14 16:41:47,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {256#true} is VALID [2018-11-14 16:41:47,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32); {256#true} is VALID [2018-11-14 16:41:47,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#true} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {256#true} is VALID [2018-11-14 16:41:47,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#true} assume ~bvult32(~main__index1~0, 100000bv32); {256#true} is VALID [2018-11-14 16:41:47,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {256#true} assume ~bvult32(~main__index2~0, 100000bv32);~main____CPAchecker_TMP_0~0 := 1bv32; {291#(= (_ bv1 32) main_~main____CPAchecker_TMP_0~0)} is VALID [2018-11-14 16:41:47,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {291#(= (_ 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; {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:41:47,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {295#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {257#false} is VALID [2018-11-14 16:41:47,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#false} assume !false; {257#false} is VALID [2018-11-14 16:41:47,989 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-14 16:41:47,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:41:47,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:41:47,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:41:47,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:41:47,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:41:47,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:41:48,088 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-14 16:41:48,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:41:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:41:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:41:48,089 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-11-14 16:41:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:48,485 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 16:41:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:41:48,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-14 16:41:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:41:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:41:48,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-14 16:41:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:41:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-14 16:41:48,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-14 16:41:48,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:41:48,701 INFO L225 Difference]: With dead ends: 51 [2018-11-14 16:41:48,701 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 16:41:48,703 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-14 16:41:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 16:41:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-11-14 16:41:48,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:41:48,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 33 states. [2018-11-14 16:41:48,739 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 33 states. [2018-11-14 16:41:48,739 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 33 states. [2018-11-14 16:41:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:48,743 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 16:41:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 16:41:48,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:48,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:48,745 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 49 states. [2018-11-14 16:41:48,745 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 49 states. [2018-11-14 16:41:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:48,749 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-14 16:41:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-14 16:41:48,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:48,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:48,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:41:48,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:41:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:41:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 16:41:48,754 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-11-14 16:41:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:41:48,754 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 16:41:48,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:41:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 16:41:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:41:48,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:41:48,756 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:41:48,756 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:41:48,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:41:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-11-14 16:41:48,757 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:41:48,757 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-14 16:41:48,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:41:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:48,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:41:48,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {515#true} is VALID [2018-11-14 16:41:48,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {515#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {515#true} is VALID [2018-11-14 16:41:48,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2018-11-14 16:41:48,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #92#return; {515#true} is VALID [2018-11-14 16:41:48,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret7 := main(); {515#true} is VALID [2018-11-14 16:41:48,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {515#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; {515#true} is VALID [2018-11-14 16:41:48,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {515#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:48,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index2~0, 100000bv32); {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:48,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {538#(bvult main_~main__index1~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:48,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(bvult main_~main__index1~0 (_ bv100000 32))} assume !~bvult32(~main__index1~0, 100000bv32); {516#false} is VALID [2018-11-14 16:41:48,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {516#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {516#false} is VALID [2018-11-14 16:41:48,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {516#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; {516#false} is VALID [2018-11-14 16:41:48,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {516#false} assume ~__VERIFIER_assert__cond~0 == 0bv32; {516#false} is VALID [2018-11-14 16:41:48,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {516#false} assume !false; {516#false} is VALID [2018-11-14 16:41:48,872 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-14 16:41:48,872 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:41:48,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:41:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:41:48,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-14 16:41:48,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:41:48,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:41:48,946 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-14 16:41:48,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:41:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:41:48,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:41:48,947 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-14 16:41:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,163 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 16:41:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:41:49,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-14 16:41:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:41:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 16:41:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2018-11-14 16:41:49,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2018-11-14 16:41:49,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:41:49,321 INFO L225 Difference]: With dead ends: 60 [2018-11-14 16:41:49,321 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 16:41:49,322 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-14 16:41:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 16:41:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-14 16:41:49,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:41:49,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 33 states. [2018-11-14 16:41:49,339 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 33 states. [2018-11-14 16:41:49,339 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 33 states. [2018-11-14 16:41:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,342 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 16:41:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 16:41:49,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:49,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:49,343 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 40 states. [2018-11-14 16:41:49,343 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 40 states. [2018-11-14 16:41:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,346 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 16:41:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 16:41:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:49,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:49,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:41:49,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:41:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 16:41:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 16:41:49,350 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-14 16:41:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:41:49,350 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 16:41:49,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:41:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 16:41:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:41:49,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:41:49,352 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:41:49,352 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:41:49,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:41:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-11-14 16:41:49,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:41:49,353 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-14 16:41:49,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:41:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:49,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:41:49,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2018-11-14 16:41:49,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~__return_main~0 := 0bv32;~__tmp_155_0~0 := 0bv32;~__return_136~0 := 0bv32; {766#true} is VALID [2018-11-14 16:41:49,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2018-11-14 16:41:49,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #92#return; {766#true} is VALID [2018-11-14 16:41:49,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret7 := main(); {766#true} is VALID [2018-11-14 16:41:49,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#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; {766#true} is VALID [2018-11-14 16:41:49,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {766#true} assume ~bvult32(~main__index1~0, 100000bv32);~main__index2~0 := #t~nondet2;havoc #t~nondet2; {766#true} is VALID [2018-11-14 16:41:49,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {766#true} assume ~bvult32(~main__index2~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:49,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, ~main__index2~0);havoc ~main____CPAchecker_TMP_0~0; {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:49,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume ~bvult32(~main__index1~0, 100000bv32); {792#(bvult main_~main__index2~0 (_ bv100000 32))} is VALID [2018-11-14 16:41:49,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {792#(bvult main_~main__index2~0 (_ bv100000 32))} assume !~bvult32(~main__index2~0, 100000bv32); {767#false} is VALID [2018-11-14 16:41:49,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} ~main____CPAchecker_TMP_0~0 := 0bv32; {767#false} is VALID [2018-11-14 16:41:49,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {767#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; {767#false} is VALID [2018-11-14 16:41:49,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {767#false} assume ~__VERIFIER_assert__cond~0 == 0bv32; {767#false} is VALID [2018-11-14 16:41:49,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {767#false} assume !false; {767#false} is VALID [2018-11-14 16:41:49,467 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-14 16:41:49,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:41:49,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:41:49,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:41:49,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:41:49,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:41:49,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:41:49,514 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-14 16:41:49,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:41:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:41:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:41:49,515 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 16:41:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,682 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 16:41:49,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:41:49,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:41:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:41:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 16:41:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:41:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 16:41:49,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 16:41:49,790 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-14 16:41:49,791 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:41:49,792 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 16:41:49,793 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-14 16:41:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 16:41:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-14 16:41:49,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:41:49,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 28 states. [2018-11-14 16:41:49,826 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 28 states. [2018-11-14 16:41:49,826 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 28 states. [2018-11-14 16:41:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,828 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:41:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:41:49,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:49,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:49,829 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 34 states. [2018-11-14 16:41:49,829 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 34 states. [2018-11-14 16:41:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:41:49,832 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:41:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:41:49,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:41:49,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:41:49,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:41:49,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:41:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:41:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 16:41:49,835 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-11-14 16:41:49,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:41:49,835 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 16:41:49,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:41:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:41:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:41:49,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:41:49,837 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-14 16:41:49,837 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:41:49,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:41:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-11-14 16:41:49,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:41:49,838 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-14 16:41:49,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:41:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:41:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-14 16:41:51,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:41:58,557 INFO L303 Elim1Store]: Index analysis took 2009 ms [2018-11-14 16:41:58,562 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-14 16:42:02,615 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-14 16:42:02,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:42:04,619 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-14 16:42:04,630 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:42:04,661 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:42:04,681 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:42:04,882 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:42:04,884 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-14 16:42:04,889 INFO L168 Benchmark]: Toolchain (without parser) took 19932.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -496.0 MB). Peak memory consumption was 276.8 MB. Max. memory is 7.1 GB. [2018-11-14 16:42:04,891 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:42:04,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.32 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-14 16:42:04,896 INFO L168 Benchmark]: Boogie Preprocessor took 75.30 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-14 16:42:04,896 INFO L168 Benchmark]: RCFGBuilder took 983.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:42:04,897 INFO L168 Benchmark]: TraceAbstraction took 18518.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 283.4 MB). Peak memory consumption was 283.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:42:04,904 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 350.32 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 75.30 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 983.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18518.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 283.4 MB). Peak memory consumption was 283.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...