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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:15:25,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:15:25,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:15:25,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:15:25,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:15:25,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:15:25,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:15:25,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:15:25,968 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:15:25,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:15:25,970 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:15:25,971 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:15:25,972 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:15:25,973 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:15:25,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:15:25,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:15:25,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:15:25,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:15:25,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:15:25,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:15:25,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:15:25,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:15:25,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:15:25,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:15:25,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:15:25,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:15:25,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:15:25,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:15:25,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:15:25,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:15:25,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:15:25,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:15:25,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:15:25,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:15:25,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:15:25,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:15:25,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:15:25,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:15:25,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:15:25,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:15:25,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:15:25,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:15:26,014 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:15:26,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:15:26,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:15:26,015 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:15:26,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:15:26,016 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:15:26,016 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:15:26,016 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:15:26,017 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:15:26,017 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:15:26,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:15:26,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:15:26,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:15:26,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:15:26,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:15:26,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:15:26,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:15:26,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:15:26,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:15:26,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:15:26,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:15:26,020 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:15:26,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:15:26,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:15:26,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:15:26,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:15:26,021 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:15:26,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:15:26,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:15:26,022 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:15:26,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:15:26,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:15:26,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:15:26,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:15:26,068 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:15:26,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:15:26,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41025d2bf/16c77355e1c04b5390a9ada8f6bb209d/FLAGfab98e126 [2019-09-10 06:15:26,843 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:15:26,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:15:26,861 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41025d2bf/16c77355e1c04b5390a9ada8f6bb209d/FLAGfab98e126 [2019-09-10 06:15:27,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41025d2bf/16c77355e1c04b5390a9ada8f6bb209d [2019-09-10 06:15:27,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:15:27,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:15:27,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:15:27,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:15:27,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:15:27,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:15:27" (1/1) ... [2019-09-10 06:15:27,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee86381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:27, skipping insertion in model container [2019-09-10 06:15:27,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:15:27" (1/1) ... [2019-09-10 06:15:27,045 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:15:27,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:15:28,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:15:28,055 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:15:28,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:15:28,491 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:15:28,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28 WrapperNode [2019-09-10 06:15:28,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:15:28,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:15:28,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:15:28,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:15:28,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (1/1) ... [2019-09-10 06:15:28,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:15:28,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:15:28,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:15:28,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:15:28,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (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-09-10 06:15:28,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:15:28,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:15:28,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:15:28,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:15:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:15:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:15:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:15:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:15:28,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:15:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:15:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:15:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:15:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:15:28,748 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:15:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:15:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:15:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:15:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:15:28,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:15:28,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:15:31,469 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:15:31,469 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:15:31,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:15:31 BoogieIcfgContainer [2019-09-10 06:15:31,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:15:31,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:15:31,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:15:31,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:15:31,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:15:27" (1/3) ... [2019-09-10 06:15:31,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faaae69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:15:31, skipping insertion in model container [2019-09-10 06:15:31,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:15:28" (2/3) ... [2019-09-10 06:15:31,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faaae69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:15:31, skipping insertion in model container [2019-09-10 06:15:31,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:15:31" (3/3) ... [2019-09-10 06:15:31,483 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:15:31,493 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:15:31,523 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:15:31,545 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:15:31,579 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:15:31,579 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:15:31,579 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:15:31,579 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:15:31,580 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:15:31,580 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:15:31,580 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:15:31,580 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:15:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states. [2019-09-10 06:15:31,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:15:31,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:31,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:31,674 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:31,678 INFO L82 PathProgramCache]: Analyzing trace with hash -278942360, now seen corresponding path program 1 times [2019-09-10 06:15:31,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:31,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:31,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:32,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:32,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:32,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:32,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:32,770 INFO L87 Difference]: Start difference. First operand 725 states. Second operand 3 states. [2019-09-10 06:15:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:33,063 INFO L93 Difference]: Finished difference Result 1181 states and 2086 transitions. [2019-09-10 06:15:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:33,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:15:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:33,105 INFO L225 Difference]: With dead ends: 1181 [2019-09-10 06:15:33,105 INFO L226 Difference]: Without dead ends: 1173 [2019-09-10 06:15:33,108 INFO L628 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-09-10 06:15:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-09-10 06:15:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1171. [2019-09-10 06:15:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-09-10 06:15:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1818 transitions. [2019-09-10 06:15:33,253 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1818 transitions. Word has length 302 [2019-09-10 06:15:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:33,255 INFO L475 AbstractCegarLoop]: Abstraction has 1171 states and 1818 transitions. [2019-09-10 06:15:33,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1818 transitions. [2019-09-10 06:15:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:15:33,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:33,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:33,265 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:33,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:33,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1060381776, now seen corresponding path program 1 times [2019-09-10 06:15:33,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:33,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:33,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:33,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:33,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:33,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:33,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:33,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:33,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:33,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:33,671 INFO L87 Difference]: Start difference. First operand 1171 states and 1818 transitions. Second operand 3 states. [2019-09-10 06:15:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:33,926 INFO L93 Difference]: Finished difference Result 2055 states and 3175 transitions. [2019-09-10 06:15:33,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:33,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:15:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:33,942 INFO L225 Difference]: With dead ends: 2055 [2019-09-10 06:15:33,942 INFO L226 Difference]: Without dead ends: 2055 [2019-09-10 06:15:33,943 INFO L628 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-09-10 06:15:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-10 06:15:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2053. [2019-09-10 06:15:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2053 states. [2019-09-10 06:15:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3174 transitions. [2019-09-10 06:15:34,052 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3174 transitions. Word has length 302 [2019-09-10 06:15:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:34,055 INFO L475 AbstractCegarLoop]: Abstraction has 2053 states and 3174 transitions. [2019-09-10 06:15:34,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3174 transitions. [2019-09-10 06:15:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:15:34,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:34,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:34,074 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:34,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:34,076 INFO L82 PathProgramCache]: Analyzing trace with hash -942332820, now seen corresponding path program 1 times [2019-09-10 06:15:34,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:34,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:34,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:34,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:34,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:34,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:34,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:34,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:34,621 INFO L87 Difference]: Start difference. First operand 2053 states and 3174 transitions. Second operand 3 states. [2019-09-10 06:15:34,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:34,857 INFO L93 Difference]: Finished difference Result 3747 states and 5763 transitions. [2019-09-10 06:15:34,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:34,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:15:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:34,885 INFO L225 Difference]: With dead ends: 3747 [2019-09-10 06:15:34,885 INFO L226 Difference]: Without dead ends: 3747 [2019-09-10 06:15:34,886 INFO L628 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-09-10 06:15:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-09-10 06:15:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3745. [2019-09-10 06:15:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3745 states. [2019-09-10 06:15:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 5762 transitions. [2019-09-10 06:15:34,994 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 5762 transitions. Word has length 302 [2019-09-10 06:15:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:34,994 INFO L475 AbstractCegarLoop]: Abstraction has 3745 states and 5762 transitions. [2019-09-10 06:15:34,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 5762 transitions. [2019-09-10 06:15:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:15:35,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:35,006 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:35,006 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1541009136, now seen corresponding path program 1 times [2019-09-10 06:15:35,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:35,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:35,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:35,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:35,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:35,868 INFO L87 Difference]: Start difference. First operand 3745 states and 5762 transitions. Second operand 4 states. [2019-09-10 06:15:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:36,080 INFO L93 Difference]: Finished difference Result 7347 states and 11237 transitions. [2019-09-10 06:15:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:36,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:15:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:36,117 INFO L225 Difference]: With dead ends: 7347 [2019-09-10 06:15:36,117 INFO L226 Difference]: Without dead ends: 7347 [2019-09-10 06:15:36,117 INFO L628 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-09-10 06:15:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7347 states. [2019-09-10 06:15:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7347 to 7345. [2019-09-10 06:15:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7345 states. [2019-09-10 06:15:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7345 states to 7345 states and 11236 transitions. [2019-09-10 06:15:36,340 INFO L78 Accepts]: Start accepts. Automaton has 7345 states and 11236 transitions. Word has length 302 [2019-09-10 06:15:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:36,340 INFO L475 AbstractCegarLoop]: Abstraction has 7345 states and 11236 transitions. [2019-09-10 06:15:36,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7345 states and 11236 transitions. [2019-09-10 06:15:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:15:36,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:36,358 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:36,359 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1865375771, now seen corresponding path program 1 times [2019-09-10 06:15:36,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:36,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:36,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:36,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:36,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:36,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:36,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:36,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:36,491 INFO L87 Difference]: Start difference. First operand 7345 states and 11236 transitions. Second operand 3 states. [2019-09-10 06:15:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:36,681 INFO L93 Difference]: Finished difference Result 14670 states and 22437 transitions. [2019-09-10 06:15:36,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:36,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:15:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:36,798 INFO L225 Difference]: With dead ends: 14670 [2019-09-10 06:15:36,798 INFO L226 Difference]: Without dead ends: 14670 [2019-09-10 06:15:36,799 INFO L628 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-09-10 06:15:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14670 states. [2019-09-10 06:15:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14670 to 7358. [2019-09-10 06:15:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7358 states. [2019-09-10 06:15:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7358 states to 7358 states and 11255 transitions. [2019-09-10 06:15:37,246 INFO L78 Accepts]: Start accepts. Automaton has 7358 states and 11255 transitions. Word has length 304 [2019-09-10 06:15:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:37,246 INFO L475 AbstractCegarLoop]: Abstraction has 7358 states and 11255 transitions. [2019-09-10 06:15:37,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7358 states and 11255 transitions. [2019-09-10 06:15:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:15:37,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:37,277 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:37,277 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1755602218, now seen corresponding path program 1 times [2019-09-10 06:15:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:37,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:37,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:37,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:37,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:37,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:37,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:37,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:37,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:37,546 INFO L87 Difference]: Start difference. First operand 7358 states and 11255 transitions. Second operand 3 states. [2019-09-10 06:15:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:37,723 INFO L93 Difference]: Finished difference Result 14437 states and 21954 transitions. [2019-09-10 06:15:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:37,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:15:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:37,766 INFO L225 Difference]: With dead ends: 14437 [2019-09-10 06:15:37,766 INFO L226 Difference]: Without dead ends: 14437 [2019-09-10 06:15:37,767 INFO L628 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-09-10 06:15:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2019-09-10 06:15:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 14435. [2019-09-10 06:15:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-09-10 06:15:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 21953 transitions. [2019-09-10 06:15:38,190 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 21953 transitions. Word has length 304 [2019-09-10 06:15:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:38,191 INFO L475 AbstractCegarLoop]: Abstraction has 14435 states and 21953 transitions. [2019-09-10 06:15:38,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 21953 transitions. [2019-09-10 06:15:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-10 06:15:38,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:38,249 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:38,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1506108170, now seen corresponding path program 1 times [2019-09-10 06:15:38,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:38,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:38,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:38,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:38,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:38,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:38,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:38,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:38,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:38,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:38,572 INFO L87 Difference]: Start difference. First operand 14435 states and 21953 transitions. Second operand 3 states. [2019-09-10 06:15:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:38,741 INFO L93 Difference]: Finished difference Result 28817 states and 43811 transitions. [2019-09-10 06:15:38,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:38,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-10 06:15:38,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:38,809 INFO L225 Difference]: With dead ends: 28817 [2019-09-10 06:15:38,810 INFO L226 Difference]: Without dead ends: 28817 [2019-09-10 06:15:38,810 INFO L628 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-09-10 06:15:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28817 states. [2019-09-10 06:15:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28817 to 14453. [2019-09-10 06:15:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14453 states. [2019-09-10 06:15:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14453 states to 14453 states and 21974 transitions. [2019-09-10 06:15:39,302 INFO L78 Accepts]: Start accepts. Automaton has 14453 states and 21974 transitions. Word has length 305 [2019-09-10 06:15:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:39,303 INFO L475 AbstractCegarLoop]: Abstraction has 14453 states and 21974 transitions. [2019-09-10 06:15:39,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 14453 states and 21974 transitions. [2019-09-10 06:15:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:15:39,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:39,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:39,347 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash 939140209, now seen corresponding path program 1 times [2019-09-10 06:15:39,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:39,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:39,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:39,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:40,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:40,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:40,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:40,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:40,229 INFO L87 Difference]: Start difference. First operand 14453 states and 21974 transitions. Second operand 3 states. [2019-09-10 06:15:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:40,435 INFO L93 Difference]: Finished difference Result 26738 states and 40359 transitions. [2019-09-10 06:15:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:40,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:15:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:40,502 INFO L225 Difference]: With dead ends: 26738 [2019-09-10 06:15:40,502 INFO L226 Difference]: Without dead ends: 26738 [2019-09-10 06:15:40,502 INFO L628 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-09-10 06:15:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26738 states. [2019-09-10 06:15:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26738 to 26736. [2019-09-10 06:15:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26736 states. [2019-09-10 06:15:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26736 states to 26736 states and 40358 transitions. [2019-09-10 06:15:41,073 INFO L78 Accepts]: Start accepts. Automaton has 26736 states and 40358 transitions. Word has length 306 [2019-09-10 06:15:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:41,074 INFO L475 AbstractCegarLoop]: Abstraction has 26736 states and 40358 transitions. [2019-09-10 06:15:41,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 26736 states and 40358 transitions. [2019-09-10 06:15:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:15:41,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:41,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:41,142 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:41,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:41,143 INFO L82 PathProgramCache]: Analyzing trace with hash -196716786, now seen corresponding path program 1 times [2019-09-10 06:15:41,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:41,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:41,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:41,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:41,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:41,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:41,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:41,571 INFO L87 Difference]: Start difference. First operand 26736 states and 40358 transitions. Second operand 4 states. [2019-09-10 06:15:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:41,903 INFO L93 Difference]: Finished difference Result 51363 states and 77404 transitions. [2019-09-10 06:15:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:41,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:15:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:42,006 INFO L225 Difference]: With dead ends: 51363 [2019-09-10 06:15:42,006 INFO L226 Difference]: Without dead ends: 51363 [2019-09-10 06:15:42,007 INFO L628 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-09-10 06:15:42,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51363 states. [2019-09-10 06:15:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51363 to 26971. [2019-09-10 06:15:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26971 states. [2019-09-10 06:15:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26971 states to 26971 states and 40746 transitions. [2019-09-10 06:15:42,698 INFO L78 Accepts]: Start accepts. Automaton has 26971 states and 40746 transitions. Word has length 306 [2019-09-10 06:15:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:42,698 INFO L475 AbstractCegarLoop]: Abstraction has 26971 states and 40746 transitions. [2019-09-10 06:15:42,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26971 states and 40746 transitions. [2019-09-10 06:15:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:15:42,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:42,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:42,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:42,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:42,750 INFO L82 PathProgramCache]: Analyzing trace with hash -248548203, now seen corresponding path program 1 times [2019-09-10 06:15:42,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:42,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:42,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:42,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:42,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:42,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:42,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:42,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:42,901 INFO L87 Difference]: Start difference. First operand 26971 states and 40746 transitions. Second operand 3 states. [2019-09-10 06:15:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:43,214 INFO L93 Difference]: Finished difference Result 53175 states and 80136 transitions. [2019-09-10 06:15:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:43,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:15:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:43,335 INFO L225 Difference]: With dead ends: 53175 [2019-09-10 06:15:43,335 INFO L226 Difference]: Without dead ends: 53175 [2019-09-10 06:15:43,336 INFO L628 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-09-10 06:15:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53175 states. [2019-09-10 06:15:44,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53175 to 27075. [2019-09-10 06:15:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27075 states. [2019-09-10 06:15:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27075 states to 27075 states and 40889 transitions. [2019-09-10 06:15:44,069 INFO L78 Accepts]: Start accepts. Automaton has 27075 states and 40889 transitions. Word has length 308 [2019-09-10 06:15:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:44,069 INFO L475 AbstractCegarLoop]: Abstraction has 27075 states and 40889 transitions. [2019-09-10 06:15:44,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27075 states and 40889 transitions. [2019-09-10 06:15:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-10 06:15:44,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:44,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:44,125 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1715309788, now seen corresponding path program 1 times [2019-09-10 06:15:44,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:44,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:44,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:44,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:44,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:44,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:44,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:44,317 INFO L87 Difference]: Start difference. First operand 27075 states and 40889 transitions. Second operand 3 states. [2019-09-10 06:15:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:44,470 INFO L93 Difference]: Finished difference Result 53300 states and 80282 transitions. [2019-09-10 06:15:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:44,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-10 06:15:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:44,595 INFO L225 Difference]: With dead ends: 53300 [2019-09-10 06:15:44,596 INFO L226 Difference]: Without dead ends: 53300 [2019-09-10 06:15:44,596 INFO L628 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-09-10 06:15:44,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53300 states. [2019-09-10 06:15:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53300 to 27200. [2019-09-10 06:15:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27200 states. [2019-09-10 06:15:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27200 states to 27200 states and 41035 transitions. [2019-09-10 06:15:45,437 INFO L78 Accepts]: Start accepts. Automaton has 27200 states and 41035 transitions. Word has length 309 [2019-09-10 06:15:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:45,438 INFO L475 AbstractCegarLoop]: Abstraction has 27200 states and 41035 transitions. [2019-09-10 06:15:45,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 27200 states and 41035 transitions. [2019-09-10 06:15:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:15:45,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:45,477 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:45,477 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1582404856, now seen corresponding path program 1 times [2019-09-10 06:15:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:45,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:45,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:45,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:45,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:45,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:45,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:45,947 INFO L87 Difference]: Start difference. First operand 27200 states and 41035 transitions. Second operand 4 states. [2019-09-10 06:15:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:46,137 INFO L93 Difference]: Finished difference Result 28792 states and 43268 transitions. [2019-09-10 06:15:46,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:46,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-10 06:15:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:46,235 INFO L225 Difference]: With dead ends: 28792 [2019-09-10 06:15:46,236 INFO L226 Difference]: Without dead ends: 28044 [2019-09-10 06:15:46,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28044 states. [2019-09-10 06:15:46,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28044 to 28042. [2019-09-10 06:15:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28042 states. [2019-09-10 06:15:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28042 states to 28042 states and 42130 transitions. [2019-09-10 06:15:46,623 INFO L78 Accepts]: Start accepts. Automaton has 28042 states and 42130 transitions. Word has length 310 [2019-09-10 06:15:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:46,624 INFO L475 AbstractCegarLoop]: Abstraction has 28042 states and 42130 transitions. [2019-09-10 06:15:46,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 28042 states and 42130 transitions. [2019-09-10 06:15:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:15:46,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:46,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:46,658 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:46,659 INFO L82 PathProgramCache]: Analyzing trace with hash -170790130, now seen corresponding path program 1 times [2019-09-10 06:15:46,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:46,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:47,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:47,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:47,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:47,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:47,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:47,115 INFO L87 Difference]: Start difference. First operand 28042 states and 42130 transitions. Second operand 3 states. [2019-09-10 06:15:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:47,330 INFO L93 Difference]: Finished difference Result 54997 states and 82070 transitions. [2019-09-10 06:15:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:47,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:15:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:47,413 INFO L225 Difference]: With dead ends: 54997 [2019-09-10 06:15:47,414 INFO L226 Difference]: Without dead ends: 54997 [2019-09-10 06:15:47,414 INFO L628 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-09-10 06:15:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54997 states. [2019-09-10 06:15:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54997 to 54995. [2019-09-10 06:15:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54995 states. [2019-09-10 06:15:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54995 states to 54995 states and 82069 transitions. [2019-09-10 06:15:48,419 INFO L78 Accepts]: Start accepts. Automaton has 54995 states and 82069 transitions. Word has length 312 [2019-09-10 06:15:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:48,420 INFO L475 AbstractCegarLoop]: Abstraction has 54995 states and 82069 transitions. [2019-09-10 06:15:48,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54995 states and 82069 transitions. [2019-09-10 06:15:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:15:48,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:48,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:48,479 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:48,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash -807669141, now seen corresponding path program 1 times [2019-09-10 06:15:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:48,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:48,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:48,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:48,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:48,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:15:48,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:48,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:15:48,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:15:48,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:15:48,823 INFO L87 Difference]: Start difference. First operand 54995 states and 82069 transitions. Second operand 4 states. [2019-09-10 06:15:49,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:49,242 INFO L93 Difference]: Finished difference Result 108882 states and 162325 transitions. [2019-09-10 06:15:49,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:15:49,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:15:49,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:49,415 INFO L225 Difference]: With dead ends: 108882 [2019-09-10 06:15:49,416 INFO L226 Difference]: Without dead ends: 108882 [2019-09-10 06:15:49,418 INFO L628 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-09-10 06:15:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108882 states. [2019-09-10 06:15:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108882 to 56174. [2019-09-10 06:15:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56174 states. [2019-09-10 06:15:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56174 states to 56174 states and 84054 transitions. [2019-09-10 06:15:51,800 INFO L78 Accepts]: Start accepts. Automaton has 56174 states and 84054 transitions. Word has length 312 [2019-09-10 06:15:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:51,800 INFO L475 AbstractCegarLoop]: Abstraction has 56174 states and 84054 transitions. [2019-09-10 06:15:51,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:15:51,800 INFO L276 IsEmpty]: Start isEmpty. Operand 56174 states and 84054 transitions. [2019-09-10 06:15:51,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:15:51,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:51,853 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:51,853 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:51,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash 376159966, now seen corresponding path program 1 times [2019-09-10 06:15:51,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:51,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:51,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:51,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:51,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:51,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:51,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:51,987 INFO L87 Difference]: Start difference. First operand 56174 states and 84054 transitions. Second operand 3 states. [2019-09-10 06:15:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:52,299 INFO L93 Difference]: Finished difference Result 111103 states and 165886 transitions. [2019-09-10 06:15:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:52,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:15:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:52,452 INFO L225 Difference]: With dead ends: 111103 [2019-09-10 06:15:52,452 INFO L226 Difference]: Without dead ends: 111103 [2019-09-10 06:15:52,452 INFO L628 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-09-10 06:15:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111103 states. [2019-09-10 06:15:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111103 to 56444. [2019-09-10 06:15:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56444 states. [2019-09-10 06:15:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56444 states to 56444 states and 84404 transitions. [2019-09-10 06:15:53,815 INFO L78 Accepts]: Start accepts. Automaton has 56444 states and 84404 transitions. Word has length 312 [2019-09-10 06:15:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:53,816 INFO L475 AbstractCegarLoop]: Abstraction has 56444 states and 84404 transitions. [2019-09-10 06:15:53,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 56444 states and 84404 transitions. [2019-09-10 06:15:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:15:53,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:53,867 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:53,868 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1135007993, now seen corresponding path program 1 times [2019-09-10 06:15:53,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:53,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:53,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:53,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:53,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:54,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:54,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:54,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:54,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:54,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:54,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:54,016 INFO L87 Difference]: Start difference. First operand 56444 states and 84404 transitions. Second operand 3 states. [2019-09-10 06:15:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:54,351 INFO L93 Difference]: Finished difference Result 111315 states and 166100 transitions. [2019-09-10 06:15:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:54,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-10 06:15:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:54,508 INFO L225 Difference]: With dead ends: 111315 [2019-09-10 06:15:54,508 INFO L226 Difference]: Without dead ends: 111315 [2019-09-10 06:15:54,509 INFO L628 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-09-10 06:15:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111315 states. [2019-09-10 06:15:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111315 to 56736. [2019-09-10 06:15:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56736 states. [2019-09-10 06:15:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56736 states to 56736 states and 84742 transitions. [2019-09-10 06:15:57,015 INFO L78 Accepts]: Start accepts. Automaton has 56736 states and 84742 transitions. Word has length 313 [2019-09-10 06:15:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:57,016 INFO L475 AbstractCegarLoop]: Abstraction has 56736 states and 84742 transitions. [2019-09-10 06:15:57,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 56736 states and 84742 transitions. [2019-09-10 06:15:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:15:57,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:57,049 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:57,049 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash 418223679, now seen corresponding path program 1 times [2019-09-10 06:15:57,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:57,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:57,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:57,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:57,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:15:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:15:57,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:15:57,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:15:57,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:15:57,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:15:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:15:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:15:57,278 INFO L87 Difference]: Start difference. First operand 56736 states and 84742 transitions. Second operand 3 states. [2019-09-10 06:15:58,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:15:58,112 INFO L93 Difference]: Finished difference Result 103945 states and 153776 transitions. [2019-09-10 06:15:58,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:15:58,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:15:58,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:15:58,208 INFO L225 Difference]: With dead ends: 103945 [2019-09-10 06:15:58,208 INFO L226 Difference]: Without dead ends: 103945 [2019-09-10 06:15:58,209 INFO L628 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-09-10 06:15:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103945 states. [2019-09-10 06:15:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103945 to 103943. [2019-09-10 06:15:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103943 states. [2019-09-10 06:15:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103943 states to 103943 states and 153775 transitions. [2019-09-10 06:15:59,487 INFO L78 Accepts]: Start accepts. Automaton has 103943 states and 153775 transitions. Word has length 314 [2019-09-10 06:15:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:15:59,488 INFO L475 AbstractCegarLoop]: Abstraction has 103943 states and 153775 transitions. [2019-09-10 06:15:59,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:15:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 103943 states and 153775 transitions. [2019-09-10 06:15:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:15:59,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:15:59,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:15:59,551 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:15:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:15:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash -802420284, now seen corresponding path program 1 times [2019-09-10 06:15:59,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:15:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:15:59,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:15:59,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:15:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:00,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 06:16:00,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:00,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 06:16:00,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 06:16:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:16:00,591 INFO L87 Difference]: Start difference. First operand 103943 states and 153775 transitions. Second operand 18 states. [2019-09-10 06:16:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:06,805 INFO L93 Difference]: Finished difference Result 176487 states and 266115 transitions. [2019-09-10 06:16:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:16:06,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 314 [2019-09-10 06:16:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:07,086 INFO L225 Difference]: With dead ends: 176487 [2019-09-10 06:16:07,086 INFO L226 Difference]: Without dead ends: 176487 [2019-09-10 06:16:07,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:16:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176487 states. [2019-09-10 06:16:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176487 to 112254. [2019-09-10 06:16:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112254 states. [2019-09-10 06:16:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112254 states to 112254 states and 165134 transitions. [2019-09-10 06:16:09,562 INFO L78 Accepts]: Start accepts. Automaton has 112254 states and 165134 transitions. Word has length 314 [2019-09-10 06:16:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:09,563 INFO L475 AbstractCegarLoop]: Abstraction has 112254 states and 165134 transitions. [2019-09-10 06:16:09,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 06:16:09,563 INFO L276 IsEmpty]: Start isEmpty. Operand 112254 states and 165134 transitions. [2019-09-10 06:16:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:09,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:09,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:09,653 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:09,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:09,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1465741368, now seen corresponding path program 1 times [2019-09-10 06:16:09,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:09,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:09,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:09,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 06:16:10,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:10,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 06:16:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 06:16:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 06:16:10,701 INFO L87 Difference]: Start difference. First operand 112254 states and 165134 transitions. Second operand 14 states. [2019-09-10 06:16:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:13,724 INFO L93 Difference]: Finished difference Result 178367 states and 265597 transitions. [2019-09-10 06:16:13,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 06:16:13,725 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 314 [2019-09-10 06:16:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:13,929 INFO L225 Difference]: With dead ends: 178367 [2019-09-10 06:16:13,929 INFO L226 Difference]: Without dead ends: 178367 [2019-09-10 06:16:13,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2019-09-10 06:16:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178367 states. [2019-09-10 06:16:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178367 to 116010. [2019-09-10 06:16:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116010 states. [2019-09-10 06:16:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116010 states to 116010 states and 170304 transitions. [2019-09-10 06:16:18,051 INFO L78 Accepts]: Start accepts. Automaton has 116010 states and 170304 transitions. Word has length 314 [2019-09-10 06:16:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:18,052 INFO L475 AbstractCegarLoop]: Abstraction has 116010 states and 170304 transitions. [2019-09-10 06:16:18,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 06:16:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 116010 states and 170304 transitions. [2019-09-10 06:16:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:18,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:18,133 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:18,133 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 710969335, now seen corresponding path program 1 times [2019-09-10 06:16:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:18,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:19,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:19,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:16:19,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:19,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:16:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:16:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:16:19,300 INFO L87 Difference]: Start difference. First operand 116010 states and 170304 transitions. Second operand 17 states. [2019-09-10 06:16:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:23,275 INFO L93 Difference]: Finished difference Result 184158 states and 274655 transitions. [2019-09-10 06:16:23,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-10 06:16:23,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 314 [2019-09-10 06:16:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:23,463 INFO L225 Difference]: With dead ends: 184158 [2019-09-10 06:16:23,464 INFO L226 Difference]: Without dead ends: 184158 [2019-09-10 06:16:23,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=1225, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 06:16:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184158 states. [2019-09-10 06:16:25,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184158 to 118922. [2019-09-10 06:16:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118922 states. [2019-09-10 06:16:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118922 states to 118922 states and 174288 transitions. [2019-09-10 06:16:25,525 INFO L78 Accepts]: Start accepts. Automaton has 118922 states and 174288 transitions. Word has length 314 [2019-09-10 06:16:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:25,526 INFO L475 AbstractCegarLoop]: Abstraction has 118922 states and 174288 transitions. [2019-09-10 06:16:25,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:16:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 118922 states and 174288 transitions. [2019-09-10 06:16:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:25,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:25,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:25,603 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:25,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:25,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1955066345, now seen corresponding path program 1 times [2019-09-10 06:16:25,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:25,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:25,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:26,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:26,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:26,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:26,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:26,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:26,014 INFO L87 Difference]: Start difference. First operand 118922 states and 174288 transitions. Second operand 4 states. [2019-09-10 06:16:26,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:26,737 INFO L93 Difference]: Finished difference Result 231250 states and 336814 transitions. [2019-09-10 06:16:26,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:26,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:16:26,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:26,995 INFO L225 Difference]: With dead ends: 231250 [2019-09-10 06:16:26,996 INFO L226 Difference]: Without dead ends: 231250 [2019-09-10 06:16:26,996 INFO L628 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-09-10 06:16:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231250 states. [2019-09-10 06:16:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231250 to 231248. [2019-09-10 06:16:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231248 states. [2019-09-10 06:16:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231248 states to 231248 states and 336813 transitions. [2019-09-10 06:16:32,131 INFO L78 Accepts]: Start accepts. Automaton has 231248 states and 336813 transitions. Word has length 314 [2019-09-10 06:16:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:32,131 INFO L475 AbstractCegarLoop]: Abstraction has 231248 states and 336813 transitions. [2019-09-10 06:16:32,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 231248 states and 336813 transitions. [2019-09-10 06:16:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:33,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:33,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:33,080 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1762794574, now seen corresponding path program 1 times [2019-09-10 06:16:33,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:33,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:33,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:33,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:33,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:33,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:33,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:33,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:33,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:33,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:33,440 INFO L87 Difference]: Start difference. First operand 231248 states and 336813 transitions. Second operand 4 states. [2019-09-10 06:16:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:34,218 INFO L93 Difference]: Finished difference Result 243862 states and 353296 transitions. [2019-09-10 06:16:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:34,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:16:34,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:34,498 INFO L225 Difference]: With dead ends: 243862 [2019-09-10 06:16:34,498 INFO L226 Difference]: Without dead ends: 237443 [2019-09-10 06:16:34,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237443 states. [2019-09-10 06:16:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237443 to 237393. [2019-09-10 06:16:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237393 states. [2019-09-10 06:16:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237393 states to 237393 states and 343871 transitions. [2019-09-10 06:16:40,758 INFO L78 Accepts]: Start accepts. Automaton has 237393 states and 343871 transitions. Word has length 314 [2019-09-10 06:16:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:40,758 INFO L475 AbstractCegarLoop]: Abstraction has 237393 states and 343871 transitions. [2019-09-10 06:16:40,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 237393 states and 343871 transitions. [2019-09-10 06:16:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:40,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:40,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:40,911 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 483456937, now seen corresponding path program 1 times [2019-09-10 06:16:40,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:40,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:40,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:41,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:41,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:41,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:41,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:41,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:41,139 INFO L87 Difference]: Start difference. First operand 237393 states and 343871 transitions. Second operand 4 states. [2019-09-10 06:16:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:43,381 INFO L93 Difference]: Finished difference Result 472283 states and 683844 transitions. [2019-09-10 06:16:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:43,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:16:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:43,889 INFO L225 Difference]: With dead ends: 472283 [2019-09-10 06:16:43,889 INFO L226 Difference]: Without dead ends: 472283 [2019-09-10 06:16:43,889 INFO L628 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-09-10 06:16:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472283 states. [2019-09-10 06:16:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472283 to 242630. [2019-09-10 06:16:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242630 states. [2019-09-10 06:16:52,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242630 states to 242630 states and 351828 transitions. [2019-09-10 06:16:52,491 INFO L78 Accepts]: Start accepts. Automaton has 242630 states and 351828 transitions. Word has length 314 [2019-09-10 06:16:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:16:52,491 INFO L475 AbstractCegarLoop]: Abstraction has 242630 states and 351828 transitions. [2019-09-10 06:16:52,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:16:52,491 INFO L276 IsEmpty]: Start isEmpty. Operand 242630 states and 351828 transitions. [2019-09-10 06:16:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:16:53,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:16:53,454 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:16:53,454 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:16:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:16:53,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1897180684, now seen corresponding path program 1 times [2019-09-10 06:16:53,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:16:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:53,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:16:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:16:53,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:16:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:16:53,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:16:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:16:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:16:53,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:16:53,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:16:53,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:16:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:16:53,863 INFO L87 Difference]: Start difference. First operand 242630 states and 351828 transitions. Second operand 4 states. [2019-09-10 06:16:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:16:55,338 INFO L93 Difference]: Finished difference Result 472411 states and 678826 transitions. [2019-09-10 06:16:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:16:55,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:16:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:16:55,886 INFO L225 Difference]: With dead ends: 472411 [2019-09-10 06:16:55,887 INFO L226 Difference]: Without dead ends: 472411 [2019-09-10 06:16:55,887 INFO L628 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-09-10 06:16:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472411 states. [2019-09-10 06:17:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472411 to 472409. [2019-09-10 06:17:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472409 states. [2019-09-10 06:17:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472409 states to 472409 states and 678825 transitions. [2019-09-10 06:17:07,886 INFO L78 Accepts]: Start accepts. Automaton has 472409 states and 678825 transitions. Word has length 314 [2019-09-10 06:17:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:07,886 INFO L475 AbstractCegarLoop]: Abstraction has 472409 states and 678825 transitions. [2019-09-10 06:17:07,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:17:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 472409 states and 678825 transitions. [2019-09-10 06:17:08,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:17:08,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:08,286 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:17:08,287 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:08,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1893492335, now seen corresponding path program 1 times [2019-09-10 06:17:08,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:08,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:08,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:14,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:14,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:14,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:14,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:14,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:14,760 INFO L87 Difference]: Start difference. First operand 472409 states and 678825 transitions. Second operand 3 states. [2019-09-10 06:17:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:17:17,866 INFO L93 Difference]: Finished difference Result 925357 states and 1318531 transitions. [2019-09-10 06:17:17,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:17:17,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:17:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:17:18,804 INFO L225 Difference]: With dead ends: 925357 [2019-09-10 06:17:18,805 INFO L226 Difference]: Without dead ends: 925357 [2019-09-10 06:17:18,805 INFO L628 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-09-10 06:17:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925357 states. [2019-09-10 06:17:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925357 to 925355. [2019-09-10 06:17:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 925355 states. [2019-09-10 06:17:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925355 states to 925355 states and 1318530 transitions. [2019-09-10 06:17:49,285 INFO L78 Accepts]: Start accepts. Automaton has 925355 states and 1318530 transitions. Word has length 316 [2019-09-10 06:17:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:17:49,286 INFO L475 AbstractCegarLoop]: Abstraction has 925355 states and 1318530 transitions. [2019-09-10 06:17:49,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:17:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 925355 states and 1318530 transitions. [2019-09-10 06:17:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:17:49,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:17:49,862 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:17:49,863 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:17:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:17:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1727485654, now seen corresponding path program 1 times [2019-09-10 06:17:49,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:17:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:17:49,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:17:49,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:17:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:17:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:17:49,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:17:49,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:17:49,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:17:49,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:17:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:17:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:17:49,980 INFO L87 Difference]: Start difference. First operand 925355 states and 1318530 transitions. Second operand 3 states. [2019-09-10 06:18:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:02,695 INFO L93 Difference]: Finished difference Result 1833122 states and 2610468 transitions. [2019-09-10 06:18:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:02,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:18:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:05,471 INFO L225 Difference]: With dead ends: 1833122 [2019-09-10 06:18:05,471 INFO L226 Difference]: Without dead ends: 1833122 [2019-09-10 06:18:05,472 INFO L628 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-09-10 06:18:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833122 states. [2019-09-10 06:18:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833122 to 926100. [2019-09-10 06:18:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926100 states. [2019-09-10 06:18:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926100 states to 926100 states and 1319344 transitions. [2019-09-10 06:18:48,419 INFO L78 Accepts]: Start accepts. Automaton has 926100 states and 1319344 transitions. Word has length 316 [2019-09-10 06:18:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:48,420 INFO L475 AbstractCegarLoop]: Abstraction has 926100 states and 1319344 transitions. [2019-09-10 06:18:48,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 926100 states and 1319344 transitions. [2019-09-10 06:18:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:18:51,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:51,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:18:51,170 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:51,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:51,171 INFO L82 PathProgramCache]: Analyzing trace with hash -148461779, now seen corresponding path program 1 times [2019-09-10 06:18:51,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:51,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:51,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:51,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:51,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:51,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:51,290 INFO L87 Difference]: Start difference. First operand 926100 states and 1319344 transitions. Second operand 3 states. [2019-09-10 06:19:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:11,746 INFO L93 Difference]: Finished difference Result 1848480 states and 2632448 transitions. [2019-09-10 06:19:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:11,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 06:19:11,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:14,235 INFO L225 Difference]: With dead ends: 1848480 [2019-09-10 06:19:14,235 INFO L226 Difference]: Without dead ends: 1848480 [2019-09-10 06:19:14,236 INFO L628 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-09-10 06:19:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848480 states. [2019-09-10 06:19:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848480 to 926986. [2019-09-10 06:19:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926986 states. [2019-09-10 06:19:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926986 states to 926986 states and 1320359 transitions. [2019-09-10 06:19:46,716 INFO L78 Accepts]: Start accepts. Automaton has 926986 states and 1320359 transitions. Word has length 317 [2019-09-10 06:19:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:46,716 INFO L475 AbstractCegarLoop]: Abstraction has 926986 states and 1320359 transitions. [2019-09-10 06:19:46,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 926986 states and 1320359 transitions. [2019-09-10 06:19:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:19:47,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:47,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-10 06:19:47,580 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1413778092, now seen corresponding path program 1 times [2019-09-10 06:19:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:47,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:47,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:56,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:56,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:56,919 INFO L87 Difference]: Start difference. First operand 926986 states and 1320359 transitions. Second operand 3 states. [2019-09-10 06:20:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:02,865 INFO L93 Difference]: Finished difference Result 1729123 states and 2438895 transitions. [2019-09-10 06:20:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:20:02,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 06:20:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:16,247 INFO L225 Difference]: With dead ends: 1729123 [2019-09-10 06:20:16,248 INFO L226 Difference]: Without dead ends: 1729123 [2019-09-10 06:20:16,248 INFO L628 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-09-10 06:20:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729123 states. [2019-09-10 06:20:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729123 to 1729121. [2019-09-10 06:20:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1729121 states.