java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:13:07,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:13:07,985 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:13:08,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:13:08,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:13:08,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:13:08,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:13:08,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:13:08,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:13:08,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:13:08,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:13:08,015 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:13:08,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:13:08,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:13:08,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:13:08,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:13:08,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:13:08,033 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:13:08,037 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:13:08,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:13:08,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:13:08,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:13:08,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:13:08,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:13:08,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:13:08,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:13:08,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:13:08,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:13:08,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:13:08,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:13:08,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:13:08,058 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:13:08,058 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:13:08,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:13:08,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:13:08,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:13:08,062 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:13:08,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:13:08,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:13:08,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:13:08,087 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:13:08,088 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:13:08,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:13:08,088 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:13:08,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:13:08,088 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:13:08,089 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:13:08,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:13:08,089 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:13:08,089 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:13:08,089 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:13:08,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:13:08,090 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:13:08,090 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:13:08,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:13:08,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:13:08,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:13:08,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:13:08,091 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:13:08,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:13:08,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:13:08,092 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:13:08,092 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:13:08,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:13:08,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:13:08,093 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:13:08,093 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:13:08,093 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:13:08,093 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:13:08,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:13:08,094 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:13:08,094 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:13:08,094 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:13:08,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:13:08,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:13:08,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:13:08,160 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:13:08,160 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:13:08,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-10-25 00:13:08,227 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a3215860/90ade96143724505876a765b920e71f6/FLAGbaead6ba9 [2018-10-25 00:13:08,885 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:13:08,886 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label17_true-unreach-call.c [2018-10-25 00:13:08,907 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a3215860/90ade96143724505876a765b920e71f6/FLAGbaead6ba9 [2018-10-25 00:13:08,926 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/9a3215860/90ade96143724505876a765b920e71f6 [2018-10-25 00:13:08,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:13:08,938 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:13:08,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:08,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:13:08,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:13:08,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:08" (1/1) ... [2018-10-25 00:13:08,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b38e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:08, skipping insertion in model container [2018-10-25 00:13:08,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:13:08" (1/1) ... [2018-10-25 00:13:08,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:13:09,047 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:13:09,729 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:09,735 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:13:10,058 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:13:10,082 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:13:10,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10 WrapperNode [2018-10-25 00:13:10,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:13:10,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:13:10,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:13:10,085 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:13:10,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:13:10,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:13:10,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:13:10,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:13:10,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... [2018-10-25 00:13:10,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:13:10,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:13:10,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:13:10,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:13:10,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:13:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:13:10,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:13:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:13:10,591 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:13:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:13:10,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:13:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:13:10,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:13:15,107 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:13:15,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:13:15 BoogieIcfgContainer [2018-10-25 00:13:15,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:13:15,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:13:15,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:13:15,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:13:15,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:13:08" (1/3) ... [2018-10-25 00:13:15,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c851bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:13:15, skipping insertion in model container [2018-10-25 00:13:15,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:13:10" (2/3) ... [2018-10-25 00:13:15,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c851bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:13:15, skipping insertion in model container [2018-10-25 00:13:15,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:13:15" (3/3) ... [2018-10-25 00:13:15,123 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label17_true-unreach-call.c [2018-10-25 00:13:15,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:13:15,151 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:13:15,171 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:13:15,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:13:15,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:13:15,215 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:13:15,215 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:13:15,215 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:13:15,216 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:13:15,216 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:13:15,216 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:13:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-25 00:13:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-25 00:13:15,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:15,274 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:15,276 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:15,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1877378719, now seen corresponding path program 1 times [2018-10-25 00:13:15,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:15,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:15,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:15,338 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:16,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:13:16,597 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:16,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:13:16,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:13:16,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:13:16,621 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-10-25 00:13:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:19,910 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-10-25 00:13:19,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:13:19,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-10-25 00:13:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:19,940 INFO L225 Difference]: With dead ends: 1066 [2018-10-25 00:13:19,941 INFO L226 Difference]: Without dead ends: 748 [2018-10-25 00:13:19,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:13:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-25 00:13:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-10-25 00:13:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-25 00:13:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-10-25 00:13:20,047 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 206 [2018-10-25 00:13:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:20,048 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-10-25 00:13:20,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:13:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-10-25 00:13:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-25 00:13:20,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:20,058 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:20,058 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:20,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:20,059 INFO L82 PathProgramCache]: Analyzing trace with hash -360788856, now seen corresponding path program 1 times [2018-10-25 00:13:20,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:20,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:20,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:20,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:20,061 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:20,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:20,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:13:20,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:20,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:13:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:13:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:13:20,367 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-10-25 00:13:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:23,325 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-10-25 00:13:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:13:23,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 216 [2018-10-25 00:13:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:23,337 INFO L225 Difference]: With dead ends: 1590 [2018-10-25 00:13:23,337 INFO L226 Difference]: Without dead ends: 1069 [2018-10-25 00:13:23,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:13:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-25 00:13:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-10-25 00:13:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-25 00:13:23,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-10-25 00:13:23,419 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 216 [2018-10-25 00:13:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:23,419 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-10-25 00:13:23,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:13:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-10-25 00:13:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-25 00:13:23,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:23,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:23,428 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:23,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1375336592, now seen corresponding path program 1 times [2018-10-25 00:13:23,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:23,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:23,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:23,430 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:23,727 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:13:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:23,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:13:23,960 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:23,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:13:23,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:13:23,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:13:23,964 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-10-25 00:13:27,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:27,380 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-10-25 00:13:27,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:13:27,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-10-25 00:13:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:27,410 INFO L225 Difference]: With dead ends: 3166 [2018-10-25 00:13:27,411 INFO L226 Difference]: Without dead ends: 2148 [2018-10-25 00:13:27,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:13:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-10-25 00:13:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-10-25 00:13:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-10-25 00:13:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-10-25 00:13:27,538 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 217 [2018-10-25 00:13:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:27,539 INFO L481 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-10-25 00:13:27,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:13:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-10-25 00:13:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-25 00:13:27,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:27,550 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:27,551 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:27,552 INFO L82 PathProgramCache]: Analyzing trace with hash 809544677, now seen corresponding path program 1 times [2018-10-25 00:13:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:27,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:27,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:27,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:13:27,987 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:27,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:13:27,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:13:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:13:27,990 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-10-25 00:13:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:30,626 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-10-25 00:13:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:13:30,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-25 00:13:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:30,652 INFO L225 Difference]: With dead ends: 6108 [2018-10-25 00:13:30,652 INFO L226 Difference]: Without dead ends: 4009 [2018-10-25 00:13:30,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:13:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-10-25 00:13:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-10-25 00:13:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-10-25 00:13:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-10-25 00:13:30,788 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 219 [2018-10-25 00:13:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:30,788 INFO L481 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-10-25 00:13:30,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:13:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-10-25 00:13:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-25 00:13:30,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:30,807 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:30,807 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -703936903, now seen corresponding path program 1 times [2018-10-25 00:13:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:30,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:30,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:31,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:31,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 00:13:31,123 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:31,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:13:31,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:13:31,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:13:31,124 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-10-25 00:13:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:33,185 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-10-25 00:13:33,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:13:33,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-10-25 00:13:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:33,250 INFO L225 Difference]: With dead ends: 12096 [2018-10-25 00:13:33,250 INFO L226 Difference]: Without dead ends: 8129 [2018-10-25 00:13:33,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:13:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-10-25 00:13:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-10-25 00:13:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-10-25 00:13:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-10-25 00:13:33,577 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 225 [2018-10-25 00:13:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:33,577 INFO L481 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-10-25 00:13:33,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:13:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-10-25 00:13:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-25 00:13:33,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:33,610 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:33,611 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:33,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash -520261908, now seen corresponding path program 1 times [2018-10-25 00:13:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:33,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:33,857 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:13:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:34,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:34,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:13:34,188 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:34,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:13:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:13:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:13:34,189 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-10-25 00:13:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:36,826 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-10-25 00:13:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:13:36,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2018-10-25 00:13:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:36,937 INFO L225 Difference]: With dead ends: 22960 [2018-10-25 00:13:36,937 INFO L226 Difference]: Without dead ends: 15024 [2018-10-25 00:13:36,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:13:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-10-25 00:13:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-10-25 00:13:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-10-25 00:13:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-10-25 00:13:37,481 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 230 [2018-10-25 00:13:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:37,482 INFO L481 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-10-25 00:13:37,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:13:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-10-25 00:13:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-25 00:13:37,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:37,545 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:37,545 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:37,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2136033641, now seen corresponding path program 1 times [2018-10-25 00:13:37,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:37,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:37,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:37,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:37,551 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:38,225 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-25 00:13:38,492 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-25 00:13:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-25 00:13:38,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:38,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:13:38,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:38,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:13:38,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:13:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:13:38,757 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-10-25 00:13:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:43,558 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-10-25 00:13:43,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 00:13:43,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 254 [2018-10-25 00:13:43,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:43,628 INFO L225 Difference]: With dead ends: 31818 [2018-10-25 00:13:43,628 INFO L226 Difference]: Without dead ends: 16918 [2018-10-25 00:13:43,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:13:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-10-25 00:13:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-10-25 00:13:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-10-25 00:13:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-10-25 00:13:44,134 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 254 [2018-10-25 00:13:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:44,135 INFO L481 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-10-25 00:13:44,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:13:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-10-25 00:13:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-25 00:13:44,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:44,194 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:44,194 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:44,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1208828973, now seen corresponding path program 1 times [2018-10-25 00:13:44,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:44,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:44,198 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:13:44,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:13:44,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:13:44,570 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:44,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:13:44,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:13:44,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:13:44,572 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 3 states. [2018-10-25 00:13:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:13:46,462 INFO L93 Difference]: Finished difference Result 46520 states and 75721 transitions. [2018-10-25 00:13:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:13:46,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2018-10-25 00:13:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:13:46,596 INFO L225 Difference]: With dead ends: 46520 [2018-10-25 00:13:46,596 INFO L226 Difference]: Without dead ends: 29610 [2018-10-25 00:13:46,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:13:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29610 states. [2018-10-25 00:13:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29610 to 29560. [2018-10-25 00:13:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29560 states. [2018-10-25 00:13:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 45643 transitions. [2018-10-25 00:13:47,368 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 45643 transitions. Word has length 285 [2018-10-25 00:13:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:13:47,369 INFO L481 AbstractCegarLoop]: Abstraction has 29560 states and 45643 transitions. [2018-10-25 00:13:47,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:13:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 45643 transitions. [2018-10-25 00:13:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-25 00:13:47,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:13:47,446 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:13:47,446 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:13:47,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1586453435, now seen corresponding path program 1 times [2018-10-25 00:13:47,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:13:47,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:47,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:13:47,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:13:47,449 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:13:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:13:48,126 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:13:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:13:48,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:13:48,475 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:13:48,476 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2018-10-25 00:13:48,478 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:13:48,538 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:13:48,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:13:49,820 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:13:49,822 INFO L272 AbstractInterpreter]: Visited 208 different actions 208 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-10-25 00:13:49,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:13:49,869 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:13:51,219 INFO L232 lantSequenceWeakener]: Weakened 282 states. On average, predicates are now at 73.79% of their original sizes. [2018-10-25 00:13:51,219 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:13:52,075 INFO L413 sIntCurrentIteration]: We have 295 unified AI predicates [2018-10-25 00:13:52,076 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:13:52,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:13:52,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23 [2018-10-25 00:13:52,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:13:52,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:13:52,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:13:52,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:13:52,079 INFO L87 Difference]: Start difference. First operand 29560 states and 45643 transitions. Second operand 15 states. [2018-10-25 00:14:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:04,678 INFO L93 Difference]: Finished difference Result 59324 states and 91543 transitions. [2018-10-25 00:14:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:14:04,678 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 296 [2018-10-25 00:14:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:04,809 INFO L225 Difference]: With dead ends: 59324 [2018-10-25 00:14:04,809 INFO L226 Difference]: Without dead ends: 29770 [2018-10-25 00:14:04,888 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:14:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2018-10-25 00:14:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29768. [2018-10-25 00:14:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29768 states. [2018-10-25 00:14:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29768 states to 29768 states and 45861 transitions. [2018-10-25 00:14:05,522 INFO L78 Accepts]: Start accepts. Automaton has 29768 states and 45861 transitions. Word has length 296 [2018-10-25 00:14:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:05,522 INFO L481 AbstractCegarLoop]: Abstraction has 29768 states and 45861 transitions. [2018-10-25 00:14:05,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:14:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 29768 states and 45861 transitions. [2018-10-25 00:14:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-25 00:14:05,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:05,588 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:05,589 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:05,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1257760584, now seen corresponding path program 1 times [2018-10-25 00:14:05,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:05,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:05,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:05,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:05,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:05,911 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:14:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 121 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-25 00:14:06,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:14:06,071 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:14:06,071 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2018-10-25 00:14:06,072 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [174], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:14:06,083 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:14:06,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:14:07,252 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:14:07,252 INFO L272 AbstractInterpreter]: Visited 212 different actions 418 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:14:07,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:07,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:14:09,322 INFO L232 lantSequenceWeakener]: Weakened 303 states. On average, predicates are now at 73.62% of their original sizes. [2018-10-25 00:14:09,322 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:14:09,747 INFO L413 sIntCurrentIteration]: We have 307 unified AI predicates [2018-10-25 00:14:09,747 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:14:09,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:14:09,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [8] total 28 [2018-10-25 00:14:09,748 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:09,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-25 00:14:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-25 00:14:09,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:14:09,749 INFO L87 Difference]: Start difference. First operand 29768 states and 45861 transitions. Second operand 22 states. [2018-10-25 00:14:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:14:33,417 INFO L93 Difference]: Finished difference Result 59536 states and 91777 transitions. [2018-10-25 00:14:33,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:14:33,417 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 308 [2018-10-25 00:14:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:14:33,512 INFO L225 Difference]: With dead ends: 59536 [2018-10-25 00:14:33,512 INFO L226 Difference]: Without dead ends: 29982 [2018-10-25 00:14:33,571 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 316 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2018-10-25 00:14:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29982 states. [2018-10-25 00:14:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29982 to 29979. [2018-10-25 00:14:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29979 states. [2018-10-25 00:14:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29979 states to 29979 states and 46090 transitions. [2018-10-25 00:14:34,200 INFO L78 Accepts]: Start accepts. Automaton has 29979 states and 46090 transitions. Word has length 308 [2018-10-25 00:14:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:14:34,201 INFO L481 AbstractCegarLoop]: Abstraction has 29979 states and 46090 transitions. [2018-10-25 00:14:34,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-25 00:14:34,201 INFO L276 IsEmpty]: Start isEmpty. Operand 29979 states and 46090 transitions. [2018-10-25 00:14:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-25 00:14:34,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:14:34,264 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:14:34,264 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:14:34,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1083232552, now seen corresponding path program 1 times [2018-10-25 00:14:34,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:14:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:14:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:14:34,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:14:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:14:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 161 proven. 50 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-25 00:14:34,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:14:34,933 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:14:34,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-10-25 00:14:34,934 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [64], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:14:34,950 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:14:34,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:14:37,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:14:37,728 INFO L272 AbstractInterpreter]: Visited 212 different actions 423 times. Merged at 7 different actions 10 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:14:37,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:14:37,736 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:14:42,090 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 75.58% of their original sizes. [2018-10-25 00:14:42,090 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:14:50,961 INFO L413 sIntCurrentIteration]: We have 330 unified AI predicates [2018-10-25 00:14:50,961 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:14:50,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:14:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:14:50,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:14:50,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:14:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:14:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:14:50,964 INFO L87 Difference]: Start difference. First operand 29979 states and 46090 transitions. Second operand 13 states. [2018-10-25 00:15:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:15:43,379 INFO L93 Difference]: Finished difference Result 72909 states and 112211 transitions. [2018-10-25 00:15:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:15:43,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 331 [2018-10-25 00:15:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:15:43,494 INFO L225 Difference]: With dead ends: 72909 [2018-10-25 00:15:43,494 INFO L226 Difference]: Without dead ends: 43355 [2018-10-25 00:15:43,547 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 334 GetRequests, 121 SyntacticMatches, 198 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:15:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43355 states. [2018-10-25 00:15:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43355 to 43092. [2018-10-25 00:15:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43092 states. [2018-10-25 00:15:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43092 states to 43092 states and 64315 transitions. [2018-10-25 00:15:44,389 INFO L78 Accepts]: Start accepts. Automaton has 43092 states and 64315 transitions. Word has length 331 [2018-10-25 00:15:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:15:44,389 INFO L481 AbstractCegarLoop]: Abstraction has 43092 states and 64315 transitions. [2018-10-25 00:15:44,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:15:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 43092 states and 64315 transitions. [2018-10-25 00:15:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-25 00:15:44,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:15:44,478 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:15:44,479 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:15:44,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:15:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1760477341, now seen corresponding path program 1 times [2018-10-25 00:15:44,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:15:44,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:15:44,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:15:44,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:15:44,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:15:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:15:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 160 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:15:45,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:15:45,846 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:15:45,846 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2018-10-25 00:15:45,847 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [44], [45], [49], [52], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1073], [1081], [1089], [1097], [1105], [1109], [1111], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:15:45,854 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:15:45,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:15:47,572 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:15:47,572 INFO L272 AbstractInterpreter]: Visited 211 different actions 416 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:15:47,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:15:47,581 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:15:51,091 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 74.22% of their original sizes. [2018-10-25 00:15:51,091 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:16:03,045 INFO L413 sIntCurrentIteration]: We have 342 unified AI predicates [2018-10-25 00:16:03,046 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:16:03,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:16:03,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 24 [2018-10-25 00:16:03,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:16:03,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-25 00:16:03,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-25 00:16:03,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:16:03,048 INFO L87 Difference]: Start difference. First operand 43092 states and 64315 transitions. Second operand 16 states. Received shutdown request... [2018-10-25 00:17:04,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:17:04,995 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 00:17:05,001 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 00:17:05,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:17:05 BoogieIcfgContainer [2018-10-25 00:17:05,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:17:05,002 INFO L168 Benchmark]: Toolchain (without parser) took 236064.55 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 139.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,003 INFO L168 Benchmark]: CDTParser took 0.30 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-10-25 00:17:05,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1144.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 316.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.1 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,006 INFO L168 Benchmark]: Boogie Preprocessor took 113.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,007 INFO L168 Benchmark]: RCFGBuilder took 4598.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 260.5 MB). Peak memory consumption was 260.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,007 INFO L168 Benchmark]: TraceAbstraction took 229887.80 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.3 GB in the end (delta: 676.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:17:05,012 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.30 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 1144.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 316.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 765.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -896.1 MB). Peak memory consumption was 40.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 113.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4598.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 260.5 MB). Peak memory consumption was 260.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229887.80 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.8 GB). Free memory was 2.0 GB in the beginning and 1.3 GB in the end (delta: 676.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1632]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1632). Cancelled while BasicCegarLoop was constructing difference of abstraction (43092states) and FLOYD_HOARE automaton (currently 16 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (15361 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 229.7s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 175.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2403 SDtfs, 14956 SDslu, 1932 SDs, 0 SdLazy, 19259 SolverSat, 1941 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 118.3s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1355 GetRequests, 823 SyntacticMatches, 420 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43092occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.1s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.9989322384005743 AbsIntWeakeningRatio, 0.2488226059654631 AbsIntAvgWeakeningVarsNumRemoved, 14.976452119309263 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1010 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3130 NumberOfCodeBlocks, 3130 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3118 ConstructedInterpolants, 0 QuantifiedInterpolants, 2808546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 772/931 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown