java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:14:36,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:14:36,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:14:36,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:14:36,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:14:36,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:14:36,996 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:14:36,998 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:14:37,000 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:14:37,001 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:14:37,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:14:37,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:14:37,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:14:37,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:14:37,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:14:37,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:14:37,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:14:37,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:14:37,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:14:37,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:14:37,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:14:37,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:14:37,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:14:37,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:14:37,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:14:37,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:14:37,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:14:37,022 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:14:37,023 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:14:37,024 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:14:37,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:14:37,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:14:37,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:14:37,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:14:37,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:14:37,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:14:37,033 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:14:37,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:14:37,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:14:37,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:14:37,063 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:14:37,064 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:14:37,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:14:37,064 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:14:37,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:14:37,065 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:14:37,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:14:37,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:14:37,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:14:37,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:14:37,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:14:37,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:14:37,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:14:37,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:14:37,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:14:37,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:14:37,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:14:37,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:14:37,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:14:37,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:14:37,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:14:37,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:14:37,071 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:14:37,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:14:37,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:14:37,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:14:37,072 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:14:37,072 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:14:37,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:14:37,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:14:37,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:14:37,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:14:37,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:14:37,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-11-07 07:14:37,219 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54447982/b41e63d2ddb843f6aa8e4fb3d9a4a22b/FLAG3efbe3c15 [2018-11-07 07:14:37,927 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:14:37,930 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label25_true-unreach-call.c [2018-11-07 07:14:37,951 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54447982/b41e63d2ddb843f6aa8e4fb3d9a4a22b/FLAG3efbe3c15 [2018-11-07 07:14:37,967 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b54447982/b41e63d2ddb843f6aa8e4fb3d9a4a22b [2018-11-07 07:14:37,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:14:37,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:14:37,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:14:37,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:14:37,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:14:37,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:37" (1/1) ... [2018-11-07 07:14:37,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b7d3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:37, skipping insertion in model container [2018-11-07 07:14:37,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:14:37" (1/1) ... [2018-11-07 07:14:38,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:14:38,125 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:14:38,888 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:14:38,894 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:14:39,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:14:39,185 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:14:39,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39 WrapperNode [2018-11-07 07:14:39,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:14:39,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:14:39,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:14:39,188 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:14:39,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:14:39,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:14:39,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:14:39,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:14:39,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... [2018-11-07 07:14:39,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:14:39,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:14:39,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:14:39,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:14:39,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:14:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:14:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:14:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:14:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:14:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:14:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:14:39,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:14:39,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:14:39,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:14:44,512 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:14:44,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:44 BoogieIcfgContainer [2018-11-07 07:14:44,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:14:44,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:14:44,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:14:44,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:14:44,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:14:37" (1/3) ... [2018-11-07 07:14:44,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3c39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:44, skipping insertion in model container [2018-11-07 07:14:44,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:14:39" (2/3) ... [2018-11-07 07:14:44,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f3c39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:14:44, skipping insertion in model container [2018-11-07 07:14:44,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:14:44" (3/3) ... [2018-11-07 07:14:44,522 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label25_true-unreach-call.c [2018-11-07 07:14:44,532 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:14:44,542 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:14:44,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:14:44,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:14:44,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:14:44,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:14:44,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:14:44,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:14:44,604 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:14:44,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:14:44,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:14:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2018-11-07 07:14:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-07 07:14:44,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:14:44,667 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] [2018-11-07 07:14:44,670 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:14:44,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:14:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1441765812, now seen corresponding path program 1 times [2018-11-07 07:14:44,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:14:44,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:44,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:14:44,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:44,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:14:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:14:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:14:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:14:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 07:14:45,925 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:14:45,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 07:14:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 07:14:45,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 07:14:45,955 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 4 states. [2018-11-07 07:14:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:14:49,429 INFO L93 Difference]: Finished difference Result 1066 states and 1924 transitions. [2018-11-07 07:14:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:14:49,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-07 07:14:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:14:49,458 INFO L225 Difference]: With dead ends: 1066 [2018-11-07 07:14:49,458 INFO L226 Difference]: Without dead ends: 748 [2018-11-07 07:14:49,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 07:14:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-07 07:14:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 527. [2018-11-07 07:14:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-11-07 07:14:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 902 transitions. [2018-11-07 07:14:49,556 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 902 transitions. Word has length 187 [2018-11-07 07:14:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:14:49,557 INFO L480 AbstractCegarLoop]: Abstraction has 527 states and 902 transitions. [2018-11-07 07:14:49,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 07:14:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 902 transitions. [2018-11-07 07:14:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-07 07:14:49,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:14:49,567 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] [2018-11-07 07:14:49,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:14:49,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:14:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 730517125, now seen corresponding path program 1 times [2018-11-07 07:14:49,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:14:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:49,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:14:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:49,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:14:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:14:49,899 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 07:14:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:14:50,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:14:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:14:50,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:14:50,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:14:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:14:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:14:50,091 INFO L87 Difference]: Start difference. First operand 527 states and 902 transitions. Second operand 6 states. [2018-11-07 07:14:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:14:53,177 INFO L93 Difference]: Finished difference Result 1590 states and 2793 transitions. [2018-11-07 07:14:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 07:14:53,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-11-07 07:14:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:14:53,189 INFO L225 Difference]: With dead ends: 1590 [2018-11-07 07:14:53,189 INFO L226 Difference]: Without dead ends: 1069 [2018-11-07 07:14:53,195 INFO L604 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-11-07 07:14:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2018-11-07 07:14:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1024. [2018-11-07 07:14:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-11-07 07:14:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1746 transitions. [2018-11-07 07:14:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1746 transitions. Word has length 197 [2018-11-07 07:14:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:14:53,263 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1746 transitions. [2018-11-07 07:14:53,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:14:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1746 transitions. [2018-11-07 07:14:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-07 07:14:53,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:14:53,270 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] [2018-11-07 07:14:53,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:14:53,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:14:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1518817149, now seen corresponding path program 1 times [2018-11-07 07:14:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:14:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:53,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:14:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:53,272 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:14:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:14:53,539 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:14:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:14:53,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:14:53,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 07:14:53,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:14:53,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 07:14:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 07:14:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 07:14:53,785 INFO L87 Difference]: Start difference. First operand 1024 states and 1746 transitions. Second operand 5 states. [2018-11-07 07:14:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:14:56,759 INFO L93 Difference]: Finished difference Result 3166 states and 5674 transitions. [2018-11-07 07:14:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:14:56,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 198 [2018-11-07 07:14:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:14:56,787 INFO L225 Difference]: With dead ends: 3166 [2018-11-07 07:14:56,787 INFO L226 Difference]: Without dead ends: 2148 [2018-11-07 07:14:56,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:14:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2018-11-07 07:14:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2105. [2018-11-07 07:14:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-07 07:14:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 3422 transitions. [2018-11-07 07:14:56,889 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 3422 transitions. Word has length 198 [2018-11-07 07:14:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:14:56,889 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 3422 transitions. [2018-11-07 07:14:56,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 07:14:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 3422 transitions. [2018-11-07 07:14:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-07 07:14:56,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:14:56,900 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] [2018-11-07 07:14:56,900 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:14:56,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:14:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1899321928, now seen corresponding path program 1 times [2018-11-07 07:14:56,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:14:56,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:56,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:14:56,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:14:56,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:14:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:14:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:14:57,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:14:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:14:57,280 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:14:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:14:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:14:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:14:57,282 INFO L87 Difference]: Start difference. First operand 2105 states and 3422 transitions. Second operand 3 states. [2018-11-07 07:14:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:14:59,819 INFO L93 Difference]: Finished difference Result 6108 states and 10330 transitions. [2018-11-07 07:14:59,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:14:59,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2018-11-07 07:14:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:14:59,847 INFO L225 Difference]: With dead ends: 6108 [2018-11-07 07:14:59,848 INFO L226 Difference]: Without dead ends: 4009 [2018-11-07 07:14:59,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:14:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2018-11-07 07:14:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3973. [2018-11-07 07:14:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2018-11-07 07:14:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 6514 transitions. [2018-11-07 07:14:59,984 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 6514 transitions. Word has length 200 [2018-11-07 07:14:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:14:59,985 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 6514 transitions. [2018-11-07 07:14:59,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:14:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 6514 transitions. [2018-11-07 07:14:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-07 07:14:59,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:14:59,999 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] [2018-11-07 07:14:59,999 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:14:59,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:15:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash 709935156, now seen corresponding path program 1 times [2018-11-07 07:15:00,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:15:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:00,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:15:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:00,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:15:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:15:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:15:00,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:15:00,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 07:15:00,242 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:15:00,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 07:15:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 07:15:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:15:00,243 INFO L87 Difference]: Start difference. First operand 3973 states and 6514 transitions. Second operand 7 states. [2018-11-07 07:15:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:15:02,277 INFO L93 Difference]: Finished difference Result 12096 states and 22014 transitions. [2018-11-07 07:15:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:15:02,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 206 [2018-11-07 07:15:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:15:02,348 INFO L225 Difference]: With dead ends: 12096 [2018-11-07 07:15:02,348 INFO L226 Difference]: Without dead ends: 8129 [2018-11-07 07:15:02,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:15:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-07 07:15:02,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 7942. [2018-11-07 07:15:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2018-11-07 07:15:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 13503 transitions. [2018-11-07 07:15:02,690 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 13503 transitions. Word has length 206 [2018-11-07 07:15:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:15:02,690 INFO L480 AbstractCegarLoop]: Abstraction has 7942 states and 13503 transitions. [2018-11-07 07:15:02,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 07:15:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 13503 transitions. [2018-11-07 07:15:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-07 07:15:02,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:15:02,727 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] [2018-11-07 07:15:02,727 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:15:02,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:15:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1045586271, now seen corresponding path program 1 times [2018-11-07 07:15:02,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:15:02,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:15:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:02,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:15:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:15:03,010 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:15:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:15:03,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:15:03,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:15:03,413 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:15:03,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:15:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:15:03,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:15:03,414 INFO L87 Difference]: Start difference. First operand 7942 states and 13503 transitions. Second operand 6 states. [2018-11-07 07:15:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:15:05,975 INFO L93 Difference]: Finished difference Result 22960 states and 42530 transitions. [2018-11-07 07:15:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:15:05,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2018-11-07 07:15:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:15:06,089 INFO L225 Difference]: With dead ends: 22960 [2018-11-07 07:15:06,089 INFO L226 Difference]: Without dead ends: 15024 [2018-11-07 07:15:06,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:15:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2018-11-07 07:15:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14866. [2018-11-07 07:15:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2018-11-07 07:15:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 24364 transitions. [2018-11-07 07:15:06,619 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 24364 transitions. Word has length 211 [2018-11-07 07:15:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:15:06,619 INFO L480 AbstractCegarLoop]: Abstraction has 14866 states and 24364 transitions. [2018-11-07 07:15:06,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:15:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 24364 transitions. [2018-11-07 07:15:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-07 07:15:06,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:15:06,674 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] [2018-11-07 07:15:06,675 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:15:06,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:15:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1142196010, now seen corresponding path program 1 times [2018-11-07 07:15:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:15:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:06,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:15:06,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:06,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:15:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:15:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 07:15:07,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:15:07,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:15:07,038 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:15:07,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:15:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:15:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:15:07,040 INFO L87 Difference]: Start difference. First operand 14866 states and 24364 transitions. Second operand 3 states. [2018-11-07 07:15:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:15:11,399 INFO L93 Difference]: Finished difference Result 41273 states and 69018 transitions. [2018-11-07 07:15:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:15:11,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-07 07:15:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:15:11,531 INFO L225 Difference]: With dead ends: 41273 [2018-11-07 07:15:11,531 INFO L226 Difference]: Without dead ends: 26413 [2018-11-07 07:15:11,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:15:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26413 states. [2018-11-07 07:15:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26413 to 26410. [2018-11-07 07:15:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26410 states. [2018-11-07 07:15:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26410 states to 26410 states and 41323 transitions. [2018-11-07 07:15:12,588 INFO L78 Accepts]: Start accepts. Automaton has 26410 states and 41323 transitions. Word has length 235 [2018-11-07 07:15:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:15:12,590 INFO L480 AbstractCegarLoop]: Abstraction has 26410 states and 41323 transitions. [2018-11-07 07:15:12,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:15:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 26410 states and 41323 transitions. [2018-11-07 07:15:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 07:15:12,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:15:12,681 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 07:15:12,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:15:12,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:15:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1569214991, now seen corresponding path program 1 times [2018-11-07 07:15:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:15:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:15:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:15:12,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:15:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:15:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 80 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 07:15:13,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:15:13,154 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:15:13,155 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 07:15:13,158 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [64], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:15:13,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:15:13,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:15:15,185 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:15:15,187 INFO L272 AbstractInterpreter]: Visited 192 different actions 377 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 07:15:15,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:15:15,233 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:15:16,414 INFO L227 lantSequenceWeakener]: Weakened 248 states. On average, predicates are now at 75.51% of their original sizes. [2018-11-07 07:15:16,414 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:15:17,671 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 07:15:17,673 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:15:17,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:15:17,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 07:15:17,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:15:17,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 07:15:17,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 07:15:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2018-11-07 07:15:17,676 INFO L87 Difference]: Start difference. First operand 26410 states and 41323 transitions. Second operand 17 states. [2018-11-07 07:16:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:16:01,703 INFO L93 Difference]: Finished difference Result 64052 states and 100248 transitions. [2018-11-07 07:16:01,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 07:16:01,704 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 253 [2018-11-07 07:16:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:16:01,863 INFO L225 Difference]: With dead ends: 64052 [2018-11-07 07:16:01,863 INFO L226 Difference]: Without dead ends: 37648 [2018-11-07 07:16:01,945 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-11-07 07:16:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37648 states. [2018-11-07 07:16:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37648 to 37636. [2018-11-07 07:16:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37636 states. [2018-11-07 07:16:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37636 states to 37636 states and 56777 transitions. [2018-11-07 07:16:03,300 INFO L78 Accepts]: Start accepts. Automaton has 37636 states and 56777 transitions. Word has length 253 [2018-11-07 07:16:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:16:03,300 INFO L480 AbstractCegarLoop]: Abstraction has 37636 states and 56777 transitions. [2018-11-07 07:16:03,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 07:16:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 37636 states and 56777 transitions. [2018-11-07 07:16:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 07:16:03,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:16:03,387 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:16:03,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:16:03,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:03,388 INFO L82 PathProgramCache]: Analyzing trace with hash 94695274, now seen corresponding path program 1 times [2018-11-07 07:16:03,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:16:03,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:03,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:03,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:03,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:16:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 124 proven. 18 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-07 07:16:03,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:03,955 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:16:03,956 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-11-07 07:16:03,956 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [29], [33], [37], [41], [45], [49], [52], [53], [57], [61], [65], [68], [71], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [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], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:16:03,973 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:16:03,974 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:16:05,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:16:05,079 INFO L272 AbstractInterpreter]: Visited 194 different actions 579 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-07 07:16:05,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:05,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:16:05,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:05,088 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:16:05,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:05,097 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:16:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:05,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:16:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 07:16:05,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:16:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-07 07:16:06,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:16:06,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 07:16:06,487 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:16:06,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:16:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:16:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:16:06,489 INFO L87 Difference]: Start difference. First operand 37636 states and 56777 transitions. Second operand 9 states. [2018-11-07 07:16:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:16:11,780 INFO L93 Difference]: Finished difference Result 107597 states and 161651 transitions. [2018-11-07 07:16:11,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 07:16:11,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 279 [2018-11-07 07:16:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:16:12,110 INFO L225 Difference]: With dead ends: 107597 [2018-11-07 07:16:12,110 INFO L226 Difference]: Without dead ends: 70596 [2018-11-07 07:16:12,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 554 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:16:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70596 states. [2018-11-07 07:16:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70596 to 70566. [2018-11-07 07:16:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70566 states. [2018-11-07 07:16:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70566 states to 70566 states and 101086 transitions. [2018-11-07 07:16:14,917 INFO L78 Accepts]: Start accepts. Automaton has 70566 states and 101086 transitions. Word has length 279 [2018-11-07 07:16:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:16:14,917 INFO L480 AbstractCegarLoop]: Abstraction has 70566 states and 101086 transitions. [2018-11-07 07:16:14,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:16:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 70566 states and 101086 transitions. [2018-11-07 07:16:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-07 07:16:15,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:16:15,050 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] [2018-11-07 07:16:15,051 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:16:15,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash 761764562, now seen corresponding path program 1 times [2018-11-07 07:16:15,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:16:15,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:15,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:15,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:16:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:16:15,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:16:15,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 07:16:15,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:16:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 07:16:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 07:16:15,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 07:16:15,765 INFO L87 Difference]: Start difference. First operand 70566 states and 101086 transitions. Second operand 4 states. [2018-11-07 07:16:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:16:19,871 INFO L93 Difference]: Finished difference Result 172594 states and 247223 transitions. [2018-11-07 07:16:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 07:16:19,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-11-07 07:16:19,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:16:20,294 INFO L225 Difference]: With dead ends: 172594 [2018-11-07 07:16:20,294 INFO L226 Difference]: Without dead ends: 102663 [2018-11-07 07:16:20,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 07:16:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102663 states. [2018-11-07 07:16:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102663 to 100296. [2018-11-07 07:16:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100296 states. [2018-11-07 07:16:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100296 states to 100296 states and 139206 transitions. [2018-11-07 07:16:24,168 INFO L78 Accepts]: Start accepts. Automaton has 100296 states and 139206 transitions. Word has length 294 [2018-11-07 07:16:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:16:24,169 INFO L480 AbstractCegarLoop]: Abstraction has 100296 states and 139206 transitions. [2018-11-07 07:16:24,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 07:16:24,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100296 states and 139206 transitions. [2018-11-07 07:16:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-07 07:16:24,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:16:24,263 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 07:16:24,263 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:16:24,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash 197204448, now seen corresponding path program 1 times [2018-11-07 07:16:24,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:16:24,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:24,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:24,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:16:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:24,939 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 07:16:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 07:16:25,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:25,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:16:25,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2018-11-07 07:16:25,141 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [28], [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], [335], [339], [343], [347], [351], [355], [359], [363], [367], [371], [375], [378], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:16:25,147 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:16:25,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:16:26,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:16:26,806 INFO L272 AbstractInterpreter]: Visited 193 different actions 573 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 88 variables. [2018-11-07 07:16:26,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:26,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:16:26,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:26,844 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:16:26,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:26,861 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:16:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:27,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:16:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-07 07:16:27,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:16:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-07 07:16:27,351 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:16:27,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 8 [2018-11-07 07:16:27,351 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:16:27,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:16:27,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:16:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:16:27,353 INFO L87 Difference]: Start difference. First operand 100296 states and 139206 transitions. Second operand 3 states. [2018-11-07 07:16:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:16:30,438 INFO L93 Difference]: Finished difference Result 194508 states and 270351 transitions. [2018-11-07 07:16:30,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:16:30,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2018-11-07 07:16:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:16:30,754 INFO L225 Difference]: With dead ends: 194508 [2018-11-07 07:16:30,755 INFO L226 Difference]: Without dead ends: 94426 [2018-11-07 07:16:30,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 07:16:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94426 states. [2018-11-07 07:16:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94426 to 90800. [2018-11-07 07:16:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90800 states. [2018-11-07 07:16:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90800 states to 90800 states and 117444 transitions. [2018-11-07 07:16:32,812 INFO L78 Accepts]: Start accepts. Automaton has 90800 states and 117444 transitions. Word has length 302 [2018-11-07 07:16:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:16:32,813 INFO L480 AbstractCegarLoop]: Abstraction has 90800 states and 117444 transitions. [2018-11-07 07:16:32,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:16:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 90800 states and 117444 transitions. [2018-11-07 07:16:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-07 07:16:32,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:16:32,952 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:16:32,953 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:16:32,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:32,953 INFO L82 PathProgramCache]: Analyzing trace with hash 931388912, now seen corresponding path program 1 times [2018-11-07 07:16:32,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:16:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:32,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:32,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:32,954 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:16:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 192 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-07 07:16:33,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:33,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:16:33,375 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-11-07 07:16:33,375 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [25], [29], [33], [37], [41], [44], [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], [256], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:16:33,381 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:16:33,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:16:34,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:16:34,143 INFO L272 AbstractInterpreter]: Visited 192 different actions 378 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 07:16:34,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:34,179 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:16:36,114 INFO L227 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 73.33% of their original sizes. [2018-11-07 07:16:36,114 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:16:36,578 INFO L415 sIntCurrentIteration]: We unified 367 AI predicates to 367 [2018-11-07 07:16:36,578 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:16:36,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:16:36,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [8] total 24 [2018-11-07 07:16:36,579 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:16:36,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 07:16:36,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 07:16:36,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-07 07:16:36,581 INFO L87 Difference]: Start difference. First operand 90800 states and 117444 transitions. Second operand 18 states. [2018-11-07 07:16:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:16:55,294 INFO L93 Difference]: Finished difference Result 189737 states and 245051 transitions. [2018-11-07 07:16:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 07:16:55,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 368 [2018-11-07 07:16:55,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:16:55,567 INFO L225 Difference]: With dead ends: 189737 [2018-11-07 07:16:55,568 INFO L226 Difference]: Without dead ends: 99153 [2018-11-07 07:16:56,109 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 375 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2018-11-07 07:16:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99153 states. [2018-11-07 07:16:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99153 to 99150. [2018-11-07 07:16:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99150 states. [2018-11-07 07:16:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99150 states to 99150 states and 126852 transitions. [2018-11-07 07:16:57,439 INFO L78 Accepts]: Start accepts. Automaton has 99150 states and 126852 transitions. Word has length 368 [2018-11-07 07:16:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:16:57,439 INFO L480 AbstractCegarLoop]: Abstraction has 99150 states and 126852 transitions. [2018-11-07 07:16:57,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 07:16:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 99150 states and 126852 transitions. [2018-11-07 07:16:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-07 07:16:57,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:16:57,553 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:16:57,553 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:16:57,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash -2013488484, now seen corresponding path program 1 times [2018-11-07 07:16:57,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:16:57,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:57,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:57,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:16:57,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:16:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:16:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 243 proven. 74 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-07 07:16:58,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:58,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:16:58,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 390 with the following transitions: [2018-11-07 07:16:58,035 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [13], [17], [21], [24], [25], [28], [29], [33], [37], [41], [44], [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], [256], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [323], [327], [331], [335], [338], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:16:58,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:16:58,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:16:59,830 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:16:59,831 INFO L272 AbstractInterpreter]: Visited 195 different actions 778 times. Merged at 8 different actions 33 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 4 different actions. Largest state had 88 variables. [2018-11-07 07:16:59,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:16:59,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:16:59,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:16:59,839 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 07:16:59,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:16:59,850 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:17:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:17:00,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:17:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 321 proven. 6 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 07:17:00,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:17:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 265 proven. 102 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-07 07:17:00,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:17:00,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 15 [2018-11-07 07:17:00,861 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:17:00,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 07:17:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 07:17:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-11-07 07:17:00,862 INFO L87 Difference]: Start difference. First operand 99150 states and 126852 transitions. Second operand 14 states. [2018-11-07 07:17:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:17:17,787 INFO L93 Difference]: Finished difference Result 464797 states and 651586 transitions. [2018-11-07 07:17:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 07:17:17,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 389 [2018-11-07 07:17:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:17:19,192 INFO L225 Difference]: With dead ends: 464797 [2018-11-07 07:17:19,192 INFO L226 Difference]: Without dead ends: 366071 [2018-11-07 07:17:19,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 841 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1332, Invalid=7224, Unknown=0, NotChecked=0, Total=8556 [2018-11-07 07:17:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366071 states. [2018-11-07 07:17:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366071 to 353797. [2018-11-07 07:17:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353797 states. [2018-11-07 07:17:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353797 states to 353797 states and 437827 transitions. [2018-11-07 07:17:27,730 INFO L78 Accepts]: Start accepts. Automaton has 353797 states and 437827 transitions. Word has length 389 [2018-11-07 07:17:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:17:27,730 INFO L480 AbstractCegarLoop]: Abstraction has 353797 states and 437827 transitions. [2018-11-07 07:17:27,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 07:17:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 353797 states and 437827 transitions. [2018-11-07 07:17:27,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-11-07 07:17:27,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:17:27,916 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:17:27,916 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:17:27,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:17:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1867506150, now seen corresponding path program 1 times [2018-11-07 07:17:27,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:17:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:17:27,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:17:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:17:27,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:17:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:17:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 270 proven. 217 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-07 07:17:28,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:17:28,504 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:17:28,505 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 430 with the following transitions: [2018-11-07 07:17:28,505 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [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], [139], [140], [144], [148], [159], [163], [167], [171], [175], [179], [183], [187], [191], [202], [206], [210], [221], [225], [229], [233], [237], [241], [245], [249], [253], [256], [257], [261], [265], [269], [273], [277], [281], [285], [289], [293], [297], [308], [312], [315], [320], [322], [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], [957], [959], [1157], [1161], [1165], [1171], [1175], [1177], [1182], [1183], [1184], [1186], [1187] [2018-11-07 07:17:28,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:17:28,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:17:30,156 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:17:30,156 INFO L272 AbstractInterpreter]: Visited 194 different actions 382 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 88 variables. [2018-11-07 07:17:30,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:17:30,162 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:17:31,189 INFO L227 lantSequenceWeakener]: Weakened 422 states. On average, predicates are now at 72.11% of their original sizes. [2018-11-07 07:17:31,190 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:17:31,853 INFO L415 sIntCurrentIteration]: We unified 428 AI predicates to 428 [2018-11-07 07:17:31,853 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:17:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:17:31,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [11] total 36 [2018-11-07 07:17:31,853 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:17:31,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 07:17:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 07:17:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2018-11-07 07:17:31,855 INFO L87 Difference]: Start difference. First operand 353797 states and 437827 transitions. Second operand 27 states. Received shutdown request... [2018-11-07 07:18:04,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 07:18:04,039 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 07:18:04,044 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 07:18:04,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:18:04 BoogieIcfgContainer [2018-11-07 07:18:04,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:18:04,046 INFO L168 Benchmark]: Toolchain (without parser) took 206066.81 ms. Allocated memory was 1.5 GB in the beginning and 5.3 GB in the end (delta: 3.8 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 07:18:04,047 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:18:04,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1204.40 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-11-07 07:18:04,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 212.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -848.3 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2018-11-07 07:18:04,049 INFO L168 Benchmark]: Boogie Preprocessor took 136.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:18:04,050 INFO L168 Benchmark]: RCFGBuilder took 4976.42 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: 272.3 MB). Peak memory consumption was 272.3 MB. Max. memory is 7.1 GB. [2018-11-07 07:18:04,050 INFO L168 Benchmark]: TraceAbstraction took 199530.99 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.1 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2018-11-07 07:18:04,056 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1204.40 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: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 212.05 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -848.3 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.71 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4976.42 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: 272.3 MB). Peak memory consumption was 272.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 199530.99 ms. Allocated memory was 2.3 GB in the beginning and 5.3 GB in the end (delta: 3.1 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1575]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1575). Cancelled while BasicCegarLoop was constructing difference of abstraction (353797states) and FLOYD_HOARE automaton (currently 12 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (33824 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 312 locations, 1 error locations. TIMEOUT Result, 199.4s OverallTime, 14 OverallIterations, 7 TraceHistogramMax, 150.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3102 SDtfs, 28694 SDslu, 3883 SDs, 0 SdLazy, 22258 SolverSat, 5453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 76.0s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3253 GetRequests, 3011 SyntacticMatches, 14 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3627 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353797occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.1s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9988716733255212 AbsIntWeakeningRatio, 0.23973256924546324 AbsIntAvgWeakeningVarsNumRemoved, 55.98758357211079 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 19005 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 4718 NumberOfCodeBlocks, 4718 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5668 ConstructedInterpolants, 0 QuantifiedInterpolants, 4254886 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4531 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 2994/3459 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown