/usr/bin/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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:06:44,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:06:44,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:06:44,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:06:44,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:06:44,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:06:44,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:06:44,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:06:44,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:06:44,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:06:44,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:06:44,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:06:44,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:06:44,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:06:44,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:06:44,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:06:44,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:06:44,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:06:44,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:06:44,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:06:44,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:06:44,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:06:44,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:06:44,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:06:44,951 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:06:44,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:06:44,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:06:44,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:06:44,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:06:44,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:06:44,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:06:44,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:06:44,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:06:44,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:06:44,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:06:44,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:06:44,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:06:44,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:06:44,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:06:44,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:06:44,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:06:44,961 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-11-07 01:06:44,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:06:44,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:06:44,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:06:44,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:06:44,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:06:44,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:06:44,981 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:06:44,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:06:44,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:06:44,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:06:44,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:06:44,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:06:44,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:06:44,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:06:44,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:06:44,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:06:44,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:06:44,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:06:44,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:06:44,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:06:44,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:06:44,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:06:44,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:06:44,987 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-11-07 01:06:45,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:06:45,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:06:45,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:06:45,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:06:45,305 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:06:45,306 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.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:45,393 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9dd036/f6d8198200cb40f996c43e16908a8253/FLAG9047ccb99 [2019-11-07 01:06:46,014 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:06:46,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:46,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9dd036/f6d8198200cb40f996c43e16908a8253/FLAG9047ccb99 [2019-11-07 01:06:46,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de9dd036/f6d8198200cb40f996c43e16908a8253 [2019-11-07 01:06:46,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:06:46,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:06:46,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:46,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:06:46,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:06:46,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:46" (1/1) ... [2019-11-07 01:06:46,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf8a992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:46, skipping insertion in model container [2019-11-07 01:06:46,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:06:46" (1/1) ... [2019-11-07 01:06:46,362 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:06:46,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:06:46,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:47,004 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:06:47,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:06:47,488 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:06:47,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47 WrapperNode [2019-11-07 01:06:47,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:06:47,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:06:47,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:06:47,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:06:47,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (1/1) ... [2019-11-07 01:06:47,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:06:47,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:06:47,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:06:47,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:06:47,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (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-11-07 01:06:47,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:06:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:06:47,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:06:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:06:47,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:06:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:06:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:06:47,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:06:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:06:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:06:47,658 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:06:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:06:47,659 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:06:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:06:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:06:47,660 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:06:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:06:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:06:49,197 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:06:49,197 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:06:49,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:49 BoogieIcfgContainer [2019-11-07 01:06:49,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:06:49,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:06:49,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:06:49,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:06:49,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:06:46" (1/3) ... [2019-11-07 01:06:49,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627f2499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:49, skipping insertion in model container [2019-11-07 01:06:49,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:06:47" (2/3) ... [2019-11-07 01:06:49,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@627f2499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:06:49, skipping insertion in model container [2019-11-07 01:06:49,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:06:49" (3/3) ... [2019-11-07 01:06:49,211 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 01:06:49,221 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:06:49,229 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:06:49,240 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:06:49,268 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:06:49,268 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:06:49,268 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:06:49,268 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:06:49,268 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:06:49,269 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:06:49,269 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:06:49,269 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:06:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states. [2019-11-07 01:06:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:49,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:49,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:49,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 415390772, now seen corresponding path program 1 times [2019-11-07 01:06:49,327 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:49,327 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2811920] [2019-11-07 01:06:49,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:50,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2811920] [2019-11-07 01:06:50,003 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:50,004 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:50,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066387685] [2019-11-07 01:06:50,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:50,012 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:50,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:50,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:50,029 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 3 states. [2019-11-07 01:06:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:50,252 INFO L93 Difference]: Finished difference Result 629 states and 1092 transitions. [2019-11-07 01:06:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:50,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-07 01:06:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:50,274 INFO L225 Difference]: With dead ends: 629 [2019-11-07 01:06:50,274 INFO L226 Difference]: Without dead ends: 514 [2019-11-07 01:06:50,278 INFO L630 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-11-07 01:06:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-07 01:06:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 512. [2019-11-07 01:06:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-07 01:06:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 761 transitions. [2019-11-07 01:06:50,376 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 761 transitions. Word has length 154 [2019-11-07 01:06:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:50,377 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 761 transitions. [2019-11-07 01:06:50,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 761 transitions. [2019-11-07 01:06:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-07 01:06:50,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:50,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:50,385 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:50,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1479062648, now seen corresponding path program 1 times [2019-11-07 01:06:50,386 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:50,386 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254576195] [2019-11-07 01:06:50,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:50,932 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254576195] [2019-11-07 01:06:50,933 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:50,933 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:50,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723941377] [2019-11-07 01:06:50,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:50,937 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:50,938 INFO L87 Difference]: Start difference. First operand 512 states and 761 transitions. Second operand 4 states. [2019-11-07 01:06:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,088 INFO L93 Difference]: Finished difference Result 1493 states and 2216 transitions. [2019-11-07 01:06:51,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:51,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-07 01:06:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,095 INFO L225 Difference]: With dead ends: 1493 [2019-11-07 01:06:51,096 INFO L226 Difference]: Without dead ends: 994 [2019-11-07 01:06:51,099 INFO L630 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-11-07 01:06:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-07 01:06:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 992. [2019-11-07 01:06:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-07 01:06:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1463 transitions. [2019-11-07 01:06:51,198 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1463 transitions. Word has length 154 [2019-11-07 01:06:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:51,199 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1463 transitions. [2019-11-07 01:06:51,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1463 transitions. [2019-11-07 01:06:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 01:06:51,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:51,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:51,210 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:51,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash 203763094, now seen corresponding path program 1 times [2019-11-07 01:06:51,211 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:51,212 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295587112] [2019-11-07 01:06:51,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:51,309 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295587112] [2019-11-07 01:06:51,310 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:51,310 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:51,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329506804] [2019-11-07 01:06:51,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:51,312 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:51,314 INFO L87 Difference]: Start difference. First operand 992 states and 1463 transitions. Second operand 3 states. [2019-11-07 01:06:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,399 INFO L93 Difference]: Finished difference Result 2930 states and 4319 transitions. [2019-11-07 01:06:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:51,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-07 01:06:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,410 INFO L225 Difference]: With dead ends: 2930 [2019-11-07 01:06:51,411 INFO L226 Difference]: Without dead ends: 1970 [2019-11-07 01:06:51,413 INFO L630 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-11-07 01:06:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-11-07 01:06:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 994. [2019-11-07 01:06:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-07 01:06:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1465 transitions. [2019-11-07 01:06:51,479 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1465 transitions. Word has length 155 [2019-11-07 01:06:51,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:51,479 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1465 transitions. [2019-11-07 01:06:51,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1465 transitions. [2019-11-07 01:06:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:51,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:51,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:51,483 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:51,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash -691639607, now seen corresponding path program 1 times [2019-11-07 01:06:51,483 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:51,484 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416782049] [2019-11-07 01:06:51,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:51,688 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416782049] [2019-11-07 01:06:51,688 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:51,688 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:51,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296525938] [2019-11-07 01:06:51,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:51,690 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:51,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:51,691 INFO L87 Difference]: Start difference. First operand 994 states and 1465 transitions. Second operand 4 states. [2019-11-07 01:06:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:51,787 INFO L93 Difference]: Finished difference Result 1970 states and 2905 transitions. [2019-11-07 01:06:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:51,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-07 01:06:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:51,797 INFO L225 Difference]: With dead ends: 1970 [2019-11-07 01:06:51,797 INFO L226 Difference]: Without dead ends: 994 [2019-11-07 01:06:51,799 INFO L630 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-11-07 01:06:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-07 01:06:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 993. [2019-11-07 01:06:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-11-07 01:06:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1462 transitions. [2019-11-07 01:06:51,858 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1462 transitions. Word has length 156 [2019-11-07 01:06:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:51,859 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 1462 transitions. [2019-11-07 01:06:51,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1462 transitions. [2019-11-07 01:06:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:51,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:51,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:51,864 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:51,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2145460590, now seen corresponding path program 1 times [2019-11-07 01:06:51,865 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:51,865 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718560227] [2019-11-07 01:06:51,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:52,064 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718560227] [2019-11-07 01:06:52,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:52,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:52,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122737628] [2019-11-07 01:06:52,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:52,065 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:52,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:52,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:52,066 INFO L87 Difference]: Start difference. First operand 993 states and 1462 transitions. Second operand 4 states. [2019-11-07 01:06:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:52,144 INFO L93 Difference]: Finished difference Result 1973 states and 2907 transitions. [2019-11-07 01:06:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:52,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-07 01:06:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:52,151 INFO L225 Difference]: With dead ends: 1973 [2019-11-07 01:06:52,152 INFO L226 Difference]: Without dead ends: 991 [2019-11-07 01:06:52,154 INFO L630 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-11-07 01:06:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-07 01:06:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-11-07 01:06:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-11-07 01:06:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1458 transitions. [2019-11-07 01:06:52,207 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1458 transitions. Word has length 156 [2019-11-07 01:06:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:52,207 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1458 transitions. [2019-11-07 01:06:52,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1458 transitions. [2019-11-07 01:06:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-07 01:06:52,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:52,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:52,211 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:52,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:52,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1752535471, now seen corresponding path program 1 times [2019-11-07 01:06:52,211 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:52,211 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634126290] [2019-11-07 01:06:52,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:52,392 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634126290] [2019-11-07 01:06:52,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:52,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:52,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980543614] [2019-11-07 01:06:52,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:52,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:52,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:52,395 INFO L87 Difference]: Start difference. First operand 991 states and 1458 transitions. Second operand 3 states. [2019-11-07 01:06:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:52,506 INFO L93 Difference]: Finished difference Result 2257 states and 3335 transitions. [2019-11-07 01:06:52,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:52,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-07 01:06:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:52,514 INFO L225 Difference]: With dead ends: 2257 [2019-11-07 01:06:52,514 INFO L226 Difference]: Without dead ends: 1462 [2019-11-07 01:06:52,516 INFO L630 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-11-07 01:06:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2019-11-07 01:06:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2019-11-07 01:06:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-11-07 01:06:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2122 transitions. [2019-11-07 01:06:52,590 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2122 transitions. Word has length 156 [2019-11-07 01:06:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:52,591 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2122 transitions. [2019-11-07 01:06:52,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2122 transitions. [2019-11-07 01:06:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 01:06:52,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:52,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:52,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1902063682, now seen corresponding path program 1 times [2019-11-07 01:06:52,596 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:52,596 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837617860] [2019-11-07 01:06:52,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:52,669 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837617860] [2019-11-07 01:06:52,669 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:52,669 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:52,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780291815] [2019-11-07 01:06:52,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:52,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:52,671 INFO L87 Difference]: Start difference. First operand 1460 states and 2122 transitions. Second operand 3 states. [2019-11-07 01:06:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:52,794 INFO L93 Difference]: Finished difference Result 3179 states and 4753 transitions. [2019-11-07 01:06:52,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:52,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-07 01:06:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:52,804 INFO L225 Difference]: With dead ends: 3179 [2019-11-07 01:06:52,805 INFO L226 Difference]: Without dead ends: 1908 [2019-11-07 01:06:52,808 INFO L630 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-11-07 01:06:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-11-07 01:06:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1876. [2019-11-07 01:06:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-11-07 01:06:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2798 transitions. [2019-11-07 01:06:52,952 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2798 transitions. Word has length 157 [2019-11-07 01:06:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:52,952 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 2798 transitions. [2019-11-07 01:06:52,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2798 transitions. [2019-11-07 01:06:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 01:06:52,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:52,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:52,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:52,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1819575298, now seen corresponding path program 1 times [2019-11-07 01:06:52,960 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:52,960 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833527618] [2019-11-07 01:06:52,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:53,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833527618] [2019-11-07 01:06:53,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:53,185 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:06:53,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932611525] [2019-11-07 01:06:53,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:06:53,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:06:53,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:06:53,187 INFO L87 Difference]: Start difference. First operand 1876 states and 2798 transitions. Second operand 4 states. [2019-11-07 01:06:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:53,395 INFO L93 Difference]: Finished difference Result 4810 states and 7177 transitions. [2019-11-07 01:06:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:06:53,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-07 01:06:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:53,411 INFO L225 Difference]: With dead ends: 4810 [2019-11-07 01:06:53,412 INFO L226 Difference]: Without dead ends: 2965 [2019-11-07 01:06:53,418 INFO L630 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-11-07 01:06:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-07 01:06:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2019-11-07 01:06:53,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-11-07 01:06:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4385 transitions. [2019-11-07 01:06:53,636 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4385 transitions. Word has length 160 [2019-11-07 01:06:53,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:53,637 INFO L462 AbstractCegarLoop]: Abstraction has 2963 states and 4385 transitions. [2019-11-07 01:06:53,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:06:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4385 transitions. [2019-11-07 01:06:53,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 01:06:53,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:53,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:53,646 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:53,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash -489223043, now seen corresponding path program 1 times [2019-11-07 01:06:53,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:53,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185500454] [2019-11-07 01:06:53,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:53,872 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185500454] [2019-11-07 01:06:53,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:53,875 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:53,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46028851] [2019-11-07 01:06:53,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:53,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:53,877 INFO L87 Difference]: Start difference. First operand 2963 states and 4385 transitions. Second operand 3 states. [2019-11-07 01:06:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:54,141 INFO L93 Difference]: Finished difference Result 7148 states and 10640 transitions. [2019-11-07 01:06:54,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:54,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-07 01:06:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:54,164 INFO L225 Difference]: With dead ends: 7148 [2019-11-07 01:06:54,164 INFO L226 Difference]: Without dead ends: 4544 [2019-11-07 01:06:54,171 INFO L630 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-11-07 01:06:54,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4544 states. [2019-11-07 01:06:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4544 to 4542. [2019-11-07 01:06:54,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-11-07 01:06:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 6645 transitions. [2019-11-07 01:06:54,515 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 6645 transitions. Word has length 162 [2019-11-07 01:06:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:54,515 INFO L462 AbstractCegarLoop]: Abstraction has 4542 states and 6645 transitions. [2019-11-07 01:06:54,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 6645 transitions. [2019-11-07 01:06:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:54,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:54,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:54,527 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:54,527 INFO L82 PathProgramCache]: Analyzing trace with hash -598358062, now seen corresponding path program 1 times [2019-11-07 01:06:54,528 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:54,528 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146652536] [2019-11-07 01:06:54,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:54,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146652536] [2019-11-07 01:06:54,696 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:54,697 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:06:54,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305786271] [2019-11-07 01:06:54,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:06:54,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:06:54,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:06:54,700 INFO L87 Difference]: Start difference. First operand 4542 states and 6645 transitions. Second operand 3 states. [2019-11-07 01:06:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:55,577 INFO L93 Difference]: Finished difference Result 12098 states and 17966 transitions. [2019-11-07 01:06:55,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:06:55,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-07 01:06:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:55,671 INFO L225 Difference]: With dead ends: 12098 [2019-11-07 01:06:55,671 INFO L226 Difference]: Without dead ends: 8790 [2019-11-07 01:06:55,691 INFO L630 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-11-07 01:06:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8790 states. [2019-11-07 01:06:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8790 to 8788. [2019-11-07 01:06:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8788 states. [2019-11-07 01:06:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8788 states to 8788 states and 12891 transitions. [2019-11-07 01:06:56,618 INFO L78 Accepts]: Start accepts. Automaton has 8788 states and 12891 transitions. Word has length 166 [2019-11-07 01:06:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:56,618 INFO L462 AbstractCegarLoop]: Abstraction has 8788 states and 12891 transitions. [2019-11-07 01:06:56,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:06:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8788 states and 12891 transitions. [2019-11-07 01:06:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:56,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:56,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:56,631 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:56,631 INFO L82 PathProgramCache]: Analyzing trace with hash 875092589, now seen corresponding path program 1 times [2019-11-07 01:06:56,631 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:56,631 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505839612] [2019-11-07 01:06:56,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:56,853 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505839612] [2019-11-07 01:06:56,853 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:56,853 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 01:06:56,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853803072] [2019-11-07 01:06:56,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 01:06:56,854 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:56,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 01:06:56,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:06:56,856 INFO L87 Difference]: Start difference. First operand 8788 states and 12891 transitions. Second operand 8 states. [2019-11-07 01:06:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:58,808 INFO L93 Difference]: Finished difference Result 29662 states and 44875 transitions. [2019-11-07 01:06:58,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:06:58,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-11-07 01:06:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:58,853 INFO L225 Difference]: With dead ends: 29662 [2019-11-07 01:06:58,853 INFO L226 Difference]: Without dead ends: 21434 [2019-11-07 01:06:58,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:06:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-11-07 01:06:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 12552. [2019-11-07 01:06:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12552 states. [2019-11-07 01:06:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12552 states to 12552 states and 18471 transitions. [2019-11-07 01:06:59,912 INFO L78 Accepts]: Start accepts. Automaton has 12552 states and 18471 transitions. Word has length 166 [2019-11-07 01:06:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:59,912 INFO L462 AbstractCegarLoop]: Abstraction has 12552 states and 18471 transitions. [2019-11-07 01:06:59,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 01:06:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12552 states and 18471 transitions. [2019-11-07 01:06:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-07 01:06:59,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:59,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:59,923 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:59,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2101346563, now seen corresponding path program 1 times [2019-11-07 01:06:59,924 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:59,924 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120098795] [2019-11-07 01:06:59,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:00,157 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120098795] [2019-11-07 01:07:00,158 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:00,158 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:00,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325912857] [2019-11-07 01:07:00,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:00,159 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:00,160 INFO L87 Difference]: Start difference. First operand 12552 states and 18471 transitions. Second operand 4 states. [2019-11-07 01:07:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:01,756 INFO L93 Difference]: Finished difference Result 36416 states and 53423 transitions. [2019-11-07 01:07:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:01,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-07 01:07:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:02,404 INFO L225 Difference]: With dead ends: 36416 [2019-11-07 01:07:02,404 INFO L226 Difference]: Without dead ends: 23907 [2019-11-07 01:07:02,429 INFO L630 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-11-07 01:07:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23907 states. [2019-11-07 01:07:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23907 to 23905. [2019-11-07 01:07:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23905 states. [2019-11-07 01:07:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23905 states to 23905 states and 34702 transitions. [2019-11-07 01:07:03,677 INFO L78 Accepts]: Start accepts. Automaton has 23905 states and 34702 transitions. Word has length 166 [2019-11-07 01:07:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:03,678 INFO L462 AbstractCegarLoop]: Abstraction has 23905 states and 34702 transitions. [2019-11-07 01:07:03,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 23905 states and 34702 transitions. [2019-11-07 01:07:03,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-07 01:07:03,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:03,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:03,696 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:03,697 INFO L82 PathProgramCache]: Analyzing trace with hash 222110291, now seen corresponding path program 1 times [2019-11-07 01:07:03,697 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:03,697 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209226189] [2019-11-07 01:07:03,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:03,764 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209226189] [2019-11-07 01:07:03,764 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:03,765 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:03,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693004299] [2019-11-07 01:07:03,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:03,766 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:03,767 INFO L87 Difference]: Start difference. First operand 23905 states and 34702 transitions. Second operand 3 states. [2019-11-07 01:07:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:05,946 INFO L93 Difference]: Finished difference Result 71507 states and 103841 transitions. [2019-11-07 01:07:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:05,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-07 01:07:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:06,052 INFO L225 Difference]: With dead ends: 71507 [2019-11-07 01:07:06,052 INFO L226 Difference]: Without dead ends: 47715 [2019-11-07 01:07:06,096 INFO L630 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-11-07 01:07:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47715 states. [2019-11-07 01:07:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47715 to 23911. [2019-11-07 01:07:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23911 states. [2019-11-07 01:07:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23911 states to 23911 states and 34708 transitions. [2019-11-07 01:07:08,321 INFO L78 Accepts]: Start accepts. Automaton has 23911 states and 34708 transitions. Word has length 167 [2019-11-07 01:07:08,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:08,321 INFO L462 AbstractCegarLoop]: Abstraction has 23911 states and 34708 transitions. [2019-11-07 01:07:08,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:08,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23911 states and 34708 transitions. [2019-11-07 01:07:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:07:08,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:08,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:08,336 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1523045680, now seen corresponding path program 1 times [2019-11-07 01:07:08,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:08,337 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305716516] [2019-11-07 01:07:08,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:08,443 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305716516] [2019-11-07 01:07:08,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:08,444 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:08,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856160028] [2019-11-07 01:07:08,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:08,445 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:08,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:08,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:08,445 INFO L87 Difference]: Start difference. First operand 23911 states and 34708 transitions. Second operand 3 states. [2019-11-07 01:07:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:10,655 INFO L93 Difference]: Finished difference Result 69094 states and 100453 transitions. [2019-11-07 01:07:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:07:10,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-07 01:07:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:10,741 INFO L225 Difference]: With dead ends: 69094 [2019-11-07 01:07:10,742 INFO L226 Difference]: Without dead ends: 46232 [2019-11-07 01:07:10,775 INFO L630 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-11-07 01:07:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46232 states. [2019-11-07 01:07:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46232 to 46230. [2019-11-07 01:07:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46230 states. [2019-11-07 01:07:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46230 states to 46230 states and 66591 transitions. [2019-11-07 01:07:13,281 INFO L78 Accepts]: Start accepts. Automaton has 46230 states and 66591 transitions. Word has length 168 [2019-11-07 01:07:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 46230 states and 66591 transitions. [2019-11-07 01:07:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:07:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46230 states and 66591 transitions. [2019-11-07 01:07:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-07 01:07:13,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:13,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:13,301 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:13,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 846994253, now seen corresponding path program 1 times [2019-11-07 01:07:13,301 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:13,302 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714087537] [2019-11-07 01:07:13,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:13,456 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714087537] [2019-11-07 01:07:13,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:13,456 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:07:13,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025768899] [2019-11-07 01:07:13,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:07:13,457 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:13,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:07:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:07:13,458 INFO L87 Difference]: Start difference. First operand 46230 states and 66591 transitions. Second operand 4 states. [2019-11-07 01:07:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:07:15,941 INFO L93 Difference]: Finished difference Result 80972 states and 116685 transitions. [2019-11-07 01:07:15,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 01:07:15,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-11-07 01:07:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:07:15,985 INFO L225 Difference]: With dead ends: 80972 [2019-11-07 01:07:15,985 INFO L226 Difference]: Without dead ends: 35645 [2019-11-07 01:07:16,032 INFO L630 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-11-07 01:07:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35645 states. [2019-11-07 01:07:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35645 to 35645. [2019-11-07 01:07:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35645 states. [2019-11-07 01:07:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35645 states to 35645 states and 51181 transitions. [2019-11-07 01:07:17,813 INFO L78 Accepts]: Start accepts. Automaton has 35645 states and 51181 transitions. Word has length 168 [2019-11-07 01:07:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:07:17,813 INFO L462 AbstractCegarLoop]: Abstraction has 35645 states and 51181 transitions. [2019-11-07 01:07:17,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:07:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35645 states and 51181 transitions. [2019-11-07 01:07:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-07 01:07:17,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:07:17,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:07:17,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:07:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:07:17,828 INFO L82 PathProgramCache]: Analyzing trace with hash 349543820, now seen corresponding path program 1 times [2019-11-07 01:07:17,828 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:07:17,829 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603220709] [2019-11-07 01:07:17,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:07:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:07:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:07:17,917 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603220709] [2019-11-07 01:07:17,917 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:07:17,917 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:07:17,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123723060] [2019-11-07 01:07:17,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:07:17,918 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:07:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:07:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:07:17,919 INFO L87 Difference]: Start difference. First operand 35645 states and 51181 transitions. Second operand 3 states.