java -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.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:29:08,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:29:08,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:29:08,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:29:08,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:29:08,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:29:08,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:29:08,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:29:08,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:29:08,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:29:08,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:29:08,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:29:08,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:29:08,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:29:08,715 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:29:08,716 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:29:08,716 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:29:08,718 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:29:08,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:29:08,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:29:08,728 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:29:08,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:29:08,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:29:08,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:29:08,739 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:29:08,740 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:29:08,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:29:08,742 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:29:08,745 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:29:08,747 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:29:08,747 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:29:08,747 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:29:08,750 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:29:08,750 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:29:08,751 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:29:08,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:29:08,752 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:29:08,780 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:29:08,782 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:29:08,783 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:29:08,783 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:29:08,784 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:29:08,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:29:08,787 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:29:08,787 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:29:08,787 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:29:08,787 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:29:08,788 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:29:08,788 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:29:08,788 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:29:08,788 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:29:08,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:29:08,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:29:08,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:29:08,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:29:08,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:29:08,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:29:08,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:29:08,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:29:08,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:29:08,794 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:29:08,794 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:29:08,794 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:29:08,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:29:08,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:29:08,795 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:29:08,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:29:08,795 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:29:08,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:29:08,796 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:29:08,796 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:29:08,796 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:29:08,796 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:29:08,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:29:08,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:29:08,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:29:08,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:29:08,881 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:29:08,882 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-07 10:29:08,948 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12480d15/d28582a01bb8424dab9c337fc87a129f/FLAG3e95bed45 [2018-11-07 10:29:09,488 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:29:09,489 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-07 10:29:09,497 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12480d15/d28582a01bb8424dab9c337fc87a129f/FLAG3e95bed45 [2018-11-07 10:29:09,512 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12480d15/d28582a01bb8424dab9c337fc87a129f [2018-11-07 10:29:09,523 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:29:09,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:29:09,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:09,526 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:29:09,530 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:29:09,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e926fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09, skipping insertion in model container [2018-11-07 10:29:09,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:29:09,576 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:29:09,800 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:09,811 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:29:09,848 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:29:09,876 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:29:09,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09 WrapperNode [2018-11-07 10:29:09,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:29:09,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:09,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:29:09,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:29:09,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:29:09,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:29:09,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:29:09,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:29:09,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:09,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:10,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:10,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (1/1) ... [2018-11-07 10:29:10,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:29:10,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:29:10,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:29:10,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:29:10,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (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-07 10:29:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2018-11-07 10:29:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:29:10,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:29:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2018-11-07 10:29:10,103 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2018-11-07 10:29:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 10:29:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 10:29:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 10:29:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:29:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:29:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:29:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:29:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:29:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:29:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 10:29:10,779 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:29:10,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:10 BoogieIcfgContainer [2018-11-07 10:29:10,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:29:10,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:29:10,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:29:10,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:29:10,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:29:09" (1/3) ... [2018-11-07 10:29:10,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed422fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:10, skipping insertion in model container [2018-11-07 10:29:10,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:29:09" (2/3) ... [2018-11-07 10:29:10,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed422fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:29:10, skipping insertion in model container [2018-11-07 10:29:10,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:29:10" (3/3) ... [2018-11-07 10:29:10,794 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER__cases1_stripFullBoth_arr_true-unreach-call_true-termination.i [2018-11-07 10:29:10,803 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:29:10,815 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:29:10,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:29:10,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:29:10,877 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:29:10,877 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:29:10,877 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:29:10,877 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:29:10,880 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:29:10,880 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:29:10,880 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:29:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-07 10:29:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 10:29:10,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:10,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:10,916 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:10,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash -407221804, now seen corresponding path program 1 times [2018-11-07 10:29:10,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:10,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:10,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:10,980 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:11,068 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-07 10:29:11,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:29:11,071 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:11,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:29:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:29:11,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:11,098 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2018-11-07 10:29:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:11,128 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2018-11-07 10:29:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:29:11,129 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-07 10:29:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:11,138 INFO L225 Difference]: With dead ends: 148 [2018-11-07 10:29:11,139 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 10:29:11,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:29:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 10:29:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-07 10:29:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 10:29:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-11-07 10:29:11,187 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 33 [2018-11-07 10:29:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:11,188 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-11-07 10:29:11,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:29:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-11-07 10:29:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 10:29:11,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:11,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:11,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:11,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -197078502, now seen corresponding path program 1 times [2018-11-07 10:29:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:11,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:11,287 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-07 10:29:11,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:11,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:29:11,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:29:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:29:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,290 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-11-07 10:29:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:11,382 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2018-11-07 10:29:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:29:11,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-07 10:29:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:11,384 INFO L225 Difference]: With dead ends: 117 [2018-11-07 10:29:11,385 INFO L226 Difference]: Without dead ends: 67 [2018-11-07 10:29:11,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-07 10:29:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-07 10:29:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-07 10:29:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-11-07 10:29:11,397 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 41 [2018-11-07 10:29:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:11,398 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-11-07 10:29:11,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:29:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-11-07 10:29:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-07 10:29:11,400 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:11,400 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:11,401 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:11,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash -529413171, now seen corresponding path program 1 times [2018-11-07 10:29:11,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:11,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,403 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:29:11,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:11,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:29:11,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:11,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:29:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:29:11,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,513 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 3 states. [2018-11-07 10:29:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:11,571 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-11-07 10:29:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:29:11,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-07 10:29:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:11,573 INFO L225 Difference]: With dead ends: 110 [2018-11-07 10:29:11,573 INFO L226 Difference]: Without dead ends: 65 [2018-11-07 10:29:11,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-07 10:29:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-07 10:29:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 10:29:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-07 10:29:11,583 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 46 [2018-11-07 10:29:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:11,583 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-07 10:29:11,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:29:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-07 10:29:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 10:29:11,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:11,586 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:11,586 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:11,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1659069238, now seen corresponding path program 1 times [2018-11-07 10:29:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:11,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:29:11,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:11,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:29:11,661 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:11,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:29:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:29:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,662 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 3 states. [2018-11-07 10:29:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:11,749 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-11-07 10:29:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:29:11,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-07 10:29:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:11,751 INFO L225 Difference]: With dead ends: 112 [2018-11-07 10:29:11,752 INFO L226 Difference]: Without dead ends: 66 [2018-11-07 10:29:11,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:29:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-07 10:29:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-07 10:29:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-07 10:29:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-11-07 10:29:11,761 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 48 [2018-11-07 10:29:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:11,761 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-11-07 10:29:11,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:29:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-11-07 10:29:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-07 10:29:11,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:29:11,763 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:29:11,764 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:29:11,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:29:11,764 INFO L82 PathProgramCache]: Analyzing trace with hash -979010868, now seen corresponding path program 1 times [2018-11-07 10:29:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:29:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:29:11,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:29:11,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:29:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:29:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:29:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:29:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:29:11,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:29:11,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:29:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:29:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:29:11,989 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 5 states. [2018-11-07 10:29:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:29:12,136 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2018-11-07 10:29:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:29:12,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-07 10:29:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:29:12,138 INFO L225 Difference]: With dead ends: 84 [2018-11-07 10:29:12,138 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:29:12,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:29:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:29:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:29:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:29:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:29:12,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-07 10:29:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:29:12,140 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:29:12,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:29:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:29:12,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:29:12,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-1(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-3(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-4(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-5(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,289 INFO L425 ceAbstractionStarter]: For program point L60-7(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,290 INFO L425 ceAbstractionStarter]: For program point L60-8(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,290 INFO L425 ceAbstractionStarter]: For program point L60-9(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,290 INFO L425 ceAbstractionStarter]: For program point L60-11(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,290 INFO L428 ceAbstractionStarter]: At program point L60-13(line 60) the Hoare annotation is: true [2018-11-07 10:29:12,290 INFO L425 ceAbstractionStarter]: For program point L60-14(line 60) no Hoare annotation was computed. [2018-11-07 10:29:12,291 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 10:29:12,291 INFO L425 ceAbstractionStarter]: For program point L61-1(line 61) no Hoare annotation was computed. [2018-11-07 10:29:12,291 INFO L425 ceAbstractionStarter]: For program point L61-2(line 61) no Hoare annotation was computed. [2018-11-07 10:29:12,291 INFO L425 ceAbstractionStarter]: For program point L61-4(line 61) no Hoare annotation was computed. [2018-11-07 10:29:12,291 INFO L425 ceAbstractionStarter]: For program point L61-6(lines 55 73) no Hoare annotation was computed. [2018-11-07 10:29:12,292 INFO L425 ceAbstractionStarter]: For program point L53-1(lines 53 74) no Hoare annotation was computed. [2018-11-07 10:29:12,294 INFO L428 ceAbstractionStarter]: At program point L53-3(lines 53 74) the Hoare annotation is: true [2018-11-07 10:29:12,294 INFO L425 ceAbstractionStarter]: For program point L53-4(lines 53 74) no Hoare annotation was computed. [2018-11-07 10:29:12,294 INFO L425 ceAbstractionStarter]: For program point L63(lines 63 65) no Hoare annotation was computed. [2018-11-07 10:29:12,294 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 10:29:12,294 INFO L425 ceAbstractionStarter]: For program point L55-1(line 55) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L55-2(lines 55 73) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L57-3(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,295 INFO L425 ceAbstractionStarter]: For program point L57-5(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L57-6(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L57-7(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L428 ceAbstractionStarter]: At program point L57-9(line 57) the Hoare annotation is: true [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L57-10(line 57) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L74(lines 53 74) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-07 10:29:12,296 INFO L425 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2018-11-07 10:29:12,300 INFO L425 ceAbstractionStarter]: For program point parse_expression_listFINAL(lines 48 76) no Hoare annotation was computed. [2018-11-07 10:29:12,301 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 10:29:12,301 INFO L428 ceAbstractionStarter]: At program point parse_expression_listENTRY(lines 48 76) the Hoare annotation is: true [2018-11-07 10:29:12,301 INFO L425 ceAbstractionStarter]: For program point L58-2(line 58) no Hoare annotation was computed. [2018-11-07 10:29:12,301 INFO L421 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2018-11-07 10:29:12,301 INFO L425 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-11-07 10:29:12,301 INFO L425 ceAbstractionStarter]: For program point parse_expression_listEXIT(lines 48 76) no Hoare annotation was computed. [2018-11-07 10:29:12,308 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,308 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 49 76) no Hoare annotation was computed. [2018-11-07 10:29:12,308 INFO L425 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,308 INFO L425 ceAbstractionStarter]: For program point L51-3(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,308 INFO L425 ceAbstractionStarter]: For program point L51-4(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L51-5(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L51-6(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L51-7(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L51-8(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L51-9(line 51) no Hoare annotation was computed. [2018-11-07 10:29:12,309 INFO L425 ceAbstractionStarter]: For program point L68(lines 62 71) no Hoare annotation was computed. [2018-11-07 10:29:12,310 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:29:12,310 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:29:12,310 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:29:12,310 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:29:12,310 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:29:12,310 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:29:12,310 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:29:12,311 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 77 88) the Hoare annotation is: true [2018-11-07 10:29:12,311 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 77 88) no Hoare annotation was computed. [2018-11-07 10:29:12,311 INFO L425 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-11-07 10:29:12,311 INFO L428 ceAbstractionStarter]: At program point L85(line 85) the Hoare annotation is: true [2018-11-07 10:29:12,311 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 10:29:12,311 INFO L425 ceAbstractionStarter]: For program point L82-1(line 82) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 81 83) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point L81-3(lines 81 83) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point L79-1(line 79) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L428 ceAbstractionStarter]: At program point L81-4(lines 81 83) the Hoare annotation is: true [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-07 10:29:12,312 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 77 88) no Hoare annotation was computed. [2018-11-07 10:29:12,317 INFO L425 ceAbstractionStarter]: For program point L81-5(lines 81 83) no Hoare annotation was computed. [2018-11-07 10:29:12,317 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-07 10:29:12,317 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-07 10:29:12,317 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-07 10:29:12,318 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-07 10:29:12,318 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-07 10:29:12,318 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-07 10:29:12,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:29:12 BoogieIcfgContainer [2018-11-07 10:29:12,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:29:12,329 INFO L168 Benchmark]: Toolchain (without parser) took 2805.10 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.8 MB). Peak memory consumption was 69.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:12,331 INFO L168 Benchmark]: CDTParser took 0.24 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-07 10:29:12,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.41 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-07 10:29:12,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.10 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-07 10:29:12,333 INFO L168 Benchmark]: Boogie Preprocessor took 129.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:12,334 INFO L168 Benchmark]: RCFGBuilder took 736.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:12,335 INFO L168 Benchmark]: TraceAbstraction took 1546.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 80.9 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:29:12,341 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 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. * CACSL2BoogieTranslator took 351.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.37 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 736.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1546.28 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 80.9 MB). Peak memory consumption was 80.9 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 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 80 locations, 1 error locations. SAFE Result, 1.4s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 365 SDtfs, 29 SDslu, 363 SDs, 0 SdLazy, 59 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 26 PreInvPairs, 34 NumberOfFragments, 16 HoareAnnotationTreeSize, 26 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 10026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...