java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 19:21:41,930 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 19:21:41,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 19:21:41,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 19:21:41,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 19:21:41,951 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 19:21:41,952 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 19:21:41,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 19:21:41,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 19:21:41,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 19:21:41,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 19:21:41,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 19:21:41,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 19:21:41,960 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 19:21:41,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 19:21:41,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 19:21:41,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 19:21:41,964 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 19:21:41,966 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 19:21:41,968 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 19:21:41,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 19:21:41,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 19:21:41,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 19:21:41,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 19:21:41,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 19:21:41,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 19:21:41,975 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 19:21:41,976 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 19:21:41,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 19:21:41,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 19:21:41,978 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 19:21:41,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 19:21:41,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 19:21:41,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 19:21:41,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 19:21:41,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 19:21:41,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 19:21:42,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 19:21:42,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 19:21:42,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 19:21:42,014 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 19:21:42,014 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 19:21:42,015 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 19:21:42,015 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 19:21:42,015 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 19:21:42,015 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 19:21:42,015 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 19:21:42,016 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 19:21:42,016 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 19:21:42,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 19:21:42,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 19:21:42,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 19:21:42,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 19:21:42,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 19:21:42,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 19:21:42,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 19:21:42,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 19:21:42,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 19:21:42,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 19:21:42,020 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 19:21:42,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 19:21:42,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 19:21:42,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 19:21:42,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 19:21:42,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 19:21:42,021 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 19:21:42,021 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 19:21:42,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 19:21:42,021 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 19:21:42,022 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 19:21:42,022 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 19:21:42,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 19:21:42,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 19:21:42,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 19:21:42,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 19:21:42,085 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 19:21:42,086 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-24 19:21:42,145 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/af2a2a9d3/9e716a4aee6e4fb386704f015aa5fad1/FLAG07c932637 [2018-10-24 19:21:42,794 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 19:21:42,795 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-24 19:21:42,816 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/af2a2a9d3/9e716a4aee6e4fb386704f015aa5fad1/FLAG07c932637 [2018-10-24 19:21:42,833 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/af2a2a9d3/9e716a4aee6e4fb386704f015aa5fad1 [2018-10-24 19:21:42,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 19:21:42,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 19:21:42,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 19:21:42,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 19:21:42,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 19:21:42,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:21:42" (1/1) ... [2018-10-24 19:21:42,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672e8569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:42, skipping insertion in model container [2018-10-24 19:21:42,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:21:42" (1/1) ... [2018-10-24 19:21:42,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 19:21:42,948 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 19:21:43,421 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:21:43,426 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 19:21:43,544 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 19:21:43,567 INFO L193 MainTranslator]: Completed translation [2018-10-24 19:21:43,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43 WrapperNode [2018-10-24 19:21:43,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 19:21:43,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 19:21:43,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 19:21:43,569 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 19:21:43,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 19:21:43,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 19:21:43,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 19:21:43,777 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 19:21:43,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... [2018-10-24 19:21:43,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 19:21:43,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 19:21:43,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 19:21:43,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 19:21:43,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 19:21:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 19:21:43,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 19:21:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-24 19:21:43,933 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-24 19:21:43,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 19:21:43,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 19:21:43,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 19:21:43,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 19:21:47,215 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 19:21:47,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:21:47 BoogieIcfgContainer [2018-10-24 19:21:47,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 19:21:47,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 19:21:47,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 19:21:47,221 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 19:21:47,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:21:42" (1/3) ... [2018-10-24 19:21:47,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f07c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:21:47, skipping insertion in model container [2018-10-24 19:21:47,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:21:43" (2/3) ... [2018-10-24 19:21:47,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f07c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:21:47, skipping insertion in model container [2018-10-24 19:21:47,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:21:47" (3/3) ... [2018-10-24 19:21:47,225 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-10-24 19:21:47,236 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 19:21:47,247 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 19:21:47,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 19:21:47,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 19:21:47,309 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 19:21:47,309 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 19:21:47,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 19:21:47,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 19:21:47,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 19:21:47,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 19:21:47,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 19:21:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-24 19:21:47,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-24 19:21:47,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:47,358 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, 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, 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-10-24 19:21:47,361 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash -782709097, now seen corresponding path program 1 times [2018-10-24 19:21:47,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:47,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:47,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:47,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:48,029 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:21:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:48,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:48,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 19:21:48,142 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:48,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 19:21:48,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 19:21:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:21:48,168 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-24 19:21:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:21:49,589 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-24 19:21:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 19:21:49,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-10-24 19:21:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:21:49,614 INFO L225 Difference]: With dead ends: 621 [2018-10-24 19:21:49,614 INFO L226 Difference]: Without dead ends: 382 [2018-10-24 19:21:49,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 19:21:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-24 19:21:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-24 19:21:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-24 19:21:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-24 19:21:49,702 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 133 [2018-10-24 19:21:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:21:49,703 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-24 19:21:49,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 19:21:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-24 19:21:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-24 19:21:49,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:49,711 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:21:49,711 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:49,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:49,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1001431126, now seen corresponding path program 1 times [2018-10-24 19:21:49,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:49,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:49,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:49,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:50,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:50,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:21:50,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:50,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:21:50,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:21:50,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:50,230 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-24 19:21:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:21:51,883 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-24 19:21:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:21:51,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-24 19:21:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:21:51,892 INFO L225 Difference]: With dead ends: 903 [2018-10-24 19:21:51,893 INFO L226 Difference]: Without dead ends: 381 [2018-10-24 19:21:51,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-24 19:21:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-24 19:21:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-24 19:21:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-24 19:21:51,925 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 142 [2018-10-24 19:21:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:21:51,926 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-24 19:21:51,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:21:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-24 19:21:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-24 19:21:51,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:51,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 19:21:51,931 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:51,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1638990538, now seen corresponding path program 1 times [2018-10-24 19:21:51,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:51,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:52,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:52,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:21:52,381 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:52,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:21:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:21:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:52,382 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-24 19:21:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:21:53,898 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-24 19:21:53,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:21:53,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-10-24 19:21:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:21:53,902 INFO L225 Difference]: With dead ends: 901 [2018-10-24 19:21:53,903 INFO L226 Difference]: Without dead ends: 380 [2018-10-24 19:21:53,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-24 19:21:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-24 19:21:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-24 19:21:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-24 19:21:53,937 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 148 [2018-10-24 19:21:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:21:53,938 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-24 19:21:53,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:21:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-24 19:21:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-24 19:21:53,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:53,945 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-10-24 19:21:53,945 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:53,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2027073139, now seen corresponding path program 1 times [2018-10-24 19:21:53,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:53,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:53,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:53,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:54,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:54,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:21:54,126 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:54,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:21:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:21:54,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:21:54,127 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-24 19:21:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:21:56,988 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-24 19:21:56,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:21:56,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-24 19:21:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:21:56,994 INFO L225 Difference]: With dead ends: 1193 [2018-10-24 19:21:56,994 INFO L226 Difference]: Without dead ends: 819 [2018-10-24 19:21:56,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:21:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-24 19:21:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-24 19:21:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-24 19:21:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-24 19:21:57,031 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 156 [2018-10-24 19:21:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:21:57,032 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-24 19:21:57,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:21:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-24 19:21:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-24 19:21:57,036 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:57,036 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-10-24 19:21:57,037 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:57,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1763589615, now seen corresponding path program 1 times [2018-10-24 19:21:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:57,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:57,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:57,039 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:57,473 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-24 19:21:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:57,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:57,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:21:57,720 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:57,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:21:57,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:21:57,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:57,721 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-24 19:21:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:21:58,804 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-24 19:21:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:21:58,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-10-24 19:21:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:21:58,822 INFO L225 Difference]: With dead ends: 1753 [2018-10-24 19:21:58,822 INFO L226 Difference]: Without dead ends: 804 [2018-10-24 19:21:58,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-24 19:21:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-24 19:21:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-24 19:21:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-24 19:21:58,852 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 158 [2018-10-24 19:21:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:21:58,852 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-24 19:21:58,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:21:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-24 19:21:58,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-24 19:21:58,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:21:58,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-10-24 19:21:58,857 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:21:58,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:21:58,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1311761045, now seen corresponding path program 1 times [2018-10-24 19:21:58,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:21:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:21:58,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:21:58,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:21:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:21:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:21:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:21:59,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 19:21:59,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:21:59,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 19:21:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 19:21:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:21:59,130 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-24 19:22:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:22:00,862 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-24 19:22:00,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 19:22:00,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-24 19:22:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:22:00,868 INFO L225 Difference]: With dead ends: 1747 [2018-10-24 19:22:00,868 INFO L226 Difference]: Without dead ends: 801 [2018-10-24 19:22:00,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 19:22:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-24 19:22:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-24 19:22:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-24 19:22:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-24 19:22:00,897 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 160 [2018-10-24 19:22:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:22:00,898 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-24 19:22:00,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 19:22:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-24 19:22:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 19:22:00,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:22:00,903 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-10-24 19:22:00,903 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:22:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:22:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash -269929571, now seen corresponding path program 1 times [2018-10-24 19:22:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:22:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:22:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:22:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:22:00,906 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:22:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:22:01,108 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-24 19:22:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:22:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 19:22:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 19:22:01,146 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:22:01,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 19:22:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 19:22:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-24 19:22:01,147 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-24 19:22:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 19:22:02,315 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-24 19:22:02,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 19:22:02,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-24 19:22:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 19:22:02,328 INFO L225 Difference]: With dead ends: 2381 [2018-10-24 19:22:02,328 INFO L226 Difference]: Without dead ends: 1586 [2018-10-24 19:22:02,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-24 19:22:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-24 19:22:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-24 19:22:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-24 19:22:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-24 19:22:02,381 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 164 [2018-10-24 19:22:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 19:22:02,381 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-24 19:22:02,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 19:22:02,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-24 19:22:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-24 19:22:02,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 19:22:02,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-10-24 19:22:02,389 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 19:22:02,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:22:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1973584945, now seen corresponding path program 1 times [2018-10-24 19:22:02,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 19:22:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:22:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 19:22:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 19:22:02,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 19:22:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 19:22:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 19:22:02,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 19:22:02,634 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 19:22:02,635 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-24 19:22:02,637 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-24 19:22:02,714 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 19:22:02,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 19:22:36,392 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-24 19:22:36,394 INFO L272 AbstractInterpreter]: Visited 137 different actions 268 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-24 19:22:36,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 19:22:36,408 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-24 19:22:43,275 INFO L232 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 82.55% of their original sizes. [2018-10-24 19:22:43,275 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-24 19:23:45,049 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-24 19:23:45,050 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-24 19:23:45,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 19:23:45,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-10-24 19:23:45,051 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 19:23:45,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-24 19:23:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-24 19:23:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-24 19:23:45,052 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 22 states. Received shutdown request... [2018-10-24 19:25:44,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-24 19:25:44,190 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 19:25:44,197 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 19:25:44,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:25:44 BoogieIcfgContainer [2018-10-24 19:25:44,197 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 19:25:44,198 INFO L168 Benchmark]: Toolchain (without parser) took 241351.58 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.1 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-10-24 19:25:44,200 INFO L168 Benchmark]: CDTParser took 0.20 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-10-24 19:25:44,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.89 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-10-24 19:25:44,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 207.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-10-24 19:25:44,202 INFO L168 Benchmark]: Boogie Preprocessor took 66.68 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 19:25:44,202 INFO L168 Benchmark]: RCFGBuilder took 3372.49 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: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. [2018-10-24 19:25:44,203 INFO L168 Benchmark]: TraceAbstraction took 236979.97 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -120.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-10-24 19:25:44,208 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.20 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 718.89 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 207.82 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.68 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3372.49 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: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236979.97 ms. Allocated memory was 2.2 GB in the beginning and 4.2 GB in the end (delta: 2.0 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -120.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (1558states) and FLOYD_HOARE automaton (currently 24 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (651 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. TIMEOUT Result, 236.9s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 130.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 915 SDtfs, 4663 SDslu, 739 SDs, 0 SdLazy, 5676 SolverSat, 1133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.9s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 261 GetRequests, 190 SyntacticMatches, 16 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 67.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 33.7s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.995323074270443 AbsIntWeakeningRatio, 0.16666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 361.8131313131313 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1260 NumberOfCodeBlocks, 1260 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1252 ConstructedInterpolants, 0 QuantifiedInterpolants, 1303956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 201/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown