java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:50:40,040 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:50:40,042 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:50:40,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:50:40,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:50:40,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:50:40,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:50:40,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:50:40,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:50:40,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:50:40,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:50:40,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:50:40,063 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:50:40,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:50:40,065 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:50:40,066 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:50:40,067 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:50:40,068 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:50:40,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:50:40,074 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:50:40,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:50:40,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:50:40,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:50:40,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:50:40,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:50:40,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:50:40,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:50:40,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:50:40,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:50:40,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:50:40,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:50:40,098 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:50:40,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:50:40,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:50:40,102 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:50:40,103 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:50:40,103 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:50:40,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:50:40,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:50:40,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:50:40,126 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:50:40,127 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:50:40,127 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:50:40,127 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:50:40,127 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:50:40,127 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:50:40,128 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:50:40,128 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:50:40,128 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:50:40,128 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:50:40,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:50:40,129 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:50:40,129 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:50:40,129 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:50:40,129 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:50:40,129 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:50:40,130 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:50:40,130 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:50:40,130 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:50:40,130 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:50:40,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:50:40,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:40,131 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:50:40,131 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:50:40,131 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:50:40,131 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:50:40,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:50:40,132 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:50:40,132 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:50:40,132 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:50:40,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:50:40,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:50:40,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:50:40,206 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:50:40,206 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:50:40,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c [2018-11-18 21:50:40,277 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742299f64/7fa534fde9884b11aecf96783b6cbd18/FLAG45711fee0 [2018-11-18 21:50:40,695 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:50:40,696 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test14_true-unreach-call_true-termination.c [2018-11-18 21:50:40,702 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742299f64/7fa534fde9884b11aecf96783b6cbd18/FLAG45711fee0 [2018-11-18 21:50:41,061 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742299f64/7fa534fde9884b11aecf96783b6cbd18 [2018-11-18 21:50:41,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:50:41,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:50:41,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:41,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:50:41,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:50:41,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364ae44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41, skipping insertion in model container [2018-11-18 21:50:41,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:50:41,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:50:41,388 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:41,409 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:50:41,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:50:41,463 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:50:41,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41 WrapperNode [2018-11-18 21:50:41,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:50:41,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:50:41,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:50:41,465 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:50:41,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... [2018-11-18 21:50:41,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:50:41,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:50:41,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:50:41,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:50:41,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:50:41,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:50:41,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:50:41,639 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-18 21:50:41,639 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:50:41,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:50:41,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:50:41,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:50:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:50:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:50:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:50:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:50:42,176 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:50:42,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:42 BoogieIcfgContainer [2018-11-18 21:50:42,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:50:42,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:50:42,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:50:42,182 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:50:42,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:50:41" (1/3) ... [2018-11-18 21:50:42,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d068ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:42, skipping insertion in model container [2018-11-18 21:50:42,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:50:41" (2/3) ... [2018-11-18 21:50:42,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d068ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:50:42, skipping insertion in model container [2018-11-18 21:50:42,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:50:42" (3/3) ... [2018-11-18 21:50:42,186 INFO L112 eAbstractionObserver]: Analyzing ICFG test14_true-unreach-call_true-termination.c [2018-11-18 21:50:42,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:50:42,205 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:50:42,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:50:42,255 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:50:42,256 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:50:42,257 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:50:42,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:50:42,257 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:50:42,257 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:50:42,258 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:50:42,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:50:42,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:50:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-18 21:50:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:50:42,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:42,286 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:42,288 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:42,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:42,295 INFO L82 PathProgramCache]: Analyzing trace with hash 521841741, now seen corresponding path program 1 times [2018-11-18 21:50:42,300 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:42,300 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:42,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:42,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:42,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-18 21:50:42,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {25#true} is VALID [2018-11-18 21:50:42,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-18 21:50:42,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #38#return; {25#true} is VALID [2018-11-18 21:50:42,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret9 := main(); {25#true} is VALID [2018-11-18 21:50:42,896 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(5bv32, ~#c~0.base, ~#c~0.offset, 4bv32);~a~1 := #t~nondet2;havoc #t~nondet2;~b~1 := #t~nondet3;havoc #t~nondet3;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; {45#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-18 21:50:42,896 INFO L256 TraceCheckUtils]: 6: Hoare triple {45#(not (= main_~pc~0.base (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := get_dummy(); {25#true} is VALID [2018-11-18 21:50:42,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#true} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {25#true} is VALID [2018-11-18 21:50:42,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#true} #res.base, #res.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset;havoc #t~nondet0; {25#true} is VALID [2018-11-18 21:50:42,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-18 21:50:42,900 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {25#true} {45#(not (= main_~pc~0.base (_ bv0 32)))} #42#return; {45#(not (= main_~pc~0.base (_ bv0 32)))} is VALID [2018-11-18 21:50:42,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#(not (= main_~pc~0.base (_ bv0 32)))} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {64#(not |main_#t~short8|)} is VALID [2018-11-18 21:50:42,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#(not |main_#t~short8|)} assume #t~short8; {26#false} is VALID [2018-11-18 21:50:42,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {26#false} assume #t~short8;havoc #t~short8;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {26#false} is VALID [2018-11-18 21:50:42,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-18 21:50:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:42,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:42,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:42,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:50:42,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:50:42,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:42,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:50:43,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:43,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:50:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:50:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:50:43,084 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2018-11-18 21:50:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:43,453 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 21:50:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:50:43,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 21:50:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-18 21:50:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:50:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-18 21:50:43,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2018-11-18 21:50:43,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:43,585 INFO L225 Difference]: With dead ends: 29 [2018-11-18 21:50:43,585 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 21:50:43,589 INFO L604 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-18 21:50:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 21:50:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 21:50:43,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:43,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:43,651 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:43,651 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:43,655 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 21:50:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-18 21:50:43,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:43,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:43,657 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:43,657 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:43,661 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-18 21:50:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-18 21:50:43,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:43,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:43,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:43,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 21:50:43,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-18 21:50:43,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-11-18 21:50:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:43,667 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-18 21:50:43,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:50:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-18 21:50:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 21:50:43,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:43,669 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:43,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1019657549, now seen corresponding path program 1 times [2018-11-18 21:50:43,670 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:43,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:43,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:44,058 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-18 21:50:44,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2018-11-18 21:50:44,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,417 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(= (_ bv0 32) |~#a~0.offset|)} assume true; {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {181#(= (_ bv0 32) |~#a~0.offset|)} {173#true} #38#return; {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {181#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret9 := main(); {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {181#(= (_ bv0 32) |~#a~0.offset|)} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(5bv32, ~#c~0.base, ~#c~0.offset, 4bv32);~a~1 := #t~nondet2;havoc #t~nondet2;~b~1 := #t~nondet3;havoc #t~nondet3;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; {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,436 INFO L256 TraceCheckUtils]: 6: Hoare triple {181#(= (_ bv0 32) |~#a~0.offset|)} call #t~ret4.base, #t~ret4.offset := get_dummy(); {181#(= (_ bv0 32) |~#a~0.offset|)} is VALID [2018-11-18 21:50:44,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#(= (_ bv0 32) |~#a~0.offset|)} assume 0bv8 != #t~nondet0;#t~ite1.base, #t~ite1.offset := ~#a~0.base, ~#a~0.offset; {200#(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-18 21:50:44,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#(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~ite1.base, #t~ite1.offset;havoc #t~nondet0; {204#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:44,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {204#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} assume true; {204#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} is VALID [2018-11-18 21:50:44,441 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {204#(and (= |get_dummy_#res.base| |~#a~0.base|) (= |get_dummy_#res.offset| |~#a~0.offset|) (= (_ bv0 32) |~#a~0.offset|))} {181#(= (_ bv0 32) |~#a~0.offset|)} #42#return; {211#(= (_ bv0 32) |main_#t~ret4.offset|)} is VALID [2018-11-18 21:50:44,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {211#(= (_ bv0 32) |main_#t~ret4.offset|)} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {215#(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-18 21:50:44,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#(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;#t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {215#(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-18 21:50:44,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#(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~short7;call #t~mem5 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem6 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short7 := #t~mem5 != #t~mem6; {222#(not |main_#t~short7|)} is VALID [2018-11-18 21:50:44,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {222#(not |main_#t~short7|)} #t~short8 := #t~short7; {226#(not |main_#t~short8|)} is VALID [2018-11-18 21:50:44,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#(not |main_#t~short8|)} assume #t~short8;havoc #t~short8;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {174#false} is VALID [2018-11-18 21:50:44,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {174#false} assume !false; {174#false} is VALID [2018-11-18 21:50:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:44,462 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:44,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:44,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 21:50:44,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:44,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:44,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 21:50:44,549 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-18 21:50:44,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 21:50:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 21:50:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 21:50:44,550 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2018-11-18 21:50:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:45,411 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-18 21:50:45,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 21:50:45,411 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:45,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2018-11-18 21:50:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 31 transitions. [2018-11-18 21:50:45,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 31 transitions. [2018-11-18 21:50:45,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:50:45,476 INFO L225 Difference]: With dead ends: 30 [2018-11-18 21:50:45,476 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 21:50:45,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-18 21:50:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 21:50:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 21:50:45,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:45,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:45,499 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:45,499 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:45,502 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:50:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:50:45,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:45,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:45,503 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:45,503 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:50:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:45,505 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:50:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:50:45,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:45,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:45,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:45,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 21:50:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-18 21:50:45,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 17 [2018-11-18 21:50:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:45,509 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-18 21:50:45,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 21:50:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:50:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 21:50:45,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:50:45,510 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:50:45,511 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:50:45,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:50:45,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1412684559, now seen corresponding path program 1 times [2018-11-18 21:50:45,511 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:50:45,512 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:50:45,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:50:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:50:45,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:50:45,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {343#true} is VALID [2018-11-18 21:50:45,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {343#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32); {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#(= (_ bv0 32) |~#b~0.offset|)} assume true; {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#(= (_ bv0 32) |~#b~0.offset|)} {343#true} #38#return; {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret9 := main(); {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#(= (_ bv0 32) |~#b~0.offset|)} havoc ~a~1;havoc ~b~1;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#c~0.base, ~#c~0.offset, 4bv32);call write~unchecked~intINTTYPE4(5bv32, ~#c~0.base, ~#c~0.offset, 4bv32);~a~1 := #t~nondet2;havoc #t~nondet2;~b~1 := #t~nondet3;havoc #t~nondet3;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; {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,803 INFO L256 TraceCheckUtils]: 6: Hoare triple {351#(= (_ bv0 32) |~#b~0.offset|)} call #t~ret4.base, #t~ret4.offset := get_dummy(); {351#(= (_ bv0 32) |~#b~0.offset|)} is VALID [2018-11-18 21:50:45,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {351#(= (_ bv0 32) |~#b~0.offset|)} assume !(0bv8 != #t~nondet0);#t~ite1.base, #t~ite1.offset := ~#b~0.base, ~#b~0.offset; {370#(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-18 21:50:45,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(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~ite1.base, #t~ite1.offset;havoc #t~nondet0; {374#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-18 21:50:45,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} assume true; {374#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} is VALID [2018-11-18 21:50:45,809 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {374#(and (= |get_dummy_#res.offset| |~#b~0.offset|) (= (_ bv0 32) |~#b~0.offset|) (= |~#b~0.base| |get_dummy_#res.base|))} {351#(= (_ bv0 32) |~#b~0.offset|)} #42#return; {381#(= (_ bv0 32) |main_#t~ret4.offset|)} is VALID [2018-11-18 21:50:45,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {381#(= (_ bv0 32) |main_#t~ret4.offset|)} ~pb~0.base, ~pb~0.offset := #t~ret4.base, #t~ret4.offset;~pa~0.base, ~pa~0.offset := ~pb~0.base, ~pb~0.offset;havoc #t~ret4.base, #t~ret4.offset;#t~short8 := ~pc~0.base == 0bv32 && ~pc~0.offset == 0bv32; {385#(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-18 21:50:45,813 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#(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;#t~short7 := ~pa~0.base == ~pb~0.base && ~pa~0.offset == ~pb~0.offset; {385#(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-18 21:50:45,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#(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~short7;call #t~mem5 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32);call #t~mem6 := read~intINTTYPE4(~pb~0.base, ~pb~0.offset, 4bv32);#t~short7 := #t~mem5 != #t~mem6; {392#(not |main_#t~short7|)} is VALID [2018-11-18 21:50:45,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#(not |main_#t~short7|)} #t~short8 := #t~short7; {396#(not |main_#t~short8|)} is VALID [2018-11-18 21:50:45,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {396#(not |main_#t~short8|)} assume #t~short8;havoc #t~short8;havoc #t~mem5;havoc #t~mem6;havoc #t~short7; {344#false} is VALID [2018-11-18 21:50:45,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {344#false} assume !false; {344#false} is VALID [2018-11-18 21:50:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:50:45,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:50:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:50:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 21:50:45,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:45,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:50:45,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 21:50:45,855 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-18 21:50:45,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 21:50:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 21:50:45,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 21:50:45,857 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand 9 states. [2018-11-18 21:50:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:46,278 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:50:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 21:50:46,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-18 21:50:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:50:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-18 21:50:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 21:50:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-11-18 21:50:46,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 17 transitions. [2018-11-18 21:50:46,433 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-18 21:50:46,433 INFO L225 Difference]: With dead ends: 18 [2018-11-18 21:50:46,434 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 21:50:46,434 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-18 21:50:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 21:50:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 21:50:46,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:50:46,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:46,435 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:46,436 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:46,436 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:46,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:46,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:46,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:46,437 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:46,437 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:50:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:50:46,438 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:50:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:46,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:46,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:50:46,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:50:46,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:50:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 21:50:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 21:50:46,440 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-18 21:50:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:50:46,440 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 21:50:46,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 21:50:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:50:46,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:50:46,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 21:50:46,674 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:46,675 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:46,675 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:46,675 INFO L425 ceAbstractionStarter]: For program point get_dummyFINAL(lines 7 10) no Hoare annotation was computed. [2018-11-18 21:50:46,675 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-18 21:50:46,675 INFO L428 ceAbstractionStarter]: At program point get_dummyENTRY(lines 7 10) the Hoare annotation is: true [2018-11-18 21:50:46,676 INFO L425 ceAbstractionStarter]: For program point get_dummyEXIT(lines 7 10) no Hoare annotation was computed. [2018-11-18 21:50:46,676 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:50:46,676 INFO L421 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-18 21:50:46,676 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:50:46,676 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:50:46,676 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 12 27) the Hoare annotation is: true [2018-11-18 21:50:46,676 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 12 27) no Hoare annotation was computed. [2018-11-18 21:50:46,677 INFO L421 ceAbstractionStarter]: At program point L20(lines 12 27) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-18 21:50:46,677 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-18 21:50:46,677 INFO L425 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-11-18 21:50:46,677 INFO L421 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: (or (not (= |~#a~0.offset| (_ bv0 32))) (not (= main_~pc~0.base (_ bv0 32))) (not (= (_ bv0 32) |~#b~0.offset|))) [2018-11-18 21:50:46,677 INFO L425 ceAbstractionStarter]: For program point L19-2(line 19) no Hoare annotation was computed. [2018-11-18 21:50:46,677 INFO L425 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2018-11-18 21:50:46,678 INFO L425 ceAbstractionStarter]: For program point L18-2(lines 18 21) no Hoare annotation was computed. [2018-11-18 21:50:46,678 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 12 27) no Hoare annotation was computed. [2018-11-18 21:50:46,678 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-18 21:50:46,680 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:46,680 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:46,680 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:46,681 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:50:46,681 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:46,681 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2018-11-18 21:50:46,681 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: get_dummyFINAL has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: get_dummyEXIT has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2018-11-18 21:50:46,682 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2018-11-18 21:50:46,683 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:50:46,683 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-18 21:50:46,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:50:46 BoogieIcfgContainer [2018-11-18 21:50:46,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:50:46,696 INFO L168 Benchmark]: Toolchain (without parser) took 5624.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -486.5 MB). Peak memory consumption was 235.5 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:46,697 INFO L168 Benchmark]: CDTParser took 0.24 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-18 21:50:46,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:46,699 INFO L168 Benchmark]: Boogie Preprocessor took 47.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:50:46,700 INFO L168 Benchmark]: RCFGBuilder took 664.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:46,701 INFO L168 Benchmark]: TraceAbstraction took 4515.62 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: 262.1 MB). Peak memory consumption was 262.1 MB. Max. memory is 7.1 GB. [2018-11-18 21:50:46,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.58 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 47.71 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 664.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 721.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -759.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4515.62 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: 262.1 MB). Peak memory consumption was 262.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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, 22 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 40 SDslu, 132 SDs, 0 SdLazy, 100 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 33 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 37 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 2758 SizeOfPredicates, 23 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...