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-Const.epf -i ../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:27:07,341 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:27:07,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:27:07,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:27:07,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:27:07,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:27:07,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:27:07,369 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:27:07,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:27:07,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:27:07,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:27:07,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:27:07,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:27:07,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:27:07,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:27:07,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:27:07,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:27:07,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:27:07,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:27:07,384 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:27:07,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:27:07,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:27:07,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:27:07,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:27:07,390 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:27:07,391 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:27:07,392 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:27:07,393 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:27:07,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:27:07,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:27:07,395 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:27:07,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:27:07,396 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:27:07,396 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:27:07,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:27:07,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:27:07,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:27:07,414 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:27:07,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:27:07,415 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:27:07,415 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:27:07,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:27:07,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:27:07,416 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:27:07,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:27:07,417 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:27:07,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:27:07,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:27:07,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:27:07,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:27:07,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:27:07,421 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:27:07,421 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:27:07,421 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:27:07,421 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:27:07,421 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:27:07,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:27:07,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:27:07,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:27:07,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:27:07,422 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:27:07,424 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:27:07,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:27:07,424 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:27:07,424 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:27:07,428 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:27:07,428 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:27:07,428 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:27:07,428 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:27:07,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:27:07,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:27:07,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:27:07,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:27:07,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:27:07,500 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:27:07,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-11-14 18:27:07,568 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88166d276/7948702fcab94df698d39bf8683b10b8/FLAG8346c71ff [2018-11-14 18:27:08,044 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:27:08,045 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_true-unreach-call.i [2018-11-14 18:27:08,052 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88166d276/7948702fcab94df698d39bf8683b10b8/FLAG8346c71ff [2018-11-14 18:27:08,067 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88166d276/7948702fcab94df698d39bf8683b10b8 [2018-11-14 18:27:08,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:27:08,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:27:08,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:27:08,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:27:08,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:27:08,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba1e25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08, skipping insertion in model container [2018-11-14 18:27:08,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:27:08,131 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:27:08,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:27:08,401 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:27:08,443 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:27:08,469 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:27:08,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08 WrapperNode [2018-11-14 18:27:08,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:27:08,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:27:08,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:27:08,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:27:08,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (1/1) ... [2018-11-14 18:27:08,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:27:08,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:27:08,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:27:08,526 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:27:08,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (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 18:27:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:27:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:27:08,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:27:08,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:27:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:27:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:27:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:27:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:27:08,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 18:27:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:27:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:27:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:27:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:27:08,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:27:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:27:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:27:08,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:27:09,399 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:27:09,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:27:09 BoogieIcfgContainer [2018-11-14 18:27:09,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:27:09,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:27:09,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:27:09,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:27:09,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:27:08" (1/3) ... [2018-11-14 18:27:09,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141297f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:27:09, skipping insertion in model container [2018-11-14 18:27:09,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:27:08" (2/3) ... [2018-11-14 18:27:09,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141297f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:27:09, skipping insertion in model container [2018-11-14 18:27:09,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:27:09" (3/3) ... [2018-11-14 18:27:09,409 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_true-unreach-call.i [2018-11-14 18:27:09,417 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:27:09,425 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:27:09,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:27:09,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:27:09,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:27:09,475 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:27:09,475 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:27:09,475 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:27:09,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:27:09,477 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:27:09,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:27:09,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:27:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-14 18:27:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:27:09,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:09,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:09,508 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -22757593, now seen corresponding path program 1 times [2018-11-14 18:27:09,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:09,519 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 18:27:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:09,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:09,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-14 18:27:09,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {39#true} is VALID [2018-11-14 18:27:09,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-14 18:27:09,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2018-11-14 18:27:09,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret15 := main(); {39#true} is VALID [2018-11-14 18:27:09,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));havoc ~i~0;~i~0 := 0bv32; {39#true} is VALID [2018-11-14 18:27:09,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-14 18:27:09,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-14 18:27:09,713 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 18:27:09,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-14 18:27:09,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-14 18:27:09,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0bv32; {40#false} is VALID [2018-11-14 18:27:09,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume true; {40#false} is VALID [2018-11-14 18:27:09,715 INFO L273 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!~bvult32(~i~0, ~M~0);call #t~mem14 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {40#false} is VALID [2018-11-14 18:27:09,715 INFO L256 TraceCheckUtils]: 14: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem14 == ~bvadd32(#t~mem12, #t~mem13) then 1bv32 else 0bv32)); {40#false} is VALID [2018-11-14 18:27:09,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-14 18:27:09,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume ~cond == 0bv32; {40#false} is VALID [2018-11-14 18:27:09,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-14 18:27:09,720 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 18:27:09,720 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:27:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:27:09,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:27:09,733 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:27:09,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:09,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:27:09,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:09,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:27:09,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:27:09,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:27:09,916 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-14 18:27:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:10,105 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-14 18:27:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:27:10,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:27:10,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:27:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 18:27:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:27:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2018-11-14 18:27:10,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 80 transitions. [2018-11-14 18:27:10,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:10,462 INFO L225 Difference]: With dead ends: 62 [2018-11-14 18:27:10,463 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 18:27:10,466 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:27:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 18:27:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-14 18:27:10,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:10,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-14 18:27:10,529 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:27:10,529 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:27:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:10,534 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 18:27:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:27:10,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:10,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:10,536 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-14 18:27:10,536 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-14 18:27:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:10,541 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 18:27:10,541 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:27:10,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:10,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:10,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:10,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:27:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-14 18:27:10,547 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-11-14 18:27:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:10,548 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-14 18:27:10,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:27:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-14 18:27:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:27:10,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:10,549 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, 1] [2018-11-14 18:27:10,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:10,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash -437499402, now seen corresponding path program 1 times [2018-11-14 18:27:10,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:10,551 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 18:27:10,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:10,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:11,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2018-11-14 18:27:11,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {274#true} is VALID [2018-11-14 18:27:11,095 INFO L273 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2018-11-14 18:27:11,095 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #91#return; {274#true} is VALID [2018-11-14 18:27:11,095 INFO L256 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret15 := main(); {274#true} is VALID [2018-11-14 18:27:11,096 INFO L273 TraceCheckUtils]: 5: Hoare triple {274#true} ~M~0 := #t~nondet1;havoc #t~nondet1;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~M~0));havoc ~i~0;~i~0 := 0bv32; {274#true} is VALID [2018-11-14 18:27:11,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#true} assume true; {274#true} is VALID [2018-11-14 18:27:11,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#true} assume !~bvult32(~i~0, ~M~0); {274#true} is VALID [2018-11-14 18:27:11,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#true} ~i~0 := 0bv32; {303#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:27:11,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {303#(= main_~i~0 (_ bv0 32))} assume true; {303#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:27:11,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {303#(= main_~i~0 (_ bv0 32))} assume !~bvult32(~i~0, ~M~0); {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} ~i~0 := 0bv32; {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} assume true; {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} assume !~bvult32(~i~0, ~M~0); {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} ~i~0 := 0bv32; {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} assume true; {310#(not (bvult (_ bv0 32) main_~M~0))} is VALID [2018-11-14 18:27:11,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {310#(not (bvult (_ bv0 32) main_~M~0))} assume !!~bvult32(~i~0, ~M~0);call #t~mem14 := read~intINTTYPE4(~#C~0.base, ~bvadd32(~#C~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~#B~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {275#false} is VALID [2018-11-14 18:27:11,113 INFO L256 TraceCheckUtils]: 17: Hoare triple {275#false} call __VERIFIER_assert((if #t~mem14 == ~bvadd32(#t~mem12, #t~mem13) then 1bv32 else 0bv32)); {275#false} is VALID [2018-11-14 18:27:11,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2018-11-14 18:27:11,113 INFO L273 TraceCheckUtils]: 19: Hoare triple {275#false} assume ~cond == 0bv32; {275#false} is VALID [2018-11-14 18:27:11,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {275#false} assume !false; {275#false} is VALID [2018-11-14 18:27:11,116 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 18:27:11,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:27:11,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:27:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:27:11,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:27:11,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:27:11,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:27:11,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:27:11,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:27:11,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:27:11,182 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-11-14 18:27:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:11,834 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 18:27:11,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:27:11,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-14 18:27:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:27:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:27:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 18:27:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:27:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2018-11-14 18:27:11,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2018-11-14 18:27:12,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:27:12,147 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:27:12,147 INFO L226 Difference]: Without dead ends: 47 [2018-11-14 18:27:12,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:27:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-14 18:27:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2018-11-14 18:27:12,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:27:12,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 37 states. [2018-11-14 18:27:12,179 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 37 states. [2018-11-14 18:27:12,180 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 37 states. [2018-11-14 18:27:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:12,185 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 18:27:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:27:12,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:12,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:12,186 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 47 states. [2018-11-14 18:27:12,187 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 47 states. [2018-11-14 18:27:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:27:12,191 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-14 18:27:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:27:12,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:27:12,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:27:12,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:27:12,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:27:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:27:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-14 18:27:12,196 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2018-11-14 18:27:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:27:12,196 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-14 18:27:12,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:27:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-14 18:27:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:27:12,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:27:12,198 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:27:12,198 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:27:12,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:27:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash -629873798, now seen corresponding path program 1 times [2018-11-14 18:27:12,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:27:12,200 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 18:27:12,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:27:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:27:12,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:27:12,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:12,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-14 18:27:12,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:12,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:27:12,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-14 18:27:12,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-11-14 18:27:12,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:27:12,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:27:12,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:12,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-11-14 18:27:12,973 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:13,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 18:27:13,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:27:13,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2018-11-14 18:27:13,354 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:27:13,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-14 18:27:13,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-14 18:27:13,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:27:13,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-11-14 18:27:14,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-14 18:27:14,424 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:27:14,426 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.term(WrapperScript.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.notSimplified(BitvectorUtils.java:263) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplify_NonConstantCase(BitvectorUtils.java:259) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils.termWithLocalSimplification(BitvectorUtils.java:180) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.neg(SmtUtils.java:560) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.product(AffineRelation.java:350) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.onLeftHandSideOnly(AffineRelation.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:145) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqTerms(EqualityInformation.java:193) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.addComplimentaryEqualityInformation(Elim1Store.java:853) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.collectComplimentaryEqualityInformation(Elim1Store.java:894) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:284) 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 18:27:14,431 INFO L168 Benchmark]: Toolchain (without parser) took 6352.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -452.6 MB). Peak memory consumption was 286.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:14,433 INFO L168 Benchmark]: CDTParser took 0.23 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 18:27:14,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.96 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 18:27:14,435 INFO L168 Benchmark]: Boogie Preprocessor took 55.01 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 18:27:14,436 INFO L168 Benchmark]: RCFGBuilder took 874.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:14,437 INFO L168 Benchmark]: TraceAbstraction took 5028.77 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: 305.9 MB). Peak memory consumption was 305.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:27:14,442 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.23 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 389.96 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 55.01 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 874.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -769.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5028.77 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: 305.9 MB). Peak memory consumption was 305.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...