java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:29,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:29,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:29,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:29,366 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:29,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:29,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:29,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:29,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:29,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:29,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:29,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:29,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:29,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:29,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:29,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:29,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:29,397 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:29,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:29,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:29,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:29,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:29,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:29,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:29,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:29,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:29,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:29,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:29,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:29,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:29,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:29,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:29,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:29,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:29,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:29,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:29,424 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:29,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:29,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:29,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:29,448 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:29,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:29,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:29,449 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:29,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:29,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:29,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:29,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:29,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:29,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:29,451 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:29,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:29,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:29,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:29,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:29,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:29,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:29,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:29,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:29,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:29,453 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:29,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:29,453 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:29,454 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:29,454 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:29,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:29,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:29,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:29,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:29,534 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:29,535 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-23 11:07:29,596 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71010a84d/83ec7fb83d5140b191b8b03c65d71055/FLAGc8c42e111 [2018-11-23 11:07:30,005 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:30,006 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test11_true-unreach-call_true-termination.c [2018-11-23 11:07:30,012 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71010a84d/83ec7fb83d5140b191b8b03c65d71055/FLAGc8c42e111 [2018-11-23 11:07:30,376 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71010a84d/83ec7fb83d5140b191b8b03c65d71055 [2018-11-23 11:07:30,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:30,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:30,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:30,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:30,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:30,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22abce84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30, skipping insertion in model container [2018-11-23 11:07:30,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:30,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:30,692 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:30,715 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:30,740 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:30,765 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:30,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30 WrapperNode [2018-11-23 11:07:30,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:30,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:30,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:30,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:30,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:30,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:30,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:30,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:30,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... [2018-11-23 11:07:30,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:30,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:30,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:30,851 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:30,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:30,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 11:07:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 11:07:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:30,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:07:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:07:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:31,544 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:31,544 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:07:31,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:31 BoogieIcfgContainer [2018-11-23 11:07:31,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:31,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:31,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:31,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:31,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:30" (1/3) ... [2018-11-23 11:07:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40362c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:31, skipping insertion in model container [2018-11-23 11:07:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:30" (2/3) ... [2018-11-23 11:07:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40362c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:31, skipping insertion in model container [2018-11-23 11:07:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:31" (3/3) ... [2018-11-23 11:07:31,553 INFO L112 eAbstractionObserver]: Analyzing ICFG test11_true-unreach-call_true-termination.c [2018-11-23 11:07:31,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:31,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:31,593 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:31,627 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:31,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:31,628 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:31,628 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:31,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:31,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:31,629 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:31,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:31,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:07:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:07:31,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:31,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:31,656 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:31,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -722462527, now seen corresponding path program 1 times [2018-11-23 11:07:31,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:31,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:31,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:32,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 11:07:32,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {26#true} is VALID [2018-11-23 11:07:32,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:07:32,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2018-11-23 11:07:32,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret11 := main(); {26#true} is VALID [2018-11-23 11:07:32,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {46#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-23 11:07:32,157 INFO L256 TraceCheckUtils]: 6: Hoare triple {46#(not (= main_~pc~0.base (_ bv0 32)))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {26#true} is VALID [2018-11-23 11:07:32,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {26#true} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {26#true} is VALID [2018-11-23 11:07:32,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {26#true} is VALID [2018-11-23 11:07:32,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:07:32,168 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {26#true} {46#(not (= main_~pc~0.base (_ bv0 32)))} #47#return; {46#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-23 11:07:32,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#(not (= main_~pc~0.base (_ bv0 32)))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {65#(not |main_#t~short9|)} is VALID [2018-11-23 11:07:32,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {65#(not |main_#t~short9|)} assume #t~short9; {27#false} is VALID [2018-11-23 11:07:32,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {27#false} assume #t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~short8;havoc #t~mem6; {27#false} is VALID [2018-11-23 11:07:32,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 11:07:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:32,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:32,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:07:32,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:07:32,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:32,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:07:32,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:32,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:07:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:07:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:07:32,357 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2018-11-23 11:07:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:32,713 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:07:32,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:07:32,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 11:07:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 11:07:32,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2018-11-23 11:07:32,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2018-11-23 11:07:32,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:32,870 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:07:32,870 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:07:32,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:07:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:07:33,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:33,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:33,011 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:33,012 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:33,016 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:07:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:07:33,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:33,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:33,017 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:33,017 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:07:33,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:33,021 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 11:07:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:07:33,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:33,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:33,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:33,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:07:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 11:07:33,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2018-11-23 11:07:33,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:33,031 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 11:07:33,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:07:33,032 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:07:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:07:33,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:33,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:33,034 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:33,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1499811687, now seen corresponding path program 1 times [2018-11-23 11:07:33,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:33,036 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:33,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:33,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:33,477 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:07:33,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {179#true} call ULTIMATE.init(); {179#true} is VALID [2018-11-23 11:07:33,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {179#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,687 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} assume true; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,696 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#(= (_ bv0 32) |~#a~0.offset|)} {179#true} #43#return; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret11 := main(); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,700 INFO L256 TraceCheckUtils]: 6: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret5.base, #t~ret5.offset := get_dummy(); {187#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-23 11:07:33,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {187#(= (_ bv0 32) |~#a~0.offset|)} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {206#(and (= |get_dummy_#t~ite1.offset| |~#a~0.offset|) (= |~#a~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:33,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#(and (= |get_dummy_#t~ite1.offset| |~#a~0.offset|) (= |~#a~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#a~0.offset|))} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:33,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} assume true; {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-23 11:07:33,722 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {210#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} {187#(= (_ bv0 32) |~#a~0.offset|)} #47#return; {217#(= |main_#t~ret5.offset| (_ bv0 32))} is VALID [2018-11-23 11:07:33,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {217#(= |main_#t~ret5.offset| (_ bv0 32))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-23 11:07:33,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-23 11:07:33,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {228#(not |main_#t~short8|)} is VALID [2018-11-23 11:07:33,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {228#(not |main_#t~short8|)} #t~short9 := #t~short8; {232#(not |main_#t~short9|)} is VALID [2018-11-23 11:07:33,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#(not |main_#t~short9|)} assume #t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~short8;havoc #t~mem6; {180#false} is VALID [2018-11-23 11:07:33,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {180#false} assume !false; {180#false} is VALID [2018-11-23 11:07:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:33,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:33,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:33,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:07:33,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 11:07:33,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:33,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:07:33,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:33,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:07:33,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:07:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:07:33,820 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 9 states. [2018-11-23 11:07:34,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:34,762 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 11:07:34,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:07:34,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 11:07:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:07:34,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 11:07:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:07:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 11:07:34,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2018-11-23 11:07:34,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:34,844 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:07:34,845 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:07:34,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:07:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:07:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-11-23 11:07:34,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:34,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2018-11-23 11:07:34,868 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2018-11-23 11:07:34,869 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2018-11-23 11:07:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:34,872 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:07:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:07:34,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:34,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:34,873 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2018-11-23 11:07:34,873 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2018-11-23 11:07:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:34,877 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:07:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 11:07:34,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:34,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:34,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:34,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:07:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 11:07:34,881 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 11:07:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:34,882 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 11:07:34,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:07:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 11:07:34,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:07:34,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:34,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:34,883 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:34,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:34,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1106784677, now seen corresponding path program 1 times [2018-11-23 11:07:34,884 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:34,885 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:34,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:34,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:35,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-23 11:07:35,082 INFO L478 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-23 11:07:35,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-23 11:07:35,186 INFO L478 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 20 treesize of output 19 [2018-11-23 11:07:35,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-11-23 11:07:35,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:07:35,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:07:35,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:07:35,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:35,547 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:31, output treesize:3 [2018-11-23 11:07:35,570 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:35,570 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, |~#a~0.base|, |~#a~0.offset|, |v_main_#t~nondet3_3|, |v_main_#t~nondet4_3|]. (and (= (let ((.cse0 (store |v_#memory_int_10| |~#a~0.base| (store (select |v_#memory_int_10| |~#a~0.base|) |~#a~0.offset| |v_main_#t~nondet3_3|)))) (store .cse0 |~#b~0.base| (store (select .cse0 |~#b~0.base|) |~#b~0.offset| |v_main_#t~nondet4_3|))) |#memory_int|) (= (_ bv0 32) |~#b~0.offset|)) [2018-11-23 11:07:35,570 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |~#b~0.offset|) [2018-11-23 11:07:35,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {391#true} call ULTIMATE.init(); {391#true} is VALID [2018-11-23 11:07:35,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {391#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} assume true; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {399#(= (_ bv0 32) |~#b~0.offset|)} {391#true} #43#return; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret11 := main(); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,730 INFO L256 TraceCheckUtils]: 6: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret5.base, #t~ret5.offset := get_dummy(); {399#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-23 11:07:35,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {399#(= (_ bv0 32) |~#b~0.offset|)} assume !(0bv8 != #t~nondet0);#t~ite1.base, #t~ite1.offset := ~#b~0.base, ~#b~0.offset; {418#(and (= |~#b~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#b~0.offset|) (= |get_dummy_#t~ite1.offset| |~#b~0.offset|))} is VALID [2018-11-23 11:07:35,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(and (= |~#b~0.base| |get_dummy_#t~ite1.base|) (= (_ bv0 32) |~#b~0.offset|) (= |get_dummy_#t~ite1.offset| |~#b~0.offset|))} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 11:07:35,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} assume true; {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-23 11:07:35,735 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {422#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} {399#(= (_ bv0 32) |~#b~0.offset|)} #47#return; {429#(= |main_#t~ret5.offset| (_ bv0 32))} is VALID [2018-11-23 11:07:35,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {429#(= |main_#t~ret5.offset| (_ bv0 32))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-23 11:07:35,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} is VALID [2018-11-23 11:07:35,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {433#(and (= main_~pa~0.base main_~pb~0.base) (= main_~pa~0.offset main_~pb~0.offset) (= (_ bv0 32) main_~pb~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {440#(not |main_#t~short8|)} is VALID [2018-11-23 11:07:35,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {440#(not |main_#t~short8|)} #t~short9 := #t~short8; {444#(not |main_#t~short9|)} is VALID [2018-11-23 11:07:35,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {444#(not |main_#t~short9|)} assume #t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~short8;havoc #t~mem6; {392#false} is VALID [2018-11-23 11:07:35,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#false} assume !false; {392#false} is VALID [2018-11-23 11:07:35,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:35,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:35,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:35,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:07:35,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 11:07:35,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:35,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:07:35,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:35,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:07:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:07:35,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:07:35,782 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 9 states. [2018-11-23 11:07:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:36,831 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 11:07:36,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:07:36,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-23 11:07:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:07:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-23 11:07:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:07:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-23 11:07:36,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2018-11-23 11:07:36,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:36,900 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:07:36,900 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 11:07:36,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:07:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 11:07:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-11-23 11:07:36,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:36,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 19 states. [2018-11-23 11:07:36,926 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 19 states. [2018-11-23 11:07:36,926 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 19 states. [2018-11-23 11:07:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:36,928 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 11:07:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:07:36,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:36,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:36,929 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 34 states. [2018-11-23 11:07:36,930 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 34 states. [2018-11-23 11:07:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:36,932 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 11:07:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 11:07:36,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:36,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:36,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:36,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:07:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:07:36,936 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-11-23 11:07:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:36,936 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:07:36,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:07:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:07:36,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:07:36,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:36,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:36,938 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:36,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -750476091, now seen corresponding path program 1 times [2018-11-23 11:07:36,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:36,939 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:37,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:37,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-23 11:07:37,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {601#true} is VALID [2018-11-23 11:07:37,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 11:07:37,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} #43#return; {601#true} is VALID [2018-11-23 11:07:37,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {601#true} call #t~ret11 := main(); {601#true} is VALID [2018-11-23 11:07:37,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#true} call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(#t~nondet2, ~#c~0.base, ~#c~0.offset, 4bv32);havoc #t~nondet2;havoc ~pa~0.base, ~pa~0.offset;havoc ~pb~0.base, ~pb~0.offset;~pc~0.base, ~pc~0.offset := ~#c~0.base, ~#c~0.offset;call write~intINTTYPE4(#t~nondet3, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~nondet3;call write~intINTTYPE4(#t~nondet4, ~#b~0.base, ~#b~0.offset, 4bv32);havoc #t~nondet4; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,175 INFO L256 TraceCheckUtils]: 6: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} call #t~ret5.base, #t~ret5.offset := get_dummy(); {601#true} is VALID [2018-11-23 11:07:37,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {601#true} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {601#true} is VALID [2018-11-23 11:07:37,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {601#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~nondet0;havoc #t~ite1.base, #t~ite1.offset; {601#true} is VALID [2018-11-23 11:07:37,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 11:07:37,177 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {601#true} {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} #47#return; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} ~pb~0.base, ~pb~0.offset := #t~ret5.base, #t~ret5.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret5.base, #t~ret5.offset;#t~short9 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume !#t~short9;#t~short8 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume #t~short8;call #t~mem6 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short8 := #t~mem6 != #t~mem7; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} #t~short9 := #t~short8; {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} is VALID [2018-11-23 11:07:37,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#(and (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset))} assume !#t~short9;havoc #t~short9;havoc #t~mem7;havoc #t~short8;havoc #t~mem6;call write~intINTTYPE4(60bv32, ~pc~0.base, ~pc~0.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~#c~0.base, ~#c~0.offset, 4bv32); {652#(= (bvadd |main_#t~mem10| (_ bv4294967236 32)) (_ bv0 32))} is VALID [2018-11-23 11:07:37,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {652#(= (bvadd |main_#t~mem10| (_ bv4294967236 32)) (_ bv0 32))} assume 60bv32 != #t~mem10;havoc #t~mem10; {602#false} is VALID [2018-11-23 11:07:37,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-23 11:07:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:37,226 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:37,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:37,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:07:37,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:07:37,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:37,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:07:37,258 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-23 11:07:37,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:07:37,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:07:37,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:07:37,259 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-11-23 11:07:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:37,395 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:07:37,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:07:37,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:07:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-23 11:07:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:07:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-23 11:07:37,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2018-11-23 11:07:37,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:37,435 INFO L225 Difference]: With dead ends: 19 [2018-11-23 11:07:37,435 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:07:37,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:07:37,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:07:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:07:37,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:37,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:37,437 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:37,438 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:37,438 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:07:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:37,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:37,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:37,439 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:37,439 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:07:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:37,439 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:07:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:37,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:37,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:37,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:37,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:07:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:07:37,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-23 11:07:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:37,441 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:07:37,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:07:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:07:37,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:37,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:07:37,702 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:07:37,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2018-11-23 11:07:37,703 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:07:37,703 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv0 32) |~#b~0.offset|) (= (_ bv0 32) |~#a~0.offset|)) [2018-11-23 11:07:37,704 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:07:37,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:07:37,704 INFO L444 ceAbstractionStarter]: At program point L25(lines 12 32) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-23 11:07:37,704 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-11-23 11:07:37,704 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 11:07:37,705 INFO L444 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (and (not (= main_~pc~0.base (_ bv0 32))) (= |main_~#c~0.offset| (_ bv0 32)) (= main_~pc~0.base |main_~#c~0.base|) (= |main_~#c~0.offset| main_~pc~0.offset)) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-23 11:07:37,705 INFO L448 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2018-11-23 11:07:37,705 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-23 11:07:37,705 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-11-23 11:07:37,705 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-11-23 11:07:37,706 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 11:07:37,706 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-23 11:07:37,706 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-23 11:07:37,706 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 30) no Hoare annotation was computed. [2018-11-23 11:07:37,708 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:07:37,708 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 11:07:37,708 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 11:07:37,716 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:07:37,716 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-23 11:07:37,716 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:07:37,716 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 11:07:37,716 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:07:37,717 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:07:37,718 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:07:37,718 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:07:37,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:07:37 BoogieIcfgContainer [2018-11-23 11:07:37,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:07:37,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:07:37,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:07:37,728 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:07:37,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:31" (3/4) ... [2018-11-23 11:07:37,732 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:07:37,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:07:37,739 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-11-23 11:07:37,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:07:37,745 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 11:07:37,746 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 11:07:37,746 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 11:07:37,801 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test11_true-unreach-call_true-termination.c-witness.graphml [2018-11-23 11:07:37,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:07:37,803 INFO L168 Benchmark]: Toolchain (without parser) took 7417.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -363.1 MB). Peak memory consumption was 374.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:37,804 INFO L168 Benchmark]: CDTParser took 0.22 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-23 11:07:37,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:37,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.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-23 11:07:37,806 INFO L168 Benchmark]: Boogie Preprocessor took 48.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:07:37,806 INFO L168 Benchmark]: RCFGBuilder took 695.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:37,807 INFO L168 Benchmark]: TraceAbstraction took 6182.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 401.6 MB). Peak memory consumption was 401.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:07:37,808 INFO L168 Benchmark]: Witness Printer took 73.58 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:07:37,812 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.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. * Boogie Preprocessor took 48.43 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 695.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6182.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 401.6 MB). Peak memory consumption was 401.6 MB. Max. memory is 7.1 GB. * Witness Printer took 73.58 ms. Allocated memory is still 2.3 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: !(a == 0bv32) || !(0bv32 == b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. SAFE Result, 6.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 62 SDslu, 228 SDs, 0 SdLazy, 157 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 43 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 4033 SizeOfPredicates, 30 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...