java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:33,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:33,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:33,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:34,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:34,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:34,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:34,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:34,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:34,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:34,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:34,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:34,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:34,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:34,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:34,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:34,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:34,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:34,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:34,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:34,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:34,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:34,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:34,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:34,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:34,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:34,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:34,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:34,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:34,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:34,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:34,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:34,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:34,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:34,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:34,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:34,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:34,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:34,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:34,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:34,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:34,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:24:34,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:34,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:34,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:34,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:34,066 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:34,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:34,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:34,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:34,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:34,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:34,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:34,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:34,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:34,069 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:34,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:34,069 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:34,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:34,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:34,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:34,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:34,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:34,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:34,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:34,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:34,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:34,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:34,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:34,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:34,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:24:34,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:34,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:34,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:34,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:34,415 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:34,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:34,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564f7cfad/40aa1ecfaf3741d8a0daeb6e08c9335e/FLAGa20812bf9 [2019-10-13 21:24:34,970 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:34,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:34,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564f7cfad/40aa1ecfaf3741d8a0daeb6e08c9335e/FLAGa20812bf9 [2019-10-13 21:24:35,253 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564f7cfad/40aa1ecfaf3741d8a0daeb6e08c9335e [2019-10-13 21:24:35,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:35,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:35,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:35,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:35,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:35,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:35" (1/1) ... [2019-10-13 21:24:35,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794f87f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:35, skipping insertion in model container [2019-10-13 21:24:35,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:35" (1/1) ... [2019-10-13 21:24:35,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:35,337 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:35,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:35,850 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:35,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:36,010 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:36,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36 WrapperNode [2019-10-13 21:24:36,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:36,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:36,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:36,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:36,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (1/1) ... [2019-10-13 21:24:36,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:36,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:36,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:36,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:36,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (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 [2019-10-13 21:24:36,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:36,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:36,174 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:36,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:36,175 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:36,176 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:36,177 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:36,178 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:36,178 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:37,430 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:37,431 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:37,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:37 BoogieIcfgContainer [2019-10-13 21:24:37,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:37,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:37,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:37,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:37,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:35" (1/3) ... [2019-10-13 21:24:37,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f1d762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:37, skipping insertion in model container [2019-10-13 21:24:37,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:36" (2/3) ... [2019-10-13 21:24:37,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f1d762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:37, skipping insertion in model container [2019-10-13 21:24:37,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:37" (3/3) ... [2019-10-13 21:24:37,445 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 21:24:37,456 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:37,474 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-13 21:24:37,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-13 21:24:37,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:37,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:37,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:37,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:37,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:37,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:37,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:37,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-10-13 21:24:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 21:24:37,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,553 INFO L380 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] [2019-10-13 21:24:37,555 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash -907914047, now seen corresponding path program 1 times [2019-10-13 21:24:37,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337633633] [2019-10-13 21:24:37,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:38,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337633633] [2019-10-13 21:24:38,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:38,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87707849] [2019-10-13 21:24:38,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:38,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:38,382 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 4 states. [2019-10-13 21:24:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,614 INFO L93 Difference]: Finished difference Result 789 states and 1385 transitions. [2019-10-13 21:24:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:38,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 21:24:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,650 INFO L225 Difference]: With dead ends: 789 [2019-10-13 21:24:38,651 INFO L226 Difference]: Without dead ends: 519 [2019-10-13 21:24:38,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-13 21:24:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 496. [2019-10-13 21:24:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-13 21:24:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 722 transitions. [2019-10-13 21:24:38,761 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 722 transitions. Word has length 102 [2019-10-13 21:24:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:38,762 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 722 transitions. [2019-10-13 21:24:38,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 722 transitions. [2019-10-13 21:24:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:24:38,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:38,767 INFO L380 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] [2019-10-13 21:24:38,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:38,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1093362695, now seen corresponding path program 1 times [2019-10-13 21:24:38,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:38,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492719179] [2019-10-13 21:24:38,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:38,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:38,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492719179] [2019-10-13 21:24:38,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:38,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:38,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658613284] [2019-10-13 21:24:38,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:38,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:38,886 INFO L87 Difference]: Start difference. First operand 496 states and 722 transitions. Second operand 3 states. [2019-10-13 21:24:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,945 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2019-10-13 21:24:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:38,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-13 21:24:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,952 INFO L225 Difference]: With dead ends: 1442 [2019-10-13 21:24:38,953 INFO L226 Difference]: Without dead ends: 978 [2019-10-13 21:24:38,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-13 21:24:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 498. [2019-10-13 21:24:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-13 21:24:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 724 transitions. [2019-10-13 21:24:39,011 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 724 transitions. Word has length 103 [2019-10-13 21:24:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,013 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 724 transitions. [2019-10-13 21:24:39,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 724 transitions. [2019-10-13 21:24:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:39,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,025 INFO L380 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] [2019-10-13 21:24:39,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1521321784, now seen corresponding path program 1 times [2019-10-13 21:24:39,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643110456] [2019-10-13 21:24:39,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:39,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643110456] [2019-10-13 21:24:39,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:39,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278180944] [2019-10-13 21:24:39,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:39,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,150 INFO L87 Difference]: Start difference. First operand 498 states and 724 transitions. Second operand 3 states. [2019-10-13 21:24:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,215 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-13 21:24:39,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:39,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-13 21:24:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,221 INFO L225 Difference]: With dead ends: 1029 [2019-10-13 21:24:39,221 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 21:24:39,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 21:24:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 646. [2019-10-13 21:24:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-13 21:24:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2019-10-13 21:24:39,255 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 104 [2019-10-13 21:24:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,256 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2019-10-13 21:24:39,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2019-10-13 21:24:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:39,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,259 INFO L380 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] [2019-10-13 21:24:39,259 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash 60289518, now seen corresponding path program 1 times [2019-10-13 21:24:39,260 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778302208] [2019-10-13 21:24:39,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:39,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778302208] [2019-10-13 21:24:39,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:39,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443039563] [2019-10-13 21:24:39,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:39,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:39,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,441 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand 3 states. [2019-10-13 21:24:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,558 INFO L93 Difference]: Finished difference Result 1690 states and 2556 transitions. [2019-10-13 21:24:39,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:39,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-13 21:24:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,569 INFO L225 Difference]: With dead ends: 1690 [2019-10-13 21:24:39,569 INFO L226 Difference]: Without dead ends: 1241 [2019-10-13 21:24:39,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-10-13 21:24:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1220. [2019-10-13 21:24:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-10-13 21:24:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1820 transitions. [2019-10-13 21:24:39,670 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1820 transitions. Word has length 104 [2019-10-13 21:24:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,671 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1820 transitions. [2019-10-13 21:24:39,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1820 transitions. [2019-10-13 21:24:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:24:39,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,675 INFO L380 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] [2019-10-13 21:24:39,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1524807285, now seen corresponding path program 1 times [2019-10-13 21:24:39,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863369889] [2019-10-13 21:24:39,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:39,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863369889] [2019-10-13 21:24:39,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:39,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967125432] [2019-10-13 21:24:39,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:39,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:39,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:39,904 INFO L87 Difference]: Start difference. First operand 1220 states and 1820 transitions. Second operand 4 states. [2019-10-13 21:24:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:39,987 INFO L93 Difference]: Finished difference Result 1973 states and 2965 transitions. [2019-10-13 21:24:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:39,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 21:24:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:39,994 INFO L225 Difference]: With dead ends: 1973 [2019-10-13 21:24:39,994 INFO L226 Difference]: Without dead ends: 938 [2019-10-13 21:24:39,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-10-13 21:24:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-10-13 21:24:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-10-13 21:24:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1391 transitions. [2019-10-13 21:24:40,090 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1391 transitions. Word has length 104 [2019-10-13 21:24:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,090 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1391 transitions. [2019-10-13 21:24:40,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1391 transitions. [2019-10-13 21:24:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:24:40,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,092 INFO L380 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] [2019-10-13 21:24:40,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 431033542, now seen corresponding path program 1 times [2019-10-13 21:24:40,093 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792006960] [2019-10-13 21:24:40,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:40,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792006960] [2019-10-13 21:24:40,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:40,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:40,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228079081] [2019-10-13 21:24:40,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:40,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:40,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:40,164 INFO L87 Difference]: Start difference. First operand 938 states and 1391 transitions. Second operand 3 states. [2019-10-13 21:24:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,253 INFO L93 Difference]: Finished difference Result 2034 states and 3133 transitions. [2019-10-13 21:24:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:40,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-13 21:24:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,261 INFO L225 Difference]: With dead ends: 2034 [2019-10-13 21:24:40,261 INFO L226 Difference]: Without dead ends: 1366 [2019-10-13 21:24:40,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-10-13 21:24:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1322. [2019-10-13 21:24:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-13 21:24:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2014 transitions. [2019-10-13 21:24:40,335 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2014 transitions. Word has length 106 [2019-10-13 21:24:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,335 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2014 transitions. [2019-10-13 21:24:40,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2014 transitions. [2019-10-13 21:24:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:24:40,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,338 INFO L380 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] [2019-10-13 21:24:40,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1740408399, now seen corresponding path program 1 times [2019-10-13 21:24:40,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130461325] [2019-10-13 21:24:40,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,339 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:40,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130461325] [2019-10-13 21:24:40,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:40,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:40,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648502651] [2019-10-13 21:24:40,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:40,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:40,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:40,518 INFO L87 Difference]: Start difference. First operand 1322 states and 2014 transitions. Second operand 4 states. [2019-10-13 21:24:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,736 INFO L93 Difference]: Finished difference Result 3366 states and 5138 transitions. [2019-10-13 21:24:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:40,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:24:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,747 INFO L225 Difference]: With dead ends: 3366 [2019-10-13 21:24:40,747 INFO L226 Difference]: Without dead ends: 2067 [2019-10-13 21:24:40,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-13 21:24:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2052. [2019-10-13 21:24:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-10-13 21:24:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3114 transitions. [2019-10-13 21:24:40,883 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3114 transitions. Word has length 107 [2019-10-13 21:24:40,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,884 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3114 transitions. [2019-10-13 21:24:40,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3114 transitions. [2019-10-13 21:24:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:24:40,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,887 INFO L380 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] [2019-10-13 21:24:40,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -481916784, now seen corresponding path program 1 times [2019-10-13 21:24:40,887 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963760746] [2019-10-13 21:24:40,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,888 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:41,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963760746] [2019-10-13 21:24:41,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:41,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588972049] [2019-10-13 21:24:41,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:41,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:41,011 INFO L87 Difference]: Start difference. First operand 2052 states and 3114 transitions. Second operand 3 states. [2019-10-13 21:24:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:41,278 INFO L93 Difference]: Finished difference Result 5515 states and 8477 transitions. [2019-10-13 21:24:41,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:41,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-13 21:24:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:41,301 INFO L225 Difference]: With dead ends: 5515 [2019-10-13 21:24:41,301 INFO L226 Difference]: Without dead ends: 3822 [2019-10-13 21:24:41,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-10-13 21:24:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3809. [2019-10-13 21:24:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2019-10-13 21:24:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 5773 transitions. [2019-10-13 21:24:41,573 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 5773 transitions. Word has length 109 [2019-10-13 21:24:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:41,573 INFO L462 AbstractCegarLoop]: Abstraction has 3809 states and 5773 transitions. [2019-10-13 21:24:41,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 5773 transitions. [2019-10-13 21:24:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:24:41,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:41,578 INFO L380 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] [2019-10-13 21:24:41,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:41,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1064644563, now seen corresponding path program 1 times [2019-10-13 21:24:41,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:41,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103667885] [2019-10-13 21:24:41,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:41,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103667885] [2019-10-13 21:24:41,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:41,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365526399] [2019-10-13 21:24:41,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:41,720 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:41,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:41,720 INFO L87 Difference]: Start difference. First operand 3809 states and 5773 transitions. Second operand 4 states. [2019-10-13 21:24:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:41,923 INFO L93 Difference]: Finished difference Result 5943 states and 9044 transitions. [2019-10-13 21:24:41,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:41,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 21:24:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:41,942 INFO L225 Difference]: With dead ends: 5943 [2019-10-13 21:24:41,943 INFO L226 Difference]: Without dead ends: 3112 [2019-10-13 21:24:41,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-10-13 21:24:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2019-10-13 21:24:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-10-13 21:24:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4697 transitions. [2019-10-13 21:24:42,225 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4697 transitions. Word has length 109 [2019-10-13 21:24:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:42,225 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 4697 transitions. [2019-10-13 21:24:42,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4697 transitions. [2019-10-13 21:24:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:24:42,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:42,228 INFO L380 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] [2019-10-13 21:24:42,228 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 894991708, now seen corresponding path program 1 times [2019-10-13 21:24:42,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:42,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764054453] [2019-10-13 21:24:42,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:42,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764054453] [2019-10-13 21:24:42,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:42,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:42,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241993456] [2019-10-13 21:24:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:42,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:42,306 INFO L87 Difference]: Start difference. First operand 3112 states and 4697 transitions. Second operand 3 states. [2019-10-13 21:24:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:42,557 INFO L93 Difference]: Finished difference Result 7812 states and 12106 transitions. [2019-10-13 21:24:42,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:42,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-13 21:24:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:42,582 INFO L225 Difference]: With dead ends: 7812 [2019-10-13 21:24:42,582 INFO L226 Difference]: Without dead ends: 5036 [2019-10-13 21:24:42,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-10-13 21:24:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4830. [2019-10-13 21:24:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-10-13 21:24:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7460 transitions. [2019-10-13 21:24:42,904 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7460 transitions. Word has length 111 [2019-10-13 21:24:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:42,904 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7460 transitions. [2019-10-13 21:24:42,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7460 transitions. [2019-10-13 21:24:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:24:42,907 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:42,908 INFO L380 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] [2019-10-13 21:24:42,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1533697134, now seen corresponding path program 1 times [2019-10-13 21:24:42,909 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:42,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459023645] [2019-10-13 21:24:42,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,909 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:42,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:42,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459023645] [2019-10-13 21:24:42,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:42,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:42,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466868361] [2019-10-13 21:24:42,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:42,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:42,970 INFO L87 Difference]: Start difference. First operand 4830 states and 7460 transitions. Second operand 3 states. [2019-10-13 21:24:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:43,578 INFO L93 Difference]: Finished difference Result 13617 states and 21279 transitions. [2019-10-13 21:24:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:43,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-13 21:24:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:43,630 INFO L225 Difference]: With dead ends: 13617 [2019-10-13 21:24:43,630 INFO L226 Difference]: Without dead ends: 9347 [2019-10-13 21:24:43,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2019-10-13 21:24:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 9275. [2019-10-13 21:24:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-10-13 21:24:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14366 transitions. [2019-10-13 21:24:44,159 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14366 transitions. Word has length 112 [2019-10-13 21:24:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:44,159 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 14366 transitions. [2019-10-13 21:24:44,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14366 transitions. [2019-10-13 21:24:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:24:44,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:44,164 INFO L380 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] [2019-10-13 21:24:44,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:44,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1051932183, now seen corresponding path program 1 times [2019-10-13 21:24:44,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:44,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089575688] [2019-10-13 21:24:44,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:44,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:44,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:44,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089575688] [2019-10-13 21:24:44,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:44,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:44,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416875471] [2019-10-13 21:24:44,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:44,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:44,443 INFO L87 Difference]: Start difference. First operand 9275 states and 14366 transitions. Second operand 4 states. [2019-10-13 21:24:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:45,331 INFO L93 Difference]: Finished difference Result 25948 states and 40113 transitions. [2019-10-13 21:24:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:45,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:24:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:45,366 INFO L225 Difference]: With dead ends: 25948 [2019-10-13 21:24:45,366 INFO L226 Difference]: Without dead ends: 16716 [2019-10-13 21:24:45,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-10-13 21:24:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 16644. [2019-10-13 21:24:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16644 states. [2019-10-13 21:24:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16644 states to 16644 states and 25497 transitions. [2019-10-13 21:24:46,343 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 25497 transitions. Word has length 112 [2019-10-13 21:24:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:46,343 INFO L462 AbstractCegarLoop]: Abstraction has 16644 states and 25497 transitions. [2019-10-13 21:24:46,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 25497 transitions. [2019-10-13 21:24:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:24:46,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:46,349 INFO L380 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] [2019-10-13 21:24:46,350 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:46,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1424445537, now seen corresponding path program 1 times [2019-10-13 21:24:46,350 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:46,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235155514] [2019-10-13 21:24:46,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:46,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:46,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235155514] [2019-10-13 21:24:46,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:46,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:46,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211633562] [2019-10-13 21:24:46,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:46,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:46,400 INFO L87 Difference]: Start difference. First operand 16644 states and 25497 transitions. Second operand 3 states. [2019-10-13 21:24:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:47,895 INFO L93 Difference]: Finished difference Result 49726 states and 76228 transitions. [2019-10-13 21:24:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:47,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-13 21:24:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:47,975 INFO L225 Difference]: With dead ends: 49726 [2019-10-13 21:24:47,976 INFO L226 Difference]: Without dead ends: 33194 [2019-10-13 21:24:48,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-13 21:24:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 16650. [2019-10-13 21:24:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16650 states. [2019-10-13 21:24:48,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16650 states to 16650 states and 25503 transitions. [2019-10-13 21:24:48,946 INFO L78 Accepts]: Start accepts. Automaton has 16650 states and 25503 transitions. Word has length 113 [2019-10-13 21:24:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:48,947 INFO L462 AbstractCegarLoop]: Abstraction has 16650 states and 25503 transitions. [2019-10-13 21:24:48,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:48,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16650 states and 25503 transitions. [2019-10-13 21:24:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:48,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:48,954 INFO L380 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] [2019-10-13 21:24:48,954 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash 274337368, now seen corresponding path program 1 times [2019-10-13 21:24:48,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:48,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470265257] [2019-10-13 21:24:48,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:48,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:49,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470265257] [2019-10-13 21:24:49,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:49,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:49,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831479286] [2019-10-13 21:24:49,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:49,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:49,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:49,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:49,068 INFO L87 Difference]: Start difference. First operand 16650 states and 25503 transitions. Second operand 4 states. [2019-10-13 21:24:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:50,001 INFO L93 Difference]: Finished difference Result 33186 states and 50861 transitions. [2019-10-13 21:24:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:50,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:24:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:50,045 INFO L225 Difference]: With dead ends: 33186 [2019-10-13 21:24:50,046 INFO L226 Difference]: Without dead ends: 16650 [2019-10-13 21:24:50,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states. [2019-10-13 21:24:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16650 to 16647. [2019-10-13 21:24:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16647 states. [2019-10-13 21:24:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16647 states to 16647 states and 25496 transitions. [2019-10-13 21:24:50,892 INFO L78 Accepts]: Start accepts. Automaton has 16647 states and 25496 transitions. Word has length 114 [2019-10-13 21:24:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:50,892 INFO L462 AbstractCegarLoop]: Abstraction has 16647 states and 25496 transitions. [2019-10-13 21:24:50,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16647 states and 25496 transitions. [2019-10-13 21:24:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:50,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:50,898 INFO L380 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] [2019-10-13 21:24:50,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1558735045, now seen corresponding path program 1 times [2019-10-13 21:24:50,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:50,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257800305] [2019-10-13 21:24:50,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:51,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257800305] [2019-10-13 21:24:51,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:51,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:51,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369321457] [2019-10-13 21:24:51,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:51,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:51,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:51,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:51,009 INFO L87 Difference]: Start difference. First operand 16647 states and 25496 transitions. Second operand 4 states. [2019-10-13 21:24:51,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:51,533 INFO L93 Difference]: Finished difference Result 33251 states and 50933 transitions. [2019-10-13 21:24:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:51,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:24:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:51,564 INFO L225 Difference]: With dead ends: 33251 [2019-10-13 21:24:51,564 INFO L226 Difference]: Without dead ends: 16641 [2019-10-13 21:24:51,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16641 states. [2019-10-13 21:24:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16641 to 16641. [2019-10-13 21:24:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16641 states. [2019-10-13 21:24:53,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16641 states to 16641 states and 25484 transitions. [2019-10-13 21:24:53,040 INFO L78 Accepts]: Start accepts. Automaton has 16641 states and 25484 transitions. Word has length 114 [2019-10-13 21:24:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:53,041 INFO L462 AbstractCegarLoop]: Abstraction has 16641 states and 25484 transitions. [2019-10-13 21:24:53,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16641 states and 25484 transitions. [2019-10-13 21:24:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:24:53,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:53,046 INFO L380 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] [2019-10-13 21:24:53,046 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 63830760, now seen corresponding path program 1 times [2019-10-13 21:24:53,047 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:53,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741872375] [2019-10-13 21:24:53,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,047 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:53,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:53,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741872375] [2019-10-13 21:24:53,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:53,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:53,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876479955] [2019-10-13 21:24:53,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:53,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:53,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:53,135 INFO L87 Difference]: Start difference. First operand 16641 states and 25484 transitions. Second operand 3 states. [2019-10-13 21:24:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:54,092 INFO L93 Difference]: Finished difference Result 39717 states and 60974 transitions. [2019-10-13 21:24:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:54,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-13 21:24:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:54,121 INFO L225 Difference]: With dead ends: 39717 [2019-10-13 21:24:54,122 INFO L226 Difference]: Without dead ends: 24107 [2019-10-13 21:24:54,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24107 states. [2019-10-13 21:24:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24107 to 24035. [2019-10-13 21:24:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24035 states. [2019-10-13 21:24:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 36262 transitions. [2019-10-13 21:24:55,047 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 36262 transitions. Word has length 114 [2019-10-13 21:24:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:55,047 INFO L462 AbstractCegarLoop]: Abstraction has 24035 states and 36262 transitions. [2019-10-13 21:24:55,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:55,048 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 36262 transitions. [2019-10-13 21:24:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:24:55,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:55,054 INFO L380 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] [2019-10-13 21:24:55,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash 437096993, now seen corresponding path program 1 times [2019-10-13 21:24:55,055 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:55,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838045532] [2019-10-13 21:24:55,055 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:55,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:55,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838045532] [2019-10-13 21:24:55,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:55,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:55,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708007506] [2019-10-13 21:24:55,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:55,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:55,207 INFO L87 Difference]: Start difference. First operand 24035 states and 36262 transitions. Second operand 4 states. [2019-10-13 21:24:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:56,333 INFO L93 Difference]: Finished difference Result 39430 states and 59625 transitions. [2019-10-13 21:24:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:56,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-10-13 21:24:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:56,359 INFO L225 Difference]: With dead ends: 39430 [2019-10-13 21:24:56,359 INFO L226 Difference]: Without dead ends: 22327 [2019-10-13 21:24:56,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22327 states. [2019-10-13 21:24:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22327 to 22237. [2019-10-13 21:24:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22237 states. [2019-10-13 21:24:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22237 states to 22237 states and 33524 transitions. [2019-10-13 21:24:57,437 INFO L78 Accepts]: Start accepts. Automaton has 22237 states and 33524 transitions. Word has length 117 [2019-10-13 21:24:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:57,437 INFO L462 AbstractCegarLoop]: Abstraction has 22237 states and 33524 transitions. [2019-10-13 21:24:57,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:24:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22237 states and 33524 transitions. [2019-10-13 21:24:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:24:57,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:57,443 INFO L380 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] [2019-10-13 21:24:57,444 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1129378256, now seen corresponding path program 1 times [2019-10-13 21:24:57,444 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:57,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569944572] [2019-10-13 21:24:57,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:57,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:24:57,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569944572] [2019-10-13 21:24:57,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:57,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:24:57,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100083345] [2019-10-13 21:24:57,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:24:57,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:57,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:24:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:24:57,571 INFO L87 Difference]: Start difference. First operand 22237 states and 33524 transitions. Second operand 4 states. [2019-10-13 21:24:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:58,547 INFO L93 Difference]: Finished difference Result 44667 states and 67298 transitions. [2019-10-13 21:24:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:24:58,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-10-13 21:24:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:58,573 INFO L225 Difference]: With dead ends: 44667 [2019-10-13 21:24:58,573 INFO L226 Difference]: Without dead ends: 22589 [2019-10-13 21:24:58,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22589 states. [2019-10-13 21:25:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22589 to 22397. [2019-10-13 21:25:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22397 states. [2019-10-13 21:25:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22397 states to 22397 states and 33699 transitions. [2019-10-13 21:25:00,281 INFO L78 Accepts]: Start accepts. Automaton has 22397 states and 33699 transitions. Word has length 119 [2019-10-13 21:25:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:00,281 INFO L462 AbstractCegarLoop]: Abstraction has 22397 states and 33699 transitions. [2019-10-13 21:25:00,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 22397 states and 33699 transitions. [2019-10-13 21:25:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:25:00,286 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:00,286 INFO L380 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] [2019-10-13 21:25:00,286 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash -586953148, now seen corresponding path program 1 times [2019-10-13 21:25:00,286 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:00,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502836979] [2019-10-13 21:25:00,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,287 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:00,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502836979] [2019-10-13 21:25:00,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:00,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696114907] [2019-10-13 21:25:00,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:00,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:00,350 INFO L87 Difference]: Start difference. First operand 22397 states and 33699 transitions. Second operand 3 states. [2019-10-13 21:25:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:02,573 INFO L93 Difference]: Finished difference Result 60771 states and 91685 transitions. [2019-10-13 21:25:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:02,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-10-13 21:25:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:02,624 INFO L225 Difference]: With dead ends: 60771 [2019-10-13 21:25:02,624 INFO L226 Difference]: Without dead ends: 44583 [2019-10-13 21:25:02,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44583 states. [2019-10-13 21:25:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44583 to 22407. [2019-10-13 21:25:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-10-13 21:25:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33709 transitions. [2019-10-13 21:25:03,971 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33709 transitions. Word has length 120 [2019-10-13 21:25:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:03,972 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33709 transitions. [2019-10-13 21:25:03,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33709 transitions. [2019-10-13 21:25:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:25:03,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:03,976 INFO L380 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] [2019-10-13 21:25:03,977 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1913512932, now seen corresponding path program 1 times [2019-10-13 21:25:03,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:03,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999752687] [2019-10-13 21:25:03,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:04,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999752687] [2019-10-13 21:25:04,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:04,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142542268] [2019-10-13 21:25:04,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:04,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:04,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:04,081 INFO L87 Difference]: Start difference. First operand 22407 states and 33709 transitions. Second operand 5 states. [2019-10-13 21:25:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,498 INFO L93 Difference]: Finished difference Result 41465 states and 62854 transitions. [2019-10-13 21:25:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:25:05,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-13 21:25:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,525 INFO L225 Difference]: With dead ends: 41465 [2019-10-13 21:25:05,525 INFO L226 Difference]: Without dead ends: 22407 [2019-10-13 21:25:05,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:05,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22407 states. [2019-10-13 21:25:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22407 to 22407. [2019-10-13 21:25:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22407 states. [2019-10-13 21:25:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22407 states to 22407 states and 33453 transitions. [2019-10-13 21:25:06,829 INFO L78 Accepts]: Start accepts. Automaton has 22407 states and 33453 transitions. Word has length 121 [2019-10-13 21:25:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,829 INFO L462 AbstractCegarLoop]: Abstraction has 22407 states and 33453 transitions. [2019-10-13 21:25:06,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 22407 states and 33453 transitions. [2019-10-13 21:25:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:25:06,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,833 INFO L380 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] [2019-10-13 21:25:06,834 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1756764407, now seen corresponding path program 1 times [2019-10-13 21:25:06,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741840042] [2019-10-13 21:25:06,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:06,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741840042] [2019-10-13 21:25:06,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:06,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730322617] [2019-10-13 21:25:06,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:06,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:06,958 INFO L87 Difference]: Start difference. First operand 22407 states and 33453 transitions. Second operand 4 states. [2019-10-13 21:25:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,243 INFO L93 Difference]: Finished difference Result 45112 states and 67254 transitions. [2019-10-13 21:25:08,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:08,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-13 21:25:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,272 INFO L225 Difference]: With dead ends: 45112 [2019-10-13 21:25:08,272 INFO L226 Difference]: Without dead ends: 23050 [2019-10-13 21:25:08,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23050 states.