java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:18:04,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:18:04,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:18:04,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:18:04,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:18:04,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:18:04,563 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:18:04,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:18:04,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:18:04,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:18:04,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:18:04,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:18:04,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:18:04,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:18:04,576 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:18:04,577 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:18:04,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:18:04,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:18:04,582 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:18:04,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:18:04,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:18:04,586 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:18:04,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:18:04,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:18:04,589 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:18:04,590 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:18:04,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:18:04,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:18:04,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:18:04,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:18:04,594 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:18:04,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:18:04,595 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:18:04,595 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:18:04,596 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:18:04,596 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:18:04,597 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:18:04,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:18:04,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:18:04,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:18:04,615 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:18:04,615 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:18:04,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:18:04,616 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:18:04,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:18:04,616 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:18:04,616 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:18:04,617 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:18:04,617 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:18:04,617 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:18:04,617 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:18:04,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:18:04,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:18:04,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:18:04,618 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:18:04,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:18:04,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:18:04,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:18:04,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:18:04,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:18:04,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:18:04,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:18:04,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:18:04,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:18:04,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:18:04,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:18:04,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:18:04,621 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:18:04,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:18:04,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:18:04,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:18:04,624 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:18:04,624 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:18:04,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:18:04,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:18:04,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:18:04,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:18:04,692 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:18:04,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-25 00:18:04,750 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6770101e2/9f626a36e22f4be1961c77c88e6ac40f/FLAG11a73f45f [2018-10-25 00:18:05,396 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:18:05,397 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label53_true-unreach-call.c [2018-10-25 00:18:05,420 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6770101e2/9f626a36e22f4be1961c77c88e6ac40f/FLAG11a73f45f [2018-10-25 00:18:05,438 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6770101e2/9f626a36e22f4be1961c77c88e6ac40f [2018-10-25 00:18:05,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:18:05,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:18:05,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:18:05,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:18:05,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:18:05,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:05" (1/1) ... [2018-10-25 00:18:05,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5086d3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:05, skipping insertion in model container [2018-10-25 00:18:05,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:18:05" (1/1) ... [2018-10-25 00:18:05,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:18:05,578 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:18:06,271 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:18:06,277 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:18:06,567 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:18:06,592 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:18:06,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06 WrapperNode [2018-10-25 00:18:06,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:18:06,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:18:06,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:18:06,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:18:06,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:18:06,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:18:06,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:18:06,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:18:06,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:06,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:07,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... [2018-10-25 00:18:07,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:18:07,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:18:07,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:18:07,027 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:18:07,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:18:07,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:18:07,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:18:07,110 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:18:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:18:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:18:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:18:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:18:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:18:11,746 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:18:11,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:11 BoogieIcfgContainer [2018-10-25 00:18:11,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:18:11,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:18:11,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:18:11,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:18:11,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:18:05" (1/3) ... [2018-10-25 00:18:11,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61473b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:18:11, skipping insertion in model container [2018-10-25 00:18:11,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:18:06" (2/3) ... [2018-10-25 00:18:11,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61473b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:18:11, skipping insertion in model container [2018-10-25 00:18:11,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:18:11" (3/3) ... [2018-10-25 00:18:11,763 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label53_true-unreach-call.c [2018-10-25 00:18:11,773 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:18:11,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:18:11,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:18:11,853 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:18:11,854 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:18:11,854 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:18:11,854 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:18:11,854 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:18:11,854 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:18:11,855 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:18:11,855 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:18:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-10-25 00:18:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-25 00:18:11,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:11,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:11,917 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:11,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash 390618596, now seen corresponding path program 1 times [2018-10-25 00:18:11,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:11,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:13,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:13,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 00:18:13,020 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:13,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 00:18:13,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 00:18:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:18:13,043 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-10-25 00:18:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:16,416 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-10-25 00:18:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:18:16,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-25 00:18:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:16,446 INFO L225 Difference]: With dead ends: 1066 [2018-10-25 00:18:16,446 INFO L226 Difference]: Without dead ends: 748 [2018-10-25 00:18:16,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 00:18:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-25 00:18:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-10-25 00:18:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-25 00:18:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-10-25 00:18:16,542 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 201 [2018-10-25 00:18:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:16,543 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-10-25 00:18:16,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 00:18:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-10-25 00:18:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-25 00:18:16,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:16,558 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:16,559 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:16,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1605931427, now seen corresponding path program 1 times [2018-10-25 00:18:16,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:16,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:16,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:16,561 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:16,898 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:18:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:16,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:16,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:18:16,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:16,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:18:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:18:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:18:16,984 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-10-25 00:18:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:20,538 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-10-25 00:18:20,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-25 00:18:20,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-10-25 00:18:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:20,561 INFO L225 Difference]: With dead ends: 1590 [2018-10-25 00:18:20,562 INFO L226 Difference]: Without dead ends: 1069 [2018-10-25 00:18:20,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:18:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-10-25 00:18:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-10-25 00:18:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-25 00:18:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-10-25 00:18:20,660 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 211 [2018-10-25 00:18:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:20,661 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-10-25 00:18:20,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:18:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-10-25 00:18:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-25 00:18:20,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:20,667 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:20,669 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:20,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1477255851, now seen corresponding path program 1 times [2018-10-25 00:18:20,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:20,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:20,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:20,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:20,912 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:18:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:21,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:21,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:18:21,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:21,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:18:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:18:21,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:18:21,144 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-10-25 00:18:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:24,485 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-10-25 00:18:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:18:24,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2018-10-25 00:18:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:24,506 INFO L225 Difference]: With dead ends: 3166 [2018-10-25 00:18:24,506 INFO L226 Difference]: Without dead ends: 2148 [2018-10-25 00:18:24,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:18:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-10-25 00:18:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-10-25 00:18:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-10-25 00:18:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-10-25 00:18:24,599 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 212 [2018-10-25 00:18:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:24,600 INFO L481 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-10-25 00:18:24,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:18:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-10-25 00:18:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-25 00:18:24,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:24,610 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:24,611 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:24,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1229236448, now seen corresponding path program 1 times [2018-10-25 00:18:24,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:24,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:24,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:24,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:25,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:25,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:18:25,076 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:25,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:18:25,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:18:25,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:18:25,078 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-10-25 00:18:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:27,720 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-10-25 00:18:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:18:27,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-25 00:18:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:27,753 INFO L225 Difference]: With dead ends: 6108 [2018-10-25 00:18:27,753 INFO L226 Difference]: Without dead ends: 4009 [2018-10-25 00:18:27,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:18:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-10-25 00:18:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-10-25 00:18:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-10-25 00:18:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-10-25 00:18:27,910 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 214 [2018-10-25 00:18:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:27,910 INFO L481 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-10-25 00:18:27,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:18:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-10-25 00:18:27,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-25 00:18:27,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:27,930 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:27,930 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:27,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash -565100084, now seen corresponding path program 1 times [2018-10-25 00:18:27,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:27,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:27,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:27,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:28,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:28,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-25 00:18:28,389 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:28,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:18:28,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:18:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:18:28,390 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-10-25 00:18:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:30,292 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-10-25 00:18:30,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:18:30,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 220 [2018-10-25 00:18:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:30,363 INFO L225 Difference]: With dead ends: 12096 [2018-10-25 00:18:30,364 INFO L226 Difference]: Without dead ends: 8129 [2018-10-25 00:18:30,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:18:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-10-25 00:18:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-10-25 00:18:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-10-25 00:18:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-10-25 00:18:30,740 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 220 [2018-10-25 00:18:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:30,740 INFO L481 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-10-25 00:18:30,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:18:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-10-25 00:18:30,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-25 00:18:30,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:30,777 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:30,777 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:30,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash -314712711, now seen corresponding path program 1 times [2018-10-25 00:18:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:30,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:30,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:31,040 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:18:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:18:31,401 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:31,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:18:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:18:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:18:31,402 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-10-25 00:18:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:34,259 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-10-25 00:18:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:18:34,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2018-10-25 00:18:34,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:34,356 INFO L225 Difference]: With dead ends: 22960 [2018-10-25 00:18:34,356 INFO L226 Difference]: Without dead ends: 15024 [2018-10-25 00:18:34,390 INFO L605 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-10-25 00:18:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-10-25 00:18:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-10-25 00:18:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-10-25 00:18:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-10-25 00:18:34,929 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 225 [2018-10-25 00:18:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:34,929 INFO L481 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-10-25 00:18:34,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:18:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-10-25 00:18:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-25 00:18:34,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:34,996 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:34,996 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:34,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 732116718, now seen corresponding path program 1 times [2018-10-25 00:18:34,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:35,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:35,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:35,596 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-25 00:18:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-25 00:18:35,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:18:35,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:18:35,835 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:35,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:18:35,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:18:35,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:18:35,836 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 6 states. [2018-10-25 00:18:40,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:18:40,749 INFO L93 Difference]: Finished difference Result 31818 states and 52440 transitions. [2018-10-25 00:18:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-25 00:18:40,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2018-10-25 00:18:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:18:40,829 INFO L225 Difference]: With dead ends: 31818 [2018-10-25 00:18:40,830 INFO L226 Difference]: Without dead ends: 16918 [2018-10-25 00:18:40,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:18:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2018-10-25 00:18:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 16916. [2018-10-25 00:18:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16916 states. [2018-10-25 00:18:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16916 states to 16916 states and 26691 transitions. [2018-10-25 00:18:41,307 INFO L78 Accepts]: Start accepts. Automaton has 16916 states and 26691 transitions. Word has length 249 [2018-10-25 00:18:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:18:41,308 INFO L481 AbstractCegarLoop]: Abstraction has 16916 states and 26691 transitions. [2018-10-25 00:18:41,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:18:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16916 states and 26691 transitions. [2018-10-25 00:18:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-25 00:18:41,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:18:41,389 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:18:41,389 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:18:41,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash 646437938, now seen corresponding path program 1 times [2018-10-25 00:18:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:18:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:41,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:18:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:18:41,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:18:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:18:42,284 WARN L179 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 11 [2018-10-25 00:18:42,561 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-25 00:18:43,051 WARN L179 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-25 00:18:43,245 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-25 00:18:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:18:43,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:18:43,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:18:43,436 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 281 with the following transitions: [2018-10-25 00:18:43,438 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:18:43,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:18:43,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:18:44,614 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:18:44,616 INFO L272 AbstractInterpreter]: Visited 201 different actions 201 times. Never merged. Never widened. Never found a fixpoint. Largest state had 88 variables. [2018-10-25 00:18:44,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:18:44,648 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:18:46,302 INFO L232 lantSequenceWeakener]: Weakened 274 states. On average, predicates are now at 73.46% of their original sizes. [2018-10-25 00:18:46,302 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:18:46,935 INFO L413 sIntCurrentIteration]: We have 279 unified AI predicates [2018-10-25 00:18:46,939 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:18:46,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:18:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-10-25 00:18:46,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:18:46,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:18:46,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:18:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:18:46,942 INFO L87 Difference]: Start difference. First operand 16916 states and 26691 transitions. Second operand 11 states. [2018-10-25 00:19:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:19:51,569 INFO L93 Difference]: Finished difference Result 34036 states and 53646 transitions. [2018-10-25 00:19:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:19:51,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 280 [2018-10-25 00:19:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:19:51,642 INFO L225 Difference]: With dead ends: 34036 [2018-10-25 00:19:51,642 INFO L226 Difference]: Without dead ends: 17126 [2018-10-25 00:19:51,685 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 280 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:19:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17126 states. [2018-10-25 00:19:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17126 to 17124. [2018-10-25 00:19:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17124 states. [2018-10-25 00:19:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 26909 transitions. [2018-10-25 00:19:52,168 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 26909 transitions. Word has length 280 [2018-10-25 00:19:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:19:52,168 INFO L481 AbstractCegarLoop]: Abstraction has 17124 states and 26909 transitions. [2018-10-25 00:19:52,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:19:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 26909 transitions. [2018-10-25 00:19:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-25 00:19:52,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:19:52,212 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:19:52,213 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:19:52,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:19:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 277054773, now seen corresponding path program 1 times [2018-10-25 00:19:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:19:52,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:19:52,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:19:52,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:19:52,215 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:19:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:19:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:19:53,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:19:53,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:19:53,138 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 293 with the following transitions: [2018-10-25 00:19:53,139 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [334], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:19:53,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:19:53,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:19:54,292 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:19:54,293 INFO L272 AbstractInterpreter]: Visited 205 different actions 404 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:19:54,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:19:54,303 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:19:56,311 INFO L232 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 73.36% of their original sizes. [2018-10-25 00:19:56,311 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:19:56,613 INFO L413 sIntCurrentIteration]: We have 291 unified AI predicates [2018-10-25 00:19:56,614 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:19:56,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:19:56,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2018-10-25 00:19:56,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:19:56,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 00:19:56,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 00:19:56,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:19:56,616 INFO L87 Difference]: Start difference. First operand 17124 states and 26909 transitions. Second operand 18 states. [2018-10-25 00:21:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:21:00,576 INFO L93 Difference]: Finished difference Result 34248 states and 53886 transitions. [2018-10-25 00:21:00,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:21:00,576 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 292 [2018-10-25 00:21:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:21:00,645 INFO L225 Difference]: With dead ends: 34248 [2018-10-25 00:21:00,645 INFO L226 Difference]: Without dead ends: 17338 [2018-10-25 00:21:00,678 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 300 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2018-10-25 00:21:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17338 states. [2018-10-25 00:21:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17338 to 17335. [2018-10-25 00:21:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17335 states. [2018-10-25 00:21:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17335 states to 17335 states and 27138 transitions. [2018-10-25 00:21:01,315 INFO L78 Accepts]: Start accepts. Automaton has 17335 states and 27138 transitions. Word has length 292 [2018-10-25 00:21:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:21:01,316 INFO L481 AbstractCegarLoop]: Abstraction has 17335 states and 27138 transitions. [2018-10-25 00:21:01,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 00:21:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17335 states and 27138 transitions. [2018-10-25 00:21:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-25 00:21:01,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:21:01,353 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-25 00:21:01,354 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:21:01,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 281948138, now seen corresponding path program 1 times [2018-10-25 00:21:01,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:21:01,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:01,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:01,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:21:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:21:01,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:21:01,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:21:01,743 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:21:01,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:21:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:21:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:21:01,745 INFO L87 Difference]: Start difference. First operand 17335 states and 27138 transitions. Second operand 3 states. [2018-10-25 00:21:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:21:03,723 INFO L93 Difference]: Finished difference Result 45790 states and 74195 transitions. [2018-10-25 00:21:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:21:03,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2018-10-25 00:21:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:21:03,843 INFO L225 Difference]: With dead ends: 45790 [2018-10-25 00:21:03,843 INFO L226 Difference]: Without dead ends: 28880 [2018-10-25 00:21:03,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:21:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28880 states. [2018-10-25 00:21:04,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28880 to 28761. [2018-10-25 00:21:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28761 states. [2018-10-25 00:21:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28761 states to 28761 states and 43456 transitions. [2018-10-25 00:21:04,467 INFO L78 Accepts]: Start accepts. Automaton has 28761 states and 43456 transitions. Word has length 308 [2018-10-25 00:21:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:21:04,468 INFO L481 AbstractCegarLoop]: Abstraction has 28761 states and 43456 transitions. [2018-10-25 00:21:04,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:21:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 28761 states and 43456 transitions. [2018-10-25 00:21:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-25 00:21:04,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:21:04,531 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:21:04,531 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:21:04,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2134481765, now seen corresponding path program 1 times [2018-10-25 00:21:04,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:21:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:04,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:04,533 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:21:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:21:05,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:21:05,184 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:21:05,184 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 331 with the following transitions: [2018-10-25 00:21:05,185 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [95], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:21:05,196 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:21:05,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:21:11,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:21:11,302 INFO L272 AbstractInterpreter]: Visited 206 different actions 615 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:21:11,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:11,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:21:11,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:21:11,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:21:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:11,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:21:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:11,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:21:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:21:11,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:21:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:21:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:21:12,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-10-25 00:21:12,261 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:21:12,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:21:12,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:21:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:21:12,262 INFO L87 Difference]: Start difference. First operand 28761 states and 43456 transitions. Second operand 7 states. [2018-10-25 00:21:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:21:18,552 INFO L93 Difference]: Finished difference Result 97842 states and 164040 transitions. [2018-10-25 00:21:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:21:18,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 330 [2018-10-25 00:21:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:21:19,069 INFO L225 Difference]: With dead ends: 97842 [2018-10-25 00:21:19,069 INFO L226 Difference]: Without dead ends: 69506 [2018-10-25 00:21:19,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 659 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:21:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69506 states. [2018-10-25 00:21:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69506 to 68166. [2018-10-25 00:21:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68166 states. [2018-10-25 00:21:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68166 states to 68166 states and 98765 transitions. [2018-10-25 00:21:22,181 INFO L78 Accepts]: Start accepts. Automaton has 68166 states and 98765 transitions. Word has length 330 [2018-10-25 00:21:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:21:22,181 INFO L481 AbstractCegarLoop]: Abstraction has 68166 states and 98765 transitions. [2018-10-25 00:21:22,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:21:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 68166 states and 98765 transitions. [2018-10-25 00:21:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-25 00:21:22,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:21:22,328 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:21:22,328 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:21:22,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:22,329 INFO L82 PathProgramCache]: Analyzing trace with hash 877879966, now seen corresponding path program 1 times [2018-10-25 00:21:22,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:21:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:22,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:22,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:22,330 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:21:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 170 proven. 63 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-25 00:21:22,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:21:22,980 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:21:22,980 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 336 with the following transitions: [2018-10-25 00:21:22,981 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [64], [65], [68], [73], [75], [76], [80], [84], [88], [92], [95], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [240], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:21:22,988 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:21:22,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:21:30,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:21:30,489 INFO L272 AbstractInterpreter]: Visited 208 different actions 619 times. Merged at 8 different actions 19 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 88 variables. [2018-10-25 00:21:30,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:30,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:21:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:21:30,494 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-25 00:21:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:30,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:21:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:30,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:21:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-25 00:21:31,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:21:31,319 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 00:21:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 197 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-25 00:21:31,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:21:31,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-25 00:21:31,679 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:21:31,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:21:31,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:21:31,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:21:31,681 INFO L87 Difference]: Start difference. First operand 68166 states and 98765 transitions. Second operand 9 states. [2018-10-25 00:21:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:21:35,921 INFO L93 Difference]: Finished difference Result 137600 states and 209268 transitions. [2018-10-25 00:21:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-25 00:21:35,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2018-10-25 00:21:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:21:36,288 INFO L225 Difference]: With dead ends: 137600 [2018-10-25 00:21:36,289 INFO L226 Difference]: Without dead ends: 69648 [2018-10-25 00:21:36,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 672 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:21:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69648 states. [2018-10-25 00:21:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69648 to 68049. [2018-10-25 00:21:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68049 states. [2018-10-25 00:21:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68049 states to 68049 states and 91664 transitions. [2018-10-25 00:21:38,399 INFO L78 Accepts]: Start accepts. Automaton has 68049 states and 91664 transitions. Word has length 335 [2018-10-25 00:21:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:21:38,400 INFO L481 AbstractCegarLoop]: Abstraction has 68049 states and 91664 transitions. [2018-10-25 00:21:38,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:21:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 68049 states and 91664 transitions. [2018-10-25 00:21:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-25 00:21:38,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:21:38,470 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:21:38,470 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:21:38,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1731816398, now seen corresponding path program 1 times [2018-10-25 00:21:38,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:21:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:21:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:21:38,472 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:21:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:21:38,867 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:21:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 146 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:21:39,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:21:39,033 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:21:39,033 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-10-25 00:21:39,034 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [53], [57], [61], [65], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [190], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [379], [383], [394], [398], [402], [406], [417], [421], [425], [429], [433], [436], [437], [441], [445], [449], [453], [457], [461], [472], [476], [480], [484], [488], [492], [496], [500], [504], [508], [512], [516], [520], [524], [528], [532], [536], [540], [551], [555], [559], [570], [574], [585], [589], [593], [597], [601], [605], [609], [613], [624], [635], [646], [650], [654], [658], [662], [666], [673], [681], [689], [697], [705], [713], [721], [729], [737], [745], [753], [761], [769], [777], [785], [793], [801], [809], [817], [825], [833], [841], [849], [857], [865], [873], [881], [889], [897], [905], [913], [921], [929], [937], [945], [953], [961], [969], [977], [985], [993], [1001], [1009], [1017], [1025], [1033], [1041], [1049], [1057], [1065], [1069], [1071], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-10-25 00:21:39,039 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:21:39,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:21:40,281 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:21:40,281 INFO L272 AbstractInterpreter]: Visited 205 different actions 404 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-10-25 00:21:40,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:21:40,288 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:21:44,449 INFO L232 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 88.08% of their original sizes. [2018-10-25 00:21:44,450 INFO L411 sIntCurrentIteration]: Unifying AI predicates Received shutdown request... [2018-10-25 00:21:48,597 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-25 00:21:48,602 WARN L205 ceAbstractionStarter]: Timeout [2018-10-25 00:21:48,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:21:48 BoogieIcfgContainer [2018-10-25 00:21:48,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:21:48,604 INFO L168 Benchmark]: Toolchain (without parser) took 223150.53 ms. Allocated memory was 1.5 GB in the beginning and 4.8 GB in the end (delta: 3.2 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 490.9 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,605 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:21:48,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1138.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,607 INFO L168 Benchmark]: Boogie Preprocessor took 127.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,608 INFO L168 Benchmark]: RCFGBuilder took 4726.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 249.7 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,609 INFO L168 Benchmark]: TraceAbstraction took 216848.72 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 260.5 MB. Max. memory is 7.1 GB. [2018-10-25 00:21:48,614 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.18 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 1138.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 304.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -877.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4726.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 249.7 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 216848.72 ms. Allocated memory was 2.3 GB in the beginning and 4.8 GB in the end (delta: 2.5 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 260.5 MB. 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 BasicCegarLoop was analyzing trace of length 353 with TraceHistMax 3,while AbsIntCurrentIteration was generating AI predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 9 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 216.7s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 165.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2337 SDtfs, 12160 SDslu, 3167 SDs, 0 SdLazy, 21595 SolverSat, 2824 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 126.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 2002 GetRequests, 1897 SyntacticMatches, 11 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68166occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 17.2s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.9993783191998098 AbsIntWeakeningRatio, 0.19218241042345277 AbsIntAvgWeakeningVarsNumRemoved, 19.03800217155266 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 3755 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 3742 NumberOfCodeBlocks, 3742 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4391 ConstructedInterpolants, 0 QuantifiedInterpolants, 4518550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2613 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 1464/1624 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown