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/eca-rers2012/Problem14_label08_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 06:21:03,874 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 06:21:03,879 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 06:21:03,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 06:21:03,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 06:21:03,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 06:21:03,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 06:21:03,902 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 06:21:03,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 06:21:03,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 06:21:03,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 06:21:03,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 06:21:03,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 06:21:03,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 06:21:03,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 06:21:03,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 06:21:03,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 06:21:03,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 06:21:03,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 06:21:03,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 06:21:03,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 06:21:03,936 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 06:21:03,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 06:21:03,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 06:21:03,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 06:21:03,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 06:21:03,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 06:21:03,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 06:21:03,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 06:21:03,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 06:21:03,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 06:21:03,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 06:21:03,947 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 06:21:03,947 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 06:21:03,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 06:21:03,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 06:21:03,950 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 06:21:03,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 06:21:03,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 06:21:03,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 06:21:03,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 06:21:03,966 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 06:21:03,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 06:21:03,967 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 06:21:03,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 06:21:03,967 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 06:21:03,968 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 06:21:03,968 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 06:21:03,968 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 06:21:03,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 06:21:03,968 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 06:21:03,969 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 06:21:03,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 06:21:03,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 06:21:03,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 06:21:03,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 06:21:03,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 06:21:03,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 06:21:03,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 06:21:03,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 06:21:03,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 06:21:03,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 06:21:03,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 06:21:03,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 06:21:03,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 06:21:03,972 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 06:21:03,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 06:21:03,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 06:21:03,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 06:21:03,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 06:21:03,973 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 06:21:03,973 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 06:21:03,973 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 06:21:04,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 06:21:04,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 06:21:04,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 06:21:04,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 06:21:04,041 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 06:21:04,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label08_false-unreach-call_false-termination.c [2018-11-07 06:21:04,111 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e323375/2884008fbbb84ae49bc2f30d0458fafa/FLAG43a303752 [2018-11-07 06:21:04,729 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 06:21:04,732 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label08_false-unreach-call_false-termination.c [2018-11-07 06:21:04,750 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e323375/2884008fbbb84ae49bc2f30d0458fafa/FLAG43a303752 [2018-11-07 06:21:04,772 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35e323375/2884008fbbb84ae49bc2f30d0458fafa [2018-11-07 06:21:04,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 06:21:04,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 06:21:04,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 06:21:04,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 06:21:04,797 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 06:21:04,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:21:04" (1/1) ... [2018-11-07 06:21:04,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ef60d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:04, skipping insertion in model container [2018-11-07 06:21:04,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:21:04" (1/1) ... [2018-11-07 06:21:04,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 06:21:04,902 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 06:21:05,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 06:21:05,498 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 06:21:05,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 06:21:05,693 INFO L193 MainTranslator]: Completed translation [2018-11-07 06:21:05,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05 WrapperNode [2018-11-07 06:21:05,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 06:21:05,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 06:21:05,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 06:21:05,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 06:21:05,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 06:21:05,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 06:21:05,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 06:21:05,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 06:21:05,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:05,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:06,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (1/1) ... [2018-11-07 06:21:06,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 06:21:06,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 06:21:06,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 06:21:06,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 06:21:06,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (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 06:21:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 06:21:06,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 06:21:06,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 06:21:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 06:21:06,094 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 06:21:06,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 06:21:06,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 06:21:06,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 06:21:06,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 06:21:09,663 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 06:21:09,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:21:09 BoogieIcfgContainer [2018-11-07 06:21:09,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 06:21:09,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 06:21:09,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 06:21:09,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 06:21:09,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:21:04" (1/3) ... [2018-11-07 06:21:09,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b1a1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:21:09, skipping insertion in model container [2018-11-07 06:21:09,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:05" (2/3) ... [2018-11-07 06:21:09,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b1a1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:21:09, skipping insertion in model container [2018-11-07 06:21:09,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:21:09" (3/3) ... [2018-11-07 06:21:09,676 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label08_false-unreach-call_false-termination.c [2018-11-07 06:21:09,687 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 06:21:09,701 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 06:21:09,720 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 06:21:09,773 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 06:21:09,774 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 06:21:09,774 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 06:21:09,774 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 06:21:09,774 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 06:21:09,774 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 06:21:09,774 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 06:21:09,775 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 06:21:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 06:21:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 06:21:09,818 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:09,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 06:21:09,822 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:09,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:09,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1967865695, now seen corresponding path program 1 times [2018-11-07 06:21:09,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:09,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:09,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:09,887 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:10,287 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 06:21:10,380 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 06:21:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 06:21:10,383 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:10,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 06:21:10,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 06:21:10,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 06:21:10,404 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 06:21:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:12,080 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 06:21:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 06:21:12,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-07 06:21:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:12,101 INFO L225 Difference]: With dead ends: 691 [2018-11-07 06:21:12,102 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 06:21:12,110 INFO L604 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-11-07 06:21:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 06:21:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 06:21:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 06:21:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 06:21:12,197 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 19 [2018-11-07 06:21:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:12,198 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 06:21:12,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 06:21:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 06:21:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-07 06:21:12,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:12,203 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] [2018-11-07 06:21:12,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:12,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash 996215900, now seen corresponding path program 1 times [2018-11-07 06:21:12,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:12,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:12,206 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 06:21:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 06:21:12,519 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:12,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 06:21:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 06:21:12,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 06:21:12,522 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 06:21:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:16,766 INFO L93 Difference]: Finished difference Result 1588 states and 2935 transitions. [2018-11-07 06:21:16,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 06:21:16,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-07 06:21:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:16,783 INFO L225 Difference]: With dead ends: 1588 [2018-11-07 06:21:16,784 INFO L226 Difference]: Without dead ends: 1160 [2018-11-07 06:21:16,788 INFO L604 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-11-07 06:21:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-11-07 06:21:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1153. [2018-11-07 06:21:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-11-07 06:21:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1887 transitions. [2018-11-07 06:21:16,862 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1887 transitions. Word has length 89 [2018-11-07 06:21:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:16,863 INFO L480 AbstractCegarLoop]: Abstraction has 1153 states and 1887 transitions. [2018-11-07 06:21:16,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 06:21:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1887 transitions. [2018-11-07 06:21:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-07 06:21:16,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:16,867 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] [2018-11-07 06:21:16,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:16,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 443394711, now seen corresponding path program 1 times [2018-11-07 06:21:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:16,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:16,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:16,870 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 06:21:17,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:17,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 06:21:17,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:17,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 06:21:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 06:21:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 06:21:17,099 INFO L87 Difference]: Start difference. First operand 1153 states and 1887 transitions. Second operand 5 states. [2018-11-07 06:21:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:19,996 INFO L93 Difference]: Finished difference Result 2716 states and 4601 transitions. [2018-11-07 06:21:19,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 06:21:19,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2018-11-07 06:21:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:20,019 INFO L225 Difference]: With dead ends: 2716 [2018-11-07 06:21:20,020 INFO L226 Difference]: Without dead ends: 1569 [2018-11-07 06:21:20,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 06:21:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-07 06:21:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1538. [2018-11-07 06:21:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-07 06:21:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2356 transitions. [2018-11-07 06:21:20,091 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2356 transitions. Word has length 90 [2018-11-07 06:21:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:20,092 INFO L480 AbstractCegarLoop]: Abstraction has 1538 states and 2356 transitions. [2018-11-07 06:21:20,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 06:21:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2356 transitions. [2018-11-07 06:21:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-07 06:21:20,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:20,095 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] [2018-11-07 06:21:20,095 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:20,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash 48842683, now seen corresponding path program 1 times [2018-11-07 06:21:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:20,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:20,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 06:21:20,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:20,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 06:21:20,283 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:20,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 06:21:20,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 06:21:20,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 06:21:20,284 INFO L87 Difference]: Start difference. First operand 1538 states and 2356 transitions. Second operand 5 states. [2018-11-07 06:21:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:22,819 INFO L93 Difference]: Finished difference Result 4198 states and 6461 transitions. [2018-11-07 06:21:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 06:21:22,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-11-07 06:21:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:22,837 INFO L225 Difference]: With dead ends: 4198 [2018-11-07 06:21:22,838 INFO L226 Difference]: Without dead ends: 2666 [2018-11-07 06:21:22,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 06:21:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-07 06:21:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2560. [2018-11-07 06:21:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2018-11-07 06:21:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3629 transitions. [2018-11-07 06:21:22,934 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3629 transitions. Word has length 92 [2018-11-07 06:21:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:22,935 INFO L480 AbstractCegarLoop]: Abstraction has 2560 states and 3629 transitions. [2018-11-07 06:21:22,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 06:21:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3629 transitions. [2018-11-07 06:21:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-07 06:21:22,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:22,937 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] [2018-11-07 06:21:22,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:22,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash 199443236, now seen corresponding path program 1 times [2018-11-07 06:21:22,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:22,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:22,939 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 06:21:23,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:23,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 06:21:23,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 06:21:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 06:21:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 06:21:23,058 INFO L87 Difference]: Start difference. First operand 2560 states and 3629 transitions. Second operand 4 states. [2018-11-07 06:21:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:25,255 INFO L93 Difference]: Finished difference Result 7205 states and 10610 transitions. [2018-11-07 06:21:25,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 06:21:25,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-07 06:21:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:25,284 INFO L225 Difference]: With dead ends: 7205 [2018-11-07 06:21:25,285 INFO L226 Difference]: Without dead ends: 4651 [2018-11-07 06:21:25,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 06:21:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2018-11-07 06:21:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4651. [2018-11-07 06:21:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4651 states. [2018-11-07 06:21:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 6458 transitions. [2018-11-07 06:21:25,446 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 6458 transitions. Word has length 93 [2018-11-07 06:21:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:25,447 INFO L480 AbstractCegarLoop]: Abstraction has 4651 states and 6458 transitions. [2018-11-07 06:21:25,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 06:21:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 6458 transitions. [2018-11-07 06:21:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-07 06:21:25,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:25,509 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2018-11-07 06:21:25,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:25,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2080310447, now seen corresponding path program 1 times [2018-11-07 06:21:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:25,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:25,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:25,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-11-07 06:21:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 06:21:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 06:21:25,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:25,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 06:21:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 06:21:25,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 06:21:25,784 INFO L87 Difference]: Start difference. First operand 4651 states and 6458 transitions. Second operand 3 states. [2018-11-07 06:21:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:21:27,124 INFO L93 Difference]: Finished difference Result 10803 states and 15809 transitions. [2018-11-07 06:21:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 06:21:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2018-11-07 06:21:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:21:27,163 INFO L225 Difference]: With dead ends: 10803 [2018-11-07 06:21:27,163 INFO L226 Difference]: Without dead ends: 6532 [2018-11-07 06:21:27,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 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 06:21:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2018-11-07 06:21:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6532. [2018-11-07 06:21:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2018-11-07 06:21:27,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 9111 transitions. [2018-11-07 06:21:27,376 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 9111 transitions. Word has length 237 [2018-11-07 06:21:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:21:27,377 INFO L480 AbstractCegarLoop]: Abstraction has 6532 states and 9111 transitions. [2018-11-07 06:21:27,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 06:21:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 9111 transitions. [2018-11-07 06:21:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-07 06:21:27,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:21:27,397 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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] [2018-11-07 06:21:27,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:21:27,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1716679298, now seen corresponding path program 1 times [2018-11-07 06:21:27,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:21:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:27,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:21:27,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:21:27,399 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:21:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:21:28,010 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-07 06:21:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 06:21:28,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:21:28,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:21:28,866 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-07 06:21:28,868 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:21:28,932 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:21:28,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 06:21:33,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 06:21:33,866 INFO L272 AbstractInterpreter]: Visited 135 different actions 135 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 06:21:33,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:21:33,912 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 06:21:37,743 INFO L227 lantSequenceWeakener]: Weakened 253 states. On average, predicates are now at 77.32% of their original sizes. [2018-11-07 06:21:37,743 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 06:21:37,861 INFO L415 sIntCurrentIteration]: We unified 261 AI predicates to 261 [2018-11-07 06:21:37,862 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 06:21:37,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 06:21:37,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2018-11-07 06:21:37,863 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:21:37,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 06:21:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 06:21:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 06:21:37,864 INFO L87 Difference]: Start difference. First operand 6532 states and 9111 transitions. Second operand 6 states. [2018-11-07 06:22:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:22:03,240 INFO L93 Difference]: Finished difference Result 13243 states and 18447 transitions. [2018-11-07 06:22:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 06:22:03,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2018-11-07 06:22:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:22:03,273 INFO L225 Difference]: With dead ends: 13243 [2018-11-07 06:22:03,273 INFO L226 Difference]: Without dead ends: 6717 [2018-11-07 06:22:03,303 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 06:22:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2018-11-07 06:22:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2018-11-07 06:22:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2018-11-07 06:22:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9302 transitions. [2018-11-07 06:22:03,502 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9302 transitions. Word has length 262 [2018-11-07 06:22:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:22:03,502 INFO L480 AbstractCegarLoop]: Abstraction has 6715 states and 9302 transitions. [2018-11-07 06:22:03,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 06:22:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9302 transitions. [2018-11-07 06:22:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-11-07 06:22:03,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:22:03,532 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 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] [2018-11-07 06:22:03,533 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:22:03,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:22:03,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1519194548, now seen corresponding path program 1 times [2018-11-07 06:22:03,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:22:03,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:22:03,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:22:03,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:22:03,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:22:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:22:04,058 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 06:22:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 124 proven. 190 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 06:22:04,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:22:04,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:22:04,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 348 with the following transitions: [2018-11-07 06:22:04,719 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:22:04,726 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:22:04,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 06:22:09,316 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 06:22:09,316 INFO L272 AbstractInterpreter]: Visited 139 different actions 271 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 06:22:09,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:22:09,329 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 06:22:11,815 INFO L227 lantSequenceWeakener]: Weakened 344 states. On average, predicates are now at 77.38% of their original sizes. [2018-11-07 06:22:11,815 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 06:22:12,086 INFO L415 sIntCurrentIteration]: We unified 346 AI predicates to 346 [2018-11-07 06:22:12,086 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 06:22:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 06:22:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2018-11-07 06:22:12,087 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:22:12,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 06:22:12,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 06:22:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 06:22:12,088 INFO L87 Difference]: Start difference. First operand 6715 states and 9302 transitions. Second operand 10 states. [2018-11-07 06:23:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:23:30,890 INFO L93 Difference]: Finished difference Result 13423 states and 18580 transitions. [2018-11-07 06:23:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 06:23:30,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 347 [2018-11-07 06:23:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:23:30,936 INFO L225 Difference]: With dead ends: 13423 [2018-11-07 06:23:30,936 INFO L226 Difference]: Without dead ends: 6901 [2018-11-07 06:23:30,959 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 355 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-07 06:23:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2018-11-07 06:23:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6899. [2018-11-07 06:23:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6899 states. [2018-11-07 06:23:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6899 states to 6899 states and 9449 transitions. [2018-11-07 06:23:31,120 INFO L78 Accepts]: Start accepts. Automaton has 6899 states and 9449 transitions. Word has length 347 [2018-11-07 06:23:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:23:31,121 INFO L480 AbstractCegarLoop]: Abstraction has 6899 states and 9449 transitions. [2018-11-07 06:23:31,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 06:23:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6899 states and 9449 transitions. [2018-11-07 06:23:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-11-07 06:23:31,150 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:23:31,151 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 06:23:31,151 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:23:31,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:23:31,152 INFO L82 PathProgramCache]: Analyzing trace with hash 805504789, now seen corresponding path program 1 times [2018-11-07 06:23:31,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:23:31,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:23:31,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:23:31,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:23:31,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:23:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:23:32,307 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 06:23:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 246 proven. 250 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 06:23:32,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:23:32,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:23:32,888 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2018-11-07 06:23:32,888 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [510], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:23:32,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:23:32,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 06:23:37,414 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 06:23:37,414 INFO L272 AbstractInterpreter]: Visited 140 different actions 274 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 06:23:37,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:23:37,456 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 06:23:39,928 INFO L227 lantSequenceWeakener]: Weakened 444 states. On average, predicates are now at 77.39% of their original sizes. [2018-11-07 06:23:39,928 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 06:23:40,019 INFO L415 sIntCurrentIteration]: We unified 446 AI predicates to 446 [2018-11-07 06:23:40,020 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 06:23:40,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 06:23:40,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2018-11-07 06:23:40,021 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:23:40,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 06:23:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 06:23:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 06:23:40,023 INFO L87 Difference]: Start difference. First operand 6899 states and 9449 transitions. Second operand 10 states. [2018-11-07 06:23:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:23:49,411 INFO L93 Difference]: Finished difference Result 13239 states and 18306 transitions. [2018-11-07 06:23:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 06:23:49,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 447 [2018-11-07 06:23:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:23:49,438 INFO L225 Difference]: With dead ends: 13239 [2018-11-07 06:23:49,438 INFO L226 Difference]: Without dead ends: 6529 [2018-11-07 06:23:49,456 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 454 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-07 06:23:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2018-11-07 06:23:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6526. [2018-11-07 06:23:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2018-11-07 06:23:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 9023 transitions. [2018-11-07 06:23:49,596 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 9023 transitions. Word has length 447 [2018-11-07 06:23:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:23:49,597 INFO L480 AbstractCegarLoop]: Abstraction has 6526 states and 9023 transitions. [2018-11-07 06:23:49,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 06:23:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 9023 transitions. [2018-11-07 06:23:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-07 06:23:49,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:23:49,625 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-07 06:23:49,625 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:23:49,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:23:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash -355158003, now seen corresponding path program 1 times [2018-11-07 06:23:49,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:23:49,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:23:49,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:23:49,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:23:49,627 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:23:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:23:50,808 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 13 [2018-11-07 06:23:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 386 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 06:23:51,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:23:51,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:23:51,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 484 with the following transitions: [2018-11-07 06:23:51,333 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:23:51,343 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:23:51,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 06:24:01,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 06:24:01,143 INFO L272 AbstractInterpreter]: Visited 140 different actions 419 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 06:24:01,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:24:01,157 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 06:24:02,508 INFO L227 lantSequenceWeakener]: Weakened 480 states. On average, predicates are now at 80.04% of their original sizes. [2018-11-07 06:24:02,508 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 06:24:02,642 INFO L415 sIntCurrentIteration]: We unified 482 AI predicates to 482 [2018-11-07 06:24:02,642 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 06:24:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 06:24:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2018-11-07 06:24:02,642 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 06:24:02,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 06:24:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 06:24:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 06:24:02,644 INFO L87 Difference]: Start difference. First operand 6526 states and 9023 transitions. Second operand 9 states. [2018-11-07 06:24:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:24:21,757 INFO L93 Difference]: Finished difference Result 14670 states and 20740 transitions. [2018-11-07 06:24:21,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 06:24:21,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 483 [2018-11-07 06:24:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:24:21,790 INFO L225 Difference]: With dead ends: 14670 [2018-11-07 06:24:21,790 INFO L226 Difference]: Without dead ends: 8518 [2018-11-07 06:24:21,811 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 489 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-07 06:24:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8518 states. [2018-11-07 06:24:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8518 to 8111. [2018-11-07 06:24:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2018-11-07 06:24:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 10955 transitions. [2018-11-07 06:24:21,985 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 10955 transitions. Word has length 483 [2018-11-07 06:24:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:24:21,986 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 10955 transitions. [2018-11-07 06:24:21,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 06:24:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 10955 transitions. [2018-11-07 06:24:22,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-11-07 06:24:22,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:24:22,019 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-07 06:24:22,020 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:24:22,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:24:22,020 INFO L82 PathProgramCache]: Analyzing trace with hash 656789916, now seen corresponding path program 1 times [2018-11-07 06:24:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:24:22,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:24:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:24:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:24:22,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:24:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:24:22,735 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 06:24:23,482 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 06:24:23,919 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 06:24:24,376 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 06:24:25,008 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-07 06:24:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 282 proven. 339 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-07 06:24:25,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:24:25,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:24:25,855 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 551 with the following transitions: [2018-11-07 06:24:25,855 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:24:25,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:24:25,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 06:24:32,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 06:24:32,536 INFO L272 AbstractInterpreter]: Visited 191 different actions 763 times. Merged at 9 different actions 35 times. Widened at 1 different actions 1 times. Found 7 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 06:24:32,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:24:32,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 06:24:32,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:24:32,548 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 06:24:32,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:24:32,559 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 06:24:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:24:32,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 06:24:33,574 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-07 06:24:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 608 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 06:24:33,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 06:24:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 280 proven. 129 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-07 06:24:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 06:24:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2018-11-07 06:24:34,937 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 06:24:34,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 06:24:34,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 06:24:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-07 06:24:34,940 INFO L87 Difference]: Start difference. First operand 8111 states and 10955 transitions. Second operand 17 states. [2018-11-07 06:24:37,680 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-11-07 06:24:38,733 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-07 06:24:40,402 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-11-07 06:24:42,725 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-11-07 06:24:43,077 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-07 06:24:45,463 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-07 06:24:45,903 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-11-07 06:24:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 06:24:47,112 INFO L93 Difference]: Finished difference Result 19338 states and 27741 transitions. [2018-11-07 06:24:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-07 06:24:47,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 550 [2018-11-07 06:24:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 06:24:47,168 INFO L225 Difference]: With dead ends: 19338 [2018-11-07 06:24:47,169 INFO L226 Difference]: Without dead ends: 11601 [2018-11-07 06:24:47,236 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1198 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2018-11-07 06:24:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11601 states. [2018-11-07 06:24:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11601 to 11181. [2018-11-07 06:24:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11181 states. [2018-11-07 06:24:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11181 states to 11181 states and 15036 transitions. [2018-11-07 06:24:47,629 INFO L78 Accepts]: Start accepts. Automaton has 11181 states and 15036 transitions. Word has length 550 [2018-11-07 06:24:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 06:24:47,630 INFO L480 AbstractCegarLoop]: Abstraction has 11181 states and 15036 transitions. [2018-11-07 06:24:47,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 06:24:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 11181 states and 15036 transitions. [2018-11-07 06:24:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-11-07 06:24:47,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 06:24:47,668 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-11-07 06:24:47,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 06:24:47,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 06:24:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1233386891, now seen corresponding path program 1 times [2018-11-07 06:24:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 06:24:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:24:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:24:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 06:24:47,670 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 06:24:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:24:48,975 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 06:24:49,446 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 06:24:50,393 WARN L179 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-07 06:24:51,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 379 proven. 458 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 06:24:51,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:24:51,348 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 06:24:51,348 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 557 with the following transitions: [2018-11-07 06:24:51,348 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [53], [55], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [734], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 06:24:51,351 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 06:24:51,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-11-07 06:24:58,044 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 06:24:58,045 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 06:24:58,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 06:24:58,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 06:24:58,046 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 06:24:58,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 06:24:58,054 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 06:24:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 06:24:58,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 06:24:58,209 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 06:24:58,410 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 06:24:58,410 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 06:24:58,416 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 06:24:58,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:24:58 BoogieIcfgContainer [2018-11-07 06:24:58,416 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 06:24:58,417 INFO L168 Benchmark]: Toolchain (without parser) took 233629.10 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -1.9 GB). Peak memory consumption was 654.9 MB. Max. memory is 7.1 GB. [2018-11-07 06:24:58,418 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 06:24:58,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 903.59 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 06:24:58,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 218.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2018-11-07 06:24:58,420 INFO L168 Benchmark]: Boogie Preprocessor took 94.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 06:24:58,421 INFO L168 Benchmark]: RCFGBuilder took 3655.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. [2018-11-07 06:24:58,422 INFO L168 Benchmark]: TraceAbstraction took 228750.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 575.2 MB. Max. memory is 7.1 GB. [2018-11-07 06:24:58,429 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 903.59 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 218.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -854.4 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.53 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3655.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 122.6 MB). Peak memory consumption was 122.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228750.54 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 575.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 557 with TraceHistMax 6,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. TIMEOUT Result, 228.6s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 160.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1899 SDtfs, 11844 SDslu, 2060 SDs, 0 SdLazy, 15974 SolverSat, 3103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 128.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2801 GetRequests, 2656 SyntacticMatches, 5 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11181occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 37.4s AbstIntTime, 6 AbstIntIterations, 4 AbstIntStrong, 0.9972680116689103 AbsIntWeakeningRatio, 0.08729641693811074 AbsIntAvgWeakeningVarsNumRemoved, 16.05602605863192 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 978 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 3259 NumberOfCodeBlocks, 3259 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3796 ConstructedInterpolants, 0 QuantifiedInterpolants, 11807641 SizeOfPredicates, 7 NumberOfNonLiveVariables, 811 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 3227/4141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown