java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 16:06:57,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 16:06:57,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 16:06:57,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 16:06:57,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 16:06:57,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 16:06:57,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 16:06:57,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 16:06:57,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 16:06:57,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 16:06:57,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 16:06:57,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 16:06:57,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 16:06:57,528 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 16:06:57,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 16:06:57,530 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 16:06:57,531 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 16:06:57,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 16:06:57,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 16:06:57,544 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 16:06:57,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 16:06:57,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 16:06:57,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 16:06:57,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 16:06:57,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 16:06:57,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 16:06:57,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 16:06:57,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 16:06:57,555 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 16:06:57,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 16:06:57,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 16:06:57,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 16:06:57,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 16:06:57,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 16:06:57,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 16:06:57,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 16:06:57,565 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 16:06:57,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 16:06:57,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 16:06:57,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 16:06:57,593 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 16:06:57,593 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 16:06:57,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 16:06:57,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 16:06:57,594 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 16:06:57,594 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 16:06:57,594 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 16:06:57,594 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 16:06:57,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 16:06:57,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 16:06:57,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 16:06:57,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 16:06:57,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 16:06:57,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 16:06:57,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 16:06:57,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 16:06:57,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 16:06:57,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 16:06:57,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 16:06:57,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 16:06:57,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 16:06:57,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 16:06:57,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 16:06:57,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 16:06:57,598 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 16:06:57,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 16:06:57,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 16:06:57,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 16:06:57,599 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 16:06:57,599 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 16:06:57,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 16:06:57,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 16:06:57,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 16:06:57,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 16:06:57,687 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 16:06:57,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-09-14 16:06:58,046 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40743b8de/83607064755943c0a618bdc5fb379b24/FLAG1afa926c4 [2018-09-14 16:06:58,398 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 16:06:58,399 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-09-14 16:06:58,416 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40743b8de/83607064755943c0a618bdc5fb379b24/FLAG1afa926c4 [2018-09-14 16:06:58,433 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40743b8de/83607064755943c0a618bdc5fb379b24 [2018-09-14 16:06:58,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 16:06:58,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 16:06:58,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 16:06:58,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 16:06:58,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 16:06:58,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:06:58" (1/1) ... [2018-09-14 16:06:58,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:58, skipping insertion in model container [2018-09-14 16:06:58,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 04:06:58" (1/1) ... [2018-09-14 16:06:58,474 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 16:06:59,226 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:06:59,250 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 16:06:59,456 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 16:06:59,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59 WrapperNode [2018-09-14 16:06:59,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 16:06:59,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 16:06:59,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 16:06:59,525 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 16:06:59,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:06:59,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:06:59,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 16:06:59,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 16:06:59,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 16:06:59,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 16:06:59,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:06:59,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:06:59,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:06:59,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:07:00,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:07:00,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:07:00,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... [2018-09-14 16:07:00,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 16:07:00,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 16:07:00,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 16:07:00,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 16:07:00,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 16:07:00,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 16:07:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 16:07:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 16:07:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 16:07:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 16:07:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 16:07:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 16:07:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 16:07:04,975 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 16:07:04,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:07:04 BoogieIcfgContainer [2018-09-14 16:07:04,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 16:07:04,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 16:07:04,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 16:07:04,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 16:07:04,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 04:06:58" (1/3) ... [2018-09-14 16:07:04,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3da7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:07:04, skipping insertion in model container [2018-09-14 16:07:04,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 04:06:59" (2/3) ... [2018-09-14 16:07:04,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3da7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 04:07:04, skipping insertion in model container [2018-09-14 16:07:04,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 04:07:04" (3/3) ... [2018-09-14 16:07:04,985 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-09-14 16:07:04,994 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 16:07:05,002 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 16:07:05,058 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 16:07:05,059 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 16:07:05,059 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 16:07:05,059 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 16:07:05,059 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 16:07:05,060 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 16:07:05,060 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 16:07:05,060 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 16:07:05,060 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 16:07:05,101 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-09-14 16:07:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-14 16:07:05,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:05,140 INFO L376 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] [2018-09-14 16:07:05,141 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 390618596, now seen corresponding path program 1 times [2018-09-14 16:07:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:05,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:05,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:05,207 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:06,369 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:06,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 16:07:06,370 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:06,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 16:07:06,387 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 16:07:06,388 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 16:07:06,390 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-09-14 16:07:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:09,463 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-09-14 16:07:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 16:07:09,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-09-14 16:07:09,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:09,492 INFO L225 Difference]: With dead ends: 1066 [2018-09-14 16:07:09,492 INFO L226 Difference]: Without dead ends: 748 [2018-09-14 16:07:09,501 INFO L604 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-09-14 16:07:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-09-14 16:07:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-09-14 16:07:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-09-14 16:07:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-09-14 16:07:09,623 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 201 [2018-09-14 16:07:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:09,625 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-09-14 16:07:09,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 16:07:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-09-14 16:07:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-14 16:07:09,648 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:09,648 INFO L376 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] [2018-09-14 16:07:09,649 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1605931427, now seen corresponding path program 1 times [2018-09-14 16:07:09,649 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:09,652 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:10,027 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-09-14 16:07:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:10,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:10,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:07:10,460 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:10,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:07:10,463 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:07:10,463 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:07:10,463 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-09-14 16:07:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:13,774 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-09-14 16:07:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 16:07:13,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-09-14 16:07:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:13,803 INFO L225 Difference]: With dead ends: 1590 [2018-09-14 16:07:13,803 INFO L226 Difference]: Without dead ends: 1069 [2018-09-14 16:07:13,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 16:07:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-09-14 16:07:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-09-14 16:07:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-09-14 16:07:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-09-14 16:07:13,880 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 211 [2018-09-14 16:07:13,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:13,880 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-09-14 16:07:13,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:07:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-09-14 16:07:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-14 16:07:13,887 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:13,887 INFO L376 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] [2018-09-14 16:07:13,887 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:13,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1477255851, now seen corresponding path program 1 times [2018-09-14 16:07:13,888 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:13,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:13,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:13,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:13,890 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:14,168 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:07:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:14,400 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:14,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 16:07:14,401 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:14,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:07:14,403 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:07:14,403 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:07:14,404 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-09-14 16:07:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:18,160 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-09-14 16:07:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:07:18,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-09-14 16:07:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:18,186 INFO L225 Difference]: With dead ends: 3166 [2018-09-14 16:07:18,186 INFO L226 Difference]: Without dead ends: 2148 [2018-09-14 16:07:18,193 INFO L604 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-09-14 16:07:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-09-14 16:07:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-09-14 16:07:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-09-14 16:07:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-09-14 16:07:18,286 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 212 [2018-09-14 16:07:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:18,286 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-09-14 16:07:18,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:07:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-09-14 16:07:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-14 16:07:18,296 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:18,296 INFO L376 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] [2018-09-14 16:07:18,296 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:18,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1229236448, now seen corresponding path program 1 times [2018-09-14 16:07:18,297 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:18,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:18,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:18,298 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:18,592 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:18,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:07:18,592 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:18,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:07:18,593 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:07:18,594 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:07:18,594 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-09-14 16:07:20,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:20,482 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-09-14 16:07:20,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:07:20,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-09-14 16:07:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:20,506 INFO L225 Difference]: With dead ends: 6108 [2018-09-14 16:07:20,507 INFO L226 Difference]: Without dead ends: 4009 [2018-09-14 16:07:20,516 INFO L604 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-09-14 16:07:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-09-14 16:07:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-09-14 16:07:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-09-14 16:07:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-09-14 16:07:20,661 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 214 [2018-09-14 16:07:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:20,661 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-09-14 16:07:20,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:07:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-09-14 16:07:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-14 16:07:20,678 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:20,679 INFO L376 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] [2018-09-14 16:07:20,679 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -565100084, now seen corresponding path program 1 times [2018-09-14 16:07:20,680 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:20,681 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:20,912 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:20,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-14 16:07:20,913 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:20,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-14 16:07:20,913 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-14 16:07:20,914 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-09-14 16:07:20,914 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-09-14 16:07:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:23,219 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-09-14 16:07:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:07:23,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2018-09-14 16:07:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:23,285 INFO L225 Difference]: With dead ends: 12096 [2018-09-14 16:07:23,286 INFO L226 Difference]: Without dead ends: 8129 [2018-09-14 16:07:23,305 INFO L604 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-09-14 16:07:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-09-14 16:07:23,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-09-14 16:07:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-09-14 16:07:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-09-14 16:07:23,641 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 220 [2018-09-14 16:07:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:23,642 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-09-14 16:07:23,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-14 16:07:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-09-14 16:07:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-14 16:07:23,675 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:23,675 INFO L376 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] [2018-09-14 16:07:23,675 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash -314712711, now seen corresponding path program 1 times [2018-09-14 16:07:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:23,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:23,677 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:23,931 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:07:24,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:24,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:24,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:07:24,260 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:24,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:07:24,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:07:24,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:07:24,261 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-09-14 16:07:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:26,737 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-09-14 16:07:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 16:07:26,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2018-09-14 16:07:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:26,938 INFO L225 Difference]: With dead ends: 22960 [2018-09-14 16:07:26,939 INFO L226 Difference]: Without dead ends: 15024 [2018-09-14 16:07:26,967 INFO L604 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-09-14 16:07:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-09-14 16:07:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-09-14 16:07:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-09-14 16:07:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-09-14 16:07:27,470 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 225 [2018-09-14 16:07:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:27,471 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-09-14 16:07:27,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:07:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-09-14 16:07:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-14 16:07:27,530 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:27,531 INFO L376 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] [2018-09-14 16:07:27,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash 732116718, now seen corresponding path program 1 times [2018-09-14 16:07:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:27,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:27,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:27,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:27,534 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:28,207 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-14 16:07:28,404 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-14 16:07:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-14 16:07:28,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:07:28,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 16:07:28,615 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:28,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:07:28,616 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:07:28,616 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:07:28,616 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-09-14 16:07:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:32,294 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-09-14 16:07:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 16:07:32,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-09-14 16:07:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:32,367 INFO L225 Difference]: With dead ends: 31818 [2018-09-14 16:07:32,367 INFO L226 Difference]: Without dead ends: 16918 [2018-09-14 16:07:32,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-14 16:07:32,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-09-14 16:07:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-09-14 16:07:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-09-14 16:07:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-09-14 16:07:33,002 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 249 [2018-09-14 16:07:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:33,003 INFO L480 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-09-14 16:07:33,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:07:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-09-14 16:07:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-14 16:07:33,068 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:33,068 INFO L376 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] [2018-09-14 16:07:33,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 646437938, now seen corresponding path program 1 times [2018-09-14 16:07:33,069 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:33,070 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:33,925 WARN L178 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 11 [2018-09-14 16:07:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:34,300 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:07:34,300 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:07:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:34,310 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:07:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:34,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:07:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:35,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:07:35,682 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-09-14 16:07:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:07:36,008 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 16:07:36,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 14 [2018-09-14 16:07:36,008 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:07:36,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:07:36,010 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:07:36,010 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-09-14 16:07:36,010 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 5 states. [2018-09-14 16:07:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:39,908 INFO L93 Difference]: Finished difference Result 43978 states and 68708 transitions. [2018-09-14 16:07:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 16:07:39,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2018-09-14 16:07:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:40,040 INFO L225 Difference]: With dead ends: 43978 [2018-09-14 16:07:40,040 INFO L226 Difference]: Without dead ends: 27068 [2018-09-14 16:07:40,342 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:07:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27068 states. [2018-09-14 16:07:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27068 to 26847. [2018-09-14 16:07:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26847 states. [2018-09-14 16:07:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26847 states to 26847 states and 40396 transitions. [2018-09-14 16:07:41,158 INFO L78 Accepts]: Start accepts. Automaton has 26847 states and 40396 transitions. Word has length 280 [2018-09-14 16:07:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:41,159 INFO L480 AbstractCegarLoop]: Abstraction has 26847 states and 40396 transitions. [2018-09-14 16:07:41,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:07:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 26847 states and 40396 transitions. [2018-09-14 16:07:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-14 16:07:41,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:41,223 INFO L376 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] [2018-09-14 16:07:41,223 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1028846720, now seen corresponding path program 1 times [2018-09-14 16:07:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:41,225 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:41,547 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 16:07:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:07:42,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:07:42,623 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:07:42,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:42,637 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:07:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:42,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:07:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:07:43,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:07:43,878 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-14 16:07:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:07:44,169 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:07:44,169 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:07:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:44,187 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:07:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:44,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:07:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 121 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:07:44,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:07:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:07:44,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:07:44,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 5, 5] total 15 [2018-09-14 16:07:44,883 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:07:44,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 16:07:44,884 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 16:07:44,884 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:07:44,885 INFO L87 Difference]: Start difference. First operand 26847 states and 40396 transitions. Second operand 13 states. [2018-09-14 16:07:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:07:53,513 INFO L93 Difference]: Finished difference Result 127796 states and 245504 transitions. [2018-09-14 16:07:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-14 16:07:53,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 291 [2018-09-14 16:07:53,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:07:54,963 INFO L225 Difference]: With dead ends: 127796 [2018-09-14 16:07:54,963 INFO L226 Difference]: Without dead ends: 100955 [2018-09-14 16:07:55,121 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1182 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=384, Invalid=1256, Unknown=0, NotChecked=0, Total=1640 [2018-09-14 16:07:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100955 states. [2018-09-14 16:07:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100955 to 96840. [2018-09-14 16:07:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96840 states. [2018-09-14 16:07:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96840 states to 96840 states and 145480 transitions. [2018-09-14 16:07:58,485 INFO L78 Accepts]: Start accepts. Automaton has 96840 states and 145480 transitions. Word has length 291 [2018-09-14 16:07:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:07:58,486 INFO L480 AbstractCegarLoop]: Abstraction has 96840 states and 145480 transitions. [2018-09-14 16:07:58,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 16:07:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 96840 states and 145480 transitions. [2018-09-14 16:07:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-14 16:07:58,657 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:07:58,658 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:07:58,658 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:07:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1274474568, now seen corresponding path program 1 times [2018-09-14 16:07:58,658 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:07:58,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:58,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:07:58,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:07:58,660 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:07:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:07:59,959 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-14 16:08:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 90 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:08:00,084 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:08:00,084 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:08:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:00,095 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:08:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:00,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:08:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-14 16:08:00,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:08:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 16:08:01,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 16:08:01,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 16 [2018-09-14 16:08:01,248 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:08:01,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 16:08:01,249 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 16:08:01,249 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-09-14 16:08:01,249 INFO L87 Difference]: Start difference. First operand 96840 states and 145480 transitions. Second operand 6 states. [2018-09-14 16:08:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:08:05,662 INFO L93 Difference]: Finished difference Result 197988 states and 322762 transitions. [2018-09-14 16:08:05,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 16:08:05,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 298 [2018-09-14 16:08:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:08:06,608 INFO L225 Difference]: With dead ends: 197988 [2018-09-14 16:08:06,608 INFO L226 Difference]: Without dead ends: 101152 [2018-09-14 16:08:07,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 589 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-09-14 16:08:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101152 states. [2018-09-14 16:08:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101152 to 97672. [2018-09-14 16:08:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97672 states. [2018-09-14 16:08:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97672 states to 97672 states and 146068 transitions. [2018-09-14 16:08:11,056 INFO L78 Accepts]: Start accepts. Automaton has 97672 states and 146068 transitions. Word has length 298 [2018-09-14 16:08:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:08:11,057 INFO L480 AbstractCegarLoop]: Abstraction has 97672 states and 146068 transitions. [2018-09-14 16:08:11,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 16:08:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97672 states and 146068 transitions. [2018-09-14 16:08:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-14 16:08:11,247 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:08:11,247 INFO L376 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, 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] [2018-09-14 16:08:11,247 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:08:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1103028202, now seen corresponding path program 1 times [2018-09-14 16:08:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:08:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:11,249 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:08:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 100 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-14 16:08:11,615 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:08:11,615 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:08:11,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:11,623 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:08:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:11,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:08:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 16:08:11,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:08:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-09-14 16:08:13,035 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-14 16:08:13,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 15 [2018-09-14 16:08:13,036 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:08:13,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:08:13,036 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:08:13,037 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-09-14 16:08:13,037 INFO L87 Difference]: Start difference. First operand 97672 states and 146068 transitions. Second operand 5 states. [2018-09-14 16:08:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:08:16,602 INFO L93 Difference]: Finished difference Result 293022 states and 462194 transitions. [2018-09-14 16:08:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-14 16:08:16,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2018-09-14 16:08:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:08:17,495 INFO L225 Difference]: With dead ends: 293022 [2018-09-14 16:08:17,496 INFO L226 Difference]: Without dead ends: 195356 [2018-09-14 16:08:17,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 613 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-09-14 16:08:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195356 states. [2018-09-14 16:08:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195356 to 192533. [2018-09-14 16:08:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192533 states. [2018-09-14 16:08:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192533 states to 192533 states and 288013 transitions. [2018-09-14 16:08:24,173 INFO L78 Accepts]: Start accepts. Automaton has 192533 states and 288013 transitions. Word has length 310 [2018-09-14 16:08:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:08:24,174 INFO L480 AbstractCegarLoop]: Abstraction has 192533 states and 288013 transitions. [2018-09-14 16:08:24,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 16:08:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 192533 states and 288013 transitions. [2018-09-14 16:08:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-14 16:08:24,355 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:08:24,355 INFO L376 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, 2, 2, 2, 2, 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] [2018-09-14 16:08:24,356 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:08:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash 281948138, now seen corresponding path program 1 times [2018-09-14 16:08:24,356 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:08:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:24,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:24,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:24,357 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:08:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:08:24,674 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:08:24,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 16:08:24,674 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:08:24,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 16:08:24,675 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 16:08:24,675 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 16:08:24,675 INFO L87 Difference]: Start difference. First operand 192533 states and 288013 transitions. Second operand 3 states. [2018-09-14 16:08:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:08:36,933 INFO L93 Difference]: Finished difference Result 517980 states and 790272 transitions. [2018-09-14 16:08:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 16:08:36,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-09-14 16:08:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:08:38,258 INFO L225 Difference]: With dead ends: 517980 [2018-09-14 16:08:38,258 INFO L226 Difference]: Without dead ends: 325453 [2018-09-14 16:08:38,760 INFO L604 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-09-14 16:08:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325453 states. [2018-09-14 16:08:44,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325453 to 324813. [2018-09-14 16:08:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324813 states. [2018-09-14 16:08:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324813 states to 324813 states and 469060 transitions. [2018-09-14 16:08:45,989 INFO L78 Accepts]: Start accepts. Automaton has 324813 states and 469060 transitions. Word has length 308 [2018-09-14 16:08:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:08:45,990 INFO L480 AbstractCegarLoop]: Abstraction has 324813 states and 469060 transitions. [2018-09-14 16:08:45,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 16:08:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 324813 states and 469060 transitions. [2018-09-14 16:08:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-14 16:08:46,240 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:08:46,240 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:08:46,241 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:08:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1728576349, now seen corresponding path program 1 times [2018-09-14 16:08:46,241 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:08:46,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:46,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:46,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:08:46,242 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:08:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:46,601 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-14 16:08:46,601 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:08:46,602 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 16:08:47,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:47,869 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:08:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:48,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:08:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:08:48,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:08:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-14 16:08:48,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 16:08:48,360 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 16:08:48,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:08:48,376 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 16:08:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:08:48,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 16:08:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-14 16:08:49,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 16:08:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 41 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-14 16:08:49,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 16:08:49,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 16 [2018-09-14 16:08:49,317 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 16:08:49,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 16:08:49,318 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 16:08:49,318 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-09-14 16:08:49,318 INFO L87 Difference]: Start difference. First operand 324813 states and 469060 transitions. Second operand 9 states. [2018-09-14 16:09:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:09:07,668 INFO L93 Difference]: Finished difference Result 789760 states and 1277503 transitions. [2018-09-14 16:09:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-14 16:09:07,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 319 [2018-09-14 16:09:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:09:10,550 INFO L225 Difference]: With dead ends: 789760 [2018-09-14 16:09:10,550 INFO L226 Difference]: Without dead ends: 464953 [2018-09-14 16:09:11,357 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1299 GetRequests, 1274 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2018-09-14 16:09:11,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464953 states. [2018-09-14 16:09:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464953 to 447151. [2018-09-14 16:09:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447151 states. [2018-09-14 16:09:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447151 states to 447151 states and 598497 transitions. [2018-09-14 16:09:33,083 INFO L78 Accepts]: Start accepts. Automaton has 447151 states and 598497 transitions. Word has length 319 [2018-09-14 16:09:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 16:09:33,084 INFO L480 AbstractCegarLoop]: Abstraction has 447151 states and 598497 transitions. [2018-09-14 16:09:33,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 16:09:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 447151 states and 598497 transitions. [2018-09-14 16:09:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-14 16:09:34,736 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 16:09:34,736 INFO L376 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-14 16:09:34,737 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 16:09:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1118165318, now seen corresponding path program 1 times [2018-09-14 16:09:34,737 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 16:09:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:09:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 16:09:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 16:09:34,739 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 16:09:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 16:09:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 16:09:35,474 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 16:09:35,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-14 16:09:35,475 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 16:09:35,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 16:09:35,476 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 16:09:35,476 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:09:35,476 INFO L87 Difference]: Start difference. First operand 447151 states and 598497 transitions. Second operand 5 states. [2018-09-14 16:09:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 16:09:48,640 INFO L93 Difference]: Finished difference Result 947849 states and 1274998 transitions. [2018-09-14 16:09:48,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-14 16:09:48,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 332 [2018-09-14 16:09:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 16:09:50,674 INFO L225 Difference]: With dead ends: 947849 [2018-09-14 16:09:50,675 INFO L226 Difference]: Without dead ends: 500925 [2018-09-14 16:09:52,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-14 16:09:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500925 states. [2018-09-14 16:10:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500925 to 492334. [2018-09-14 16:10:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492334 states. Received shutdown request... [2018-09-14 16:10:21,794 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 16:10:21,802 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 16:10:21,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 04:10:21 BoogieIcfgContainer [2018-09-14 16:10:21,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 16:10:21,803 INFO L168 Benchmark]: Toolchain (without parser) took 203357.80 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 4.3 GB in the end (delta: -2.8 GB). Peak memory consumption was 5.8 GB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,805 INFO L168 Benchmark]: CDTParser took 0.21 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-09-14 16:10:21,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1074.98 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,809 INFO L168 Benchmark]: Boogie Preprocessor took 408.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -931.9 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,810 INFO L168 Benchmark]: RCFGBuilder took 4857.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,811 INFO L168 Benchmark]: TraceAbstraction took 196824.95 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 4.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. [2018-09-14 16:10:21,822 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.21 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 1074.98 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: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 184.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 408.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 798.0 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -931.9 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4857.65 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.0 GB in the end (delta: 248.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196824.95 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.8 GB). Free memory was 2.0 GB in the beginning and 4.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1617]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1617). Cancelled while ReachableStatesComputation was computing reachable states (492334 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 196.7s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 100.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2571 SDtfs, 19177 SDslu, 3482 SDs, 0 SdLazy, 21385 SolverSat, 5126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4408 GetRequests, 4238 SyntacticMatches, 22 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447151occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 73.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 29773 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 5778 NumberOfCodeBlocks, 5778 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7858 ConstructedInterpolants, 0 QuantifiedInterpolants, 7923246 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8471 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 2621/2978 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_16-10-21-837.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem03_label53_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_16-10-21-837.csv Completed graceful shutdown