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/rule60_list_true-termination.c_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:06:44,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:06:44,812 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:06:44,830 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:06:44,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:06:44,832 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:06:44,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:06:44,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:06:44,839 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:06:44,846 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:06:44,847 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:06:44,847 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:06:44,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:06:44,854 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:06:44,858 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:06:44,859 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:06:44,860 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:06:44,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:06:44,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:06:44,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:06:44,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:06:44,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:06:44,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:06:44,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:06:44,876 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:06:44,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:06:44,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:06:44,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:06:44,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:06:44,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:06:44,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:06:44,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:06:44,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:06:44,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:06:44,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:06:44,884 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:06:44,884 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:06:44,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:06:44,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:06:44,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:06:44,907 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:06:44,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:06:44,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:06:44,909 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:06:44,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:06:44,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:06:44,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:06:44,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:06:44,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:06:44,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:06:44,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:06:44,910 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:06:44,910 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:06:44,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:06:44,911 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:06:44,911 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:06:44,911 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:06:44,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:06:44,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:06:44,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:06:44,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:06:44,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:06:44,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:06:44,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:06:44,913 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:06:44,913 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:06:44,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:06:44,915 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:06:44,915 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:06:44,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:06:44,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:06:44,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:06:44,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:06:44,979 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:06:44,980 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:06:44,981 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list_true-termination.c_true-unreach-call.i [2018-11-23 11:06:45,038 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac1bd41/6ff594e956ce483db998cb8f79f26fd0/FLAGbd7a2d8d5 [2018-11-23 11:06:45,589 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:06:45,590 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list_true-termination.c_true-unreach-call.i [2018-11-23 11:06:45,602 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac1bd41/6ff594e956ce483db998cb8f79f26fd0/FLAGbd7a2d8d5 [2018-11-23 11:06:45,838 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ac1bd41/6ff594e956ce483db998cb8f79f26fd0 [2018-11-23 11:06:45,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:06:45,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:06:45,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:45,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:06:45,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:06:45,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bc8b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:45, skipping insertion in model container [2018-11-23 11:06:45,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:06:45" (1/1) ... [2018-11-23 11:06:45,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:06:45,932 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:06:46,381 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:46,399 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:06:46,455 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:06:46,542 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:06:46,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46 WrapperNode [2018-11-23 11:06:46,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:06:46,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:46,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:06:46,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:06:46,625 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:06:46" (1/1) ... [2018-11-23 11:06:46,646 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:06:46" (1/1) ... [2018-11-23 11:06:46,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:06:46,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:06:46,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:06:46,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:06:46,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (1/1) ... [2018-11-23 11:06:46,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:06:46,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:06:46,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:06:46,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:06:46,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (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:06:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:06:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:06:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:06:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:06:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:06:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:06:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-11-23 11:06:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-11-23 11:06:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:06:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:06:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-23 11:06:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-23 11:06:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:06:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-11-23 11:06:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-11-23 11:06:46,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:06:46,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:06:47,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:06:47,441 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:06:47,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:47 BoogieIcfgContainer [2018-11-23 11:06:47,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:06:47,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:06:47,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:06:47,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:06:47,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:06:45" (1/3) ... [2018-11-23 11:06:47,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0a3212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:47, skipping insertion in model container [2018-11-23 11:06:47,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:06:46" (2/3) ... [2018-11-23 11:06:47,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0a3212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:06:47, skipping insertion in model container [2018-11-23 11:06:47,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:47" (3/3) ... [2018-11-23 11:06:47,451 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list_true-termination.c_true-unreach-call.i [2018-11-23 11:06:47,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:06:47,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:06:47,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:06:47,523 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:06:47,524 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:06:47,524 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:06:47,524 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:06:47,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:06:47,525 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:06:47,525 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:06:47,525 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:06:47,525 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:06:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 11:06:47,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:06:47,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:47,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:47,552 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:47,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash -258912463, now seen corresponding path program 1 times [2018-11-23 11:06:47,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:47,563 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:06:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:47,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:48,002 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:48,021 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 10 treesize of output 9 [2018-11-23 11:06:48,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-23 11:06:48,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:06:48,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:06:48,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:48,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:48,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:48,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, list_add_~new.base]. (let ((.cse0 (select (select |#memory_int| list_add_~new.base) (_ bv8 32)))) (and (= .cse0 (_ bv0 32)) (= .cse0 |list_add_#t~mem28|))) [2018-11-23 11:06:48,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |list_add_#t~mem28|) [2018-11-23 11:06:48,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 11:06:48,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(12bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#head~0.base, ~bvadd32(8bv32, ~#head~0.offset), 4bv32); {34#true} is VALID [2018-11-23 11:06:48,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 11:06:48,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #45#return; {34#true} is VALID [2018-11-23 11:06:48,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret31 := main(); {34#true} is VALID [2018-11-23 11:06:48,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(12bv32);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {54#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:48,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {54#(= main_~dev~0.offset (_ bv0 32))} assume ~dev~0.base != 0bv32 || ~dev~0.offset != 0bv32;call write~intINTTYPE4(0bv32, ~dev~0.base, ~bvadd32(8bv32, ~dev~0.offset), 4bv32); {58#(and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:48,374 INFO L256 TraceCheckUtils]: 7: Hoare triple {58#(and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {62#(and (= (_ bv0 32) |list_add_#in~new.offset|) (= (_ bv0 32) (select (select |#memory_int| |list_add_#in~new.base|) (_ bv8 32))))} is VALID [2018-11-23 11:06:48,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {62#(and (= (_ bv0 32) |list_add_#in~new.offset|) (= (_ bv0 32) (select (select |#memory_int| |list_add_#in~new.base|) (_ bv8 32))))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~intINTTYPE4(~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {66#(= (_ bv0 32) |list_add_#t~mem28|)} is VALID [2018-11-23 11:06:48,401 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#(= (_ bv0 32) |list_add_#t~mem28|)} assume !(0bv32 == #t~mem28); {35#false} is VALID [2018-11-23 11:06:48,401 INFO L256 TraceCheckUtils]: 10: Hoare triple {35#false} call __blast_assert(); {35#false} is VALID [2018-11-23 11:06:48,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 11:06:48,407 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:06:48,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:48,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:48,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:06:48,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:06:48,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:48,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:06:48,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:48,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:06:48,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:06:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:06:48,495 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 6 states. [2018-11-23 11:06:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:49,894 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:06:49,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:06:49,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 11:06:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:06:49,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:06:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:06:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-23 11:06:49,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-23 11:06:50,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:50,062 INFO L225 Difference]: With dead ends: 55 [2018-11-23 11:06:50,062 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:06:50,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:06:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:06:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:06:50,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:50,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:06:50,136 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:06:50,136 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:06:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:50,141 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:06:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:06:50,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:50,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:50,142 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:06:50,142 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:06:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:50,146 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 11:06:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:06:50,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:50,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:50,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:50,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:06:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 11:06:50,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2018-11-23 11:06:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:50,152 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 11:06:50,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:06:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 11:06:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:06:50,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:50,154 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:06:50,154 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1212053608, now seen corresponding path program 1 times [2018-11-23 11:06:50,156 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:50,156 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:06:50,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:50,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:50,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:50,444 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 10 treesize of output 9 [2018-11-23 11:06:50,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 11:06:50,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:06:50,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:06:50,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:50,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:50,684 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:50,684 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |list_del_#in~entry.base|]. (let ((.cse0 (select (select |#memory_int| |list_del_#in~entry.base|) (_ bv8 32)))) (and (= |list_del_#t~mem29| .cse0) (= (_ bv1 32) .cse0))) [2018-11-23 11:06:50,684 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |list_del_#t~mem29| (_ bv1 32)) [2018-11-23 11:06:50,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2018-11-23 11:06:50,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {243#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(12bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#head~0.base, ~bvadd32(8bv32, ~#head~0.offset), 4bv32); {243#true} is VALID [2018-11-23 11:06:50,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2018-11-23 11:06:50,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #45#return; {243#true} is VALID [2018-11-23 11:06:50,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret31 := main(); {243#true} is VALID [2018-11-23 11:06:50,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(12bv32);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {263#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:50,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {263#(= main_~dev~0.offset (_ bv0 32))} assume ~dev~0.base != 0bv32 || ~dev~0.offset != 0bv32;call write~intINTTYPE4(0bv32, ~dev~0.base, ~bvadd32(8bv32, ~dev~0.offset), 4bv32); {263#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:50,706 INFO L256 TraceCheckUtils]: 7: Hoare triple {263#(= main_~dev~0.offset (_ bv0 32))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {243#true} is VALID [2018-11-23 11:06:50,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {243#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~intINTTYPE4(~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {273#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:06:50,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {273#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} assume 0bv32 == #t~mem28; {273#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} is VALID [2018-11-23 11:06:50,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {273#(and (= list_add_~new.offset |list_add_#in~new.offset|) (= |list_add_#in~new.base| list_add_~new.base))} havoc #t~mem28;call write~intINTTYPE4(1bv32, ~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {280#(= (_ bv1 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32))))} is VALID [2018-11-23 11:06:50,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#(= (_ bv1 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32))))} assume true; {280#(= (_ bv1 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32))))} is VALID [2018-11-23 11:06:50,738 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {280#(= (_ bv1 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32))))} {263#(= main_~dev~0.offset (_ bv0 32))} #49#return; {287#(and (= (_ bv1 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:50,740 INFO L256 TraceCheckUtils]: 13: Hoare triple {287#(and (= (_ bv1 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} call list_del(~dev~0.base, ~dev~0.offset); {291#(and (= (bvadd (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |list_del_#in~entry.offset| (_ bv0 32)))} is VALID [2018-11-23 11:06:50,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {291#(and (= (bvadd (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |list_del_#in~entry.offset| (_ bv0 32)))} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~intINTTYPE4(~entry.base, ~bvadd32(8bv32, ~entry.offset), 4bv32); {295#(= (bvadd |list_del_#t~mem29| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:50,742 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#(= (bvadd |list_del_#t~mem29| (_ bv4294967295 32)) (_ bv0 32))} assume !(1bv32 == #t~mem29); {244#false} is VALID [2018-11-23 11:06:50,743 INFO L256 TraceCheckUtils]: 16: Hoare triple {244#false} call __blast_assert(); {244#false} is VALID [2018-11-23 11:06:50,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {244#false} assume !false; {244#false} is VALID [2018-11-23 11:06:50,747 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:06:50,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:50,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:50,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:06:50,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:06:50,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:50,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:06:50,808 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:06:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:06:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:06:50,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:06:50,809 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 8 states. [2018-11-23 11:06:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:51,538 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-11-23 11:06:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:06:51,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:06:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 11:06:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:51,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 11:06:51,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 26 transitions. [2018-11-23 11:06:51,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:51,615 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:06:51,615 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:06:51,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:06:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:06:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 11:06:51,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:51,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 11:06:51,642 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:06:51,642 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:06:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:51,645 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-23 11:06:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2018-11-23 11:06:51,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:51,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:51,646 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 11:06:51,646 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 11:06:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:51,649 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-23 11:06:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2018-11-23 11:06:51,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:51,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:51,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:51,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:06:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2018-11-23 11:06:51,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 18 [2018-11-23 11:06:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:51,653 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2018-11-23 11:06:51,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:06:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2018-11-23 11:06:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:06:51,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:51,654 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:51,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:51,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:51,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1274253061, now seen corresponding path program 1 times [2018-11-23 11:06:51,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:51,656 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:06:51,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:51,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:51,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:51,881 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 10 treesize of output 9 [2018-11-23 11:06:51,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:51,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:51,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:51,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 11:06:52,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:06:52,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-23 11:06:52,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:52,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:52,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:52,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:52,023 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:52,023 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, list_add_~new.base]. (let ((.cse0 (select (select |#memory_int| list_add_~new.base) (_ bv8 32)))) (and (= .cse0 (_ bv0 32)) (= .cse0 |list_add_#t~mem28|))) [2018-11-23 11:06:52,023 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) |list_add_#t~mem28|) [2018-11-23 11:06:52,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2018-11-23 11:06:52,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#head~0.base, ~#head~0.offset := #Ultimate.alloc(12bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~#head~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#head~0.base, ~bvadd32(4bv32, ~#head~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#head~0.base, ~bvadd32(8bv32, ~#head~0.offset), 4bv32); {437#true} is VALID [2018-11-23 11:06:52,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:06:52,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {437#true} {437#true} #45#return; {437#true} is VALID [2018-11-23 11:06:52,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {437#true} call #t~ret31 := main(); {437#true} is VALID [2018-11-23 11:06:52,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {437#true} havoc ~dev~0.base, ~dev~0.offset;call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(12bv32);~dev~0.base, ~dev~0.offset := #t~malloc30.base, #t~malloc30.offset; {457#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:52,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#(= main_~dev~0.offset (_ bv0 32))} assume ~dev~0.base != 0bv32 || ~dev~0.offset != 0bv32;call write~intINTTYPE4(0bv32, ~dev~0.base, ~bvadd32(8bv32, ~dev~0.offset), 4bv32); {457#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:52,043 INFO L256 TraceCheckUtils]: 7: Hoare triple {457#(= main_~dev~0.offset (_ bv0 32))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {437#true} is VALID [2018-11-23 11:06:52,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {437#true} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~intINTTYPE4(~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {437#true} is VALID [2018-11-23 11:06:52,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {437#true} assume 0bv32 == #t~mem28; {437#true} is VALID [2018-11-23 11:06:52,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {437#true} havoc #t~mem28;call write~intINTTYPE4(1bv32, ~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {437#true} is VALID [2018-11-23 11:06:52,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {437#true} assume true; {437#true} is VALID [2018-11-23 11:06:52,051 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {437#true} {457#(= main_~dev~0.offset (_ bv0 32))} #49#return; {457#(= main_~dev~0.offset (_ bv0 32))} is VALID [2018-11-23 11:06:52,051 INFO L256 TraceCheckUtils]: 13: Hoare triple {457#(= main_~dev~0.offset (_ bv0 32))} call list_del(~dev~0.base, ~dev~0.offset); {437#true} is VALID [2018-11-23 11:06:52,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {437#true} ~entry.base, ~entry.offset := #in~entry.base, #in~entry.offset;call #t~mem29 := read~intINTTYPE4(~entry.base, ~bvadd32(8bv32, ~entry.offset), 4bv32); {485#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|))} is VALID [2018-11-23 11:06:52,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {485#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|))} assume 1bv32 == #t~mem29; {485#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|))} is VALID [2018-11-23 11:06:52,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {485#(and (= list_del_~entry.offset |list_del_#in~entry.offset|) (= list_del_~entry.base |list_del_#in~entry.base|))} havoc #t~mem29;call write~intINTTYPE4(0bv32, ~entry.base, ~bvadd32(8bv32, ~entry.offset), 4bv32); {492#(= (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-23 11:06:52,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {492#(= (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv0 32))} assume true; {492#(= (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv0 32))} is VALID [2018-11-23 11:06:52,070 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {492#(= (select (select |#memory_int| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv0 32))} {457#(= main_~dev~0.offset (_ bv0 32))} #51#return; {499#(and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:06:52,074 INFO L256 TraceCheckUtils]: 19: Hoare triple {499#(and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32)))} call list_add(~dev~0.base, ~dev~0.offset, ~#head~0.base, ~#head~0.offset); {503#(and (= (_ bv0 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32)))) (= (_ bv0 32) |list_add_#in~new.offset|))} is VALID [2018-11-23 11:06:52,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {503#(and (= (_ bv0 32) (select (select |#memory_int| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32)))) (= (_ bv0 32) |list_add_#in~new.offset|))} ~new.base, ~new.offset := #in~new.base, #in~new.offset;~head.base, ~head.offset := #in~head.base, #in~head.offset;call #t~mem28 := read~intINTTYPE4(~new.base, ~bvadd32(8bv32, ~new.offset), 4bv32); {507#(= (_ bv0 32) |list_add_#t~mem28|)} is VALID [2018-11-23 11:06:52,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {507#(= (_ bv0 32) |list_add_#t~mem28|)} assume !(0bv32 == #t~mem28); {438#false} is VALID [2018-11-23 11:06:52,080 INFO L256 TraceCheckUtils]: 22: Hoare triple {438#false} call __blast_assert(); {438#false} is VALID [2018-11-23 11:06:52,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {438#false} assume !false; {438#false} is VALID [2018-11-23 11:06:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:52,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:06:52,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:06:52,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:06:52,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:06:52,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:52,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:06:52,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:52,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:06:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:06:52,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:06:52,191 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 8 states. [2018-11-23 11:06:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:52,947 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-23 11:06:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:06:52,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-23 11:06:52,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:06:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:06:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-23 11:06:52,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2018-11-23 11:06:53,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:53,012 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:06:53,012 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:06:53,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:06:53,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:06:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:06:53,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:53,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:06:53,014 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:06:53,015 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:06:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:53,015 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:06:53,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:06:53,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:53,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:53,016 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:06:53,016 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:06:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:53,016 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:06:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:06:53,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:53,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:53,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:53,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:06:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:06:53,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-23 11:06:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:53,018 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:06:53,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:06:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:06:53,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:53,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:06:53,254 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2018-11-23 11:06:53,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:06:53,436 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:06:53,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:06:53,436 INFO L448 ceAbstractionStarter]: For program point list_delFINAL(lines 871 874) no Hoare annotation was computed. [2018-11-23 11:06:53,436 INFO L448 ceAbstractionStarter]: For program point list_delEXIT(lines 871 874) no Hoare annotation was computed. [2018-11-23 11:06:53,436 INFO L448 ceAbstractionStarter]: For program point L872(line 872) no Hoare annotation was computed. [2018-11-23 11:06:53,437 INFO L444 ceAbstractionStarter]: At program point list_delENTRY(lines 871 874) the Hoare annotation is: (let ((.cse0 (bvadd |list_del_#in~entry.offset| (_ bv8 32)))) (or (= (bvadd (select (select |#memory_int| |list_del_#in~entry.base|) .cse0) (_ bv4294967295 32)) (_ bv0 32)) (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= (bvadd (select (select |old(#memory_int)| |list_del_#in~entry.base|) .cse0) (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 11:06:53,437 INFO L444 ceAbstractionStarter]: At program point L872-2(line 872) the Hoare annotation is: (or (not (= |list_del_#in~entry.offset| (_ bv0 32))) (not (= (bvadd (select (select |old(#memory_int)| |list_del_#in~entry.base|) (bvadd |list_del_#in~entry.offset| (_ bv8 32))) (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:06:53,437 INFO L448 ceAbstractionStarter]: For program point L872-3(line 872) no Hoare annotation was computed. [2018-11-23 11:06:53,437 INFO L444 ceAbstractionStarter]: At program point L867-2(line 867) the Hoare annotation is: (or (not (= (select (select |old(#memory_int)| |list_add_#in~new.base|) (bvadd |list_add_#in~new.offset| (_ bv8 32))) (_ bv0 32))) (not (= (_ bv0 32) |list_add_#in~new.offset|))) [2018-11-23 11:06:53,437 INFO L444 ceAbstractionStarter]: At program point list_addENTRY(lines 866 869) the Hoare annotation is: (let ((.cse0 (bvadd |list_add_#in~new.offset| (_ bv8 32)))) (or (= (_ bv0 32) (select (select |#memory_int| |list_add_#in~new.base|) .cse0)) (not (= (select (select |old(#memory_int)| |list_add_#in~new.base|) .cse0) (_ bv0 32))) (not (= (_ bv0 32) |list_add_#in~new.offset|)))) [2018-11-23 11:06:53,437 INFO L448 ceAbstractionStarter]: For program point L867-3(line 867) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point list_addFINAL(lines 866 869) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point list_addEXIT(lines 866 869) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point L867(line 867) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L451 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-23 11:06:53,438 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:06:53,438 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:06:53,439 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:06:53,439 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:06:53,439 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 886) no Hoare annotation was computed. [2018-11-23 11:06:53,439 INFO L448 ceAbstractionStarter]: For program point L881-1(lines 881 886) no Hoare annotation was computed. [2018-11-23 11:06:53,439 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 878 888) the Hoare annotation is: true [2018-11-23 11:06:53,439 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 878 888) no Hoare annotation was computed. [2018-11-23 11:06:53,439 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 878 888) no Hoare annotation was computed. [2018-11-23 11:06:53,439 INFO L444 ceAbstractionStarter]: At program point L884(line 884) the Hoare annotation is: (and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32))) [2018-11-23 11:06:53,439 INFO L444 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (and (= (_ bv0 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32))) [2018-11-23 11:06:53,440 INFO L444 ceAbstractionStarter]: At program point L883-1(line 883) the Hoare annotation is: (and (= (_ bv1 32) (select (select |#memory_int| main_~dev~0.base) (bvadd main_~dev~0.offset (_ bv8 32)))) (= main_~dev~0.offset (_ bv0 32))) [2018-11-23 11:06:53,441 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:06:53,441 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2018-11-23 11:06:53,441 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2018-11-23 11:06:53,441 WARN L170 areAnnotationChecker]: __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: L872 has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: L867 has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: __blast_assertFINAL has no Hoare annotation [2018-11-23 11:06:53,442 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L872-3 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L872-3 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L867-3 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: L867-3 has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: __blast_assertEXIT has no Hoare annotation [2018-11-23 11:06:53,443 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:06:53,445 WARN L170 areAnnotationChecker]: L881-1 has no Hoare annotation [2018-11-23 11:06:53,445 WARN L170 areAnnotationChecker]: list_delFINAL has no Hoare annotation [2018-11-23 11:06:53,445 WARN L170 areAnnotationChecker]: list_addFINAL has no Hoare annotation [2018-11-23 11:06:53,448 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:06:53,448 WARN L170 areAnnotationChecker]: list_delEXIT has no Hoare annotation [2018-11-23 11:06:53,448 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 11:06:53,448 WARN L170 areAnnotationChecker]: list_addEXIT has no Hoare annotation [2018-11-23 11:06:53,448 WARN L170 areAnnotationChecker]: L881-1 has no Hoare annotation [2018-11-23 11:06:53,450 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:06:53,450 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:06:53,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:06:53 BoogieIcfgContainer [2018-11-23 11:06:53,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:06:53,453 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:06:53,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:06:53,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:06:53,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:06:47" (3/4) ... [2018-11-23 11:06:53,458 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:06:53,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:06:53,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-11-23 11:06:53,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-11-23 11:06:53,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-11-23 11:06:53,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:06:53,471 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 11:06:53,472 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 11:06:53,472 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:06:53,525 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/rule60_list_true-termination.c_true-unreach-call.i-witness.graphml [2018-11-23 11:06:53,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:06:53,527 INFO L168 Benchmark]: Toolchain (without parser) took 7677.12 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -393.5 MB). Peak memory consumption was 337.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,528 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-23 11:06:53,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.69 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,529 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,530 INFO L168 Benchmark]: Boogie Preprocessor took 52.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:53,530 INFO L168 Benchmark]: RCFGBuilder took 734.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,531 INFO L168 Benchmark]: TraceAbstraction took 6009.69 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: 350.8 MB). Peak memory consumption was 350.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,539 INFO L168 Benchmark]: Witness Printer took 72.34 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:53,544 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 691.69 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.28 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 734.00 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6009.69 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: 350.8 MB). Peak memory consumption was 350.8 MB. Max. memory is 7.1 GB. * Witness Printer took 72.34 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 31 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 57 SDtfs, 18 SDslu, 199 SDs, 0 SdLazy, 112 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 21 PreInvPairs, 23 NumberOfFragments, 128 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 3659 SizeOfPredicates, 29 NumberOfNonLiveVariables, 268 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...