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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:49:24,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:49:24,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:49:24,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:49:24,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:49:24,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:49:24,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:49:24,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:49:24,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:49:24,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:49:24,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:49:24,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:49:24,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:49:24,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:49:24,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:49:24,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:49:24,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:49:24,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:49:24,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:49:24,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:49:24,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:49:24,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:49:24,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:49:25,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:49:25,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:49:25,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:49:25,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:49:25,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:49:25,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:49:25,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:49:25,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:49:25,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:49:25,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:49:25,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:49:25,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:49:25,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:49:25,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:49:25,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:49:25,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:49:25,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:49:25,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:49:25,013 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 08:49:25,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:49:25,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:49:25,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:49:25,035 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:49:25,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:49:25,036 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:49:25,036 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:49:25,036 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:49:25,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:49:25,037 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:49:25,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:49:25,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:49:25,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:49:25,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:49:25,039 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:49:25,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:49:25,040 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:49:25,040 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:49:25,040 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:49:25,041 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:49:25,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:49:25,041 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:49:25,042 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:49:25,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:49:25,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:49:25,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:49:25,042 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:49:25,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:49:25,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:49:25,044 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:49:25,092 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:49:25,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:49:25,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:49:25,110 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:49:25,111 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:49:25,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:49:25,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ab06ab4/c9b33711916c4a88a1ddee8f389f5a26/FLAG42cc54ffd [2019-09-10 08:49:25,868 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:49:25,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:49:25,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ab06ab4/c9b33711916c4a88a1ddee8f389f5a26/FLAG42cc54ffd [2019-09-10 08:49:26,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ab06ab4/c9b33711916c4a88a1ddee8f389f5a26 [2019-09-10 08:49:26,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:49:26,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:49:26,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:49:26,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:49:26,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:49:26,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:49:26" (1/1) ... [2019-09-10 08:49:26,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315d73c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:26, skipping insertion in model container [2019-09-10 08:49:26,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:49:26" (1/1) ... [2019-09-10 08:49:26,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:49:26,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:49:27,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:49:27,249 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:49:27,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:49:27,740 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:49:27,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27 WrapperNode [2019-09-10 08:49:27,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:49:27,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:49:27,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:49:27,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:49:27,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (1/1) ... [2019-09-10 08:49:27,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:49:27,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:49:27,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:49:27,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:49:27,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (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 08:49:28,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:49:28,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:49:28,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:49:28,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:49:28,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:49:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:49:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:49:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:49:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:49:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:49:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:49:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:49:28,015 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:49:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:49:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:49:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:49:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:49:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:49:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:49:28,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:49:30,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:49:30,664 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:49:30,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:49:30 BoogieIcfgContainer [2019-09-10 08:49:30,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:49:30,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:49:30,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:49:30,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:49:30,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:49:26" (1/3) ... [2019-09-10 08:49:30,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b90e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:49:30, skipping insertion in model container [2019-09-10 08:49:30,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:49:27" (2/3) ... [2019-09-10 08:49:30,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b90e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:49:30, skipping insertion in model container [2019-09-10 08:49:30,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:49:30" (3/3) ... [2019-09-10 08:49:30,674 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 08:49:30,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:49:30,693 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:49:30,710 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:49:30,738 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:49:30,738 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:49:30,739 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:49:30,739 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:49:30,739 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:49:30,739 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:49:30,739 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:49:30,739 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:49:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-09-10 08:49:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:49:30,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:30,799 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 08:49:30,801 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 539385033, now seen corresponding path program 1 times [2019-09-10 08:49:30,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:30,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:31,746 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 08:49:31,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:31,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:31,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:31,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:31,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:31,773 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 3 states. [2019-09-10 08:49:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:32,141 INFO L93 Difference]: Finished difference Result 1307 states and 2300 transitions. [2019-09-10 08:49:32,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:32,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:49:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:32,184 INFO L225 Difference]: With dead ends: 1307 [2019-09-10 08:49:32,184 INFO L226 Difference]: Without dead ends: 1299 [2019-09-10 08:49:32,188 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 08:49:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-09-10 08:49:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1297. [2019-09-10 08:49:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-09-10 08:49:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 2028 transitions. [2019-09-10 08:49:32,334 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 2028 transitions. Word has length 318 [2019-09-10 08:49:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:32,338 INFO L475 AbstractCegarLoop]: Abstraction has 1297 states and 2028 transitions. [2019-09-10 08:49:32,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2028 transitions. [2019-09-10 08:49:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:49:32,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:32,355 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 08:49:32,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1328544871, now seen corresponding path program 1 times [2019-09-10 08:49:32,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:32,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:32,760 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 08:49:32,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:32,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:32,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:32,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:32,767 INFO L87 Difference]: Start difference. First operand 1297 states and 2028 transitions. Second operand 3 states. [2019-09-10 08:49:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:33,005 INFO L93 Difference]: Finished difference Result 2249 states and 3501 transitions. [2019-09-10 08:49:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:33,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 08:49:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:33,019 INFO L225 Difference]: With dead ends: 2249 [2019-09-10 08:49:33,020 INFO L226 Difference]: Without dead ends: 2249 [2019-09-10 08:49:33,021 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 08:49:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-09-10 08:49:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-09-10 08:49:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-09-10 08:49:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3500 transitions. [2019-09-10 08:49:33,091 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3500 transitions. Word has length 318 [2019-09-10 08:49:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:33,092 INFO L475 AbstractCegarLoop]: Abstraction has 2247 states and 3500 transitions. [2019-09-10 08:49:33,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3500 transitions. [2019-09-10 08:49:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 08:49:33,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:33,101 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 08:49:33,102 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 183715048, now seen corresponding path program 1 times [2019-09-10 08:49:33,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:33,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:33,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:33,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:33,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:33,965 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 08:49:33,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:33,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:33,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:33,969 INFO L87 Difference]: Start difference. First operand 2247 states and 3500 transitions. Second operand 4 states. [2019-09-10 08:49:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:34,178 INFO L93 Difference]: Finished difference Result 4402 states and 6815 transitions. [2019-09-10 08:49:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:34,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 08:49:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:34,211 INFO L225 Difference]: With dead ends: 4402 [2019-09-10 08:49:34,212 INFO L226 Difference]: Without dead ends: 4402 [2019-09-10 08:49:34,212 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 08:49:34,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-09-10 08:49:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4400. [2019-09-10 08:49:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2019-09-10 08:49:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 6814 transitions. [2019-09-10 08:49:34,351 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 6814 transitions. Word has length 318 [2019-09-10 08:49:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:34,352 INFO L475 AbstractCegarLoop]: Abstraction has 4400 states and 6814 transitions. [2019-09-10 08:49:34,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 6814 transitions. [2019-09-10 08:49:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:49:34,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:34,366 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, 1, 1] [2019-09-10 08:49:34,367 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1361787525, now seen corresponding path program 1 times [2019-09-10 08:49:34,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:34,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:34,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:34,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:34,739 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 08:49:34,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:34,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:34,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:34,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:34,741 INFO L87 Difference]: Start difference. First operand 4400 states and 6814 transitions. Second operand 3 states. [2019-09-10 08:49:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:34,877 INFO L93 Difference]: Finished difference Result 8628 states and 13284 transitions. [2019-09-10 08:49:34,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:34,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:49:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:34,919 INFO L225 Difference]: With dead ends: 8628 [2019-09-10 08:49:34,919 INFO L226 Difference]: Without dead ends: 8628 [2019-09-10 08:49:34,920 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 08:49:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2019-09-10 08:49:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8626. [2019-09-10 08:49:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8626 states. [2019-09-10 08:49:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8626 states to 8626 states and 13283 transitions. [2019-09-10 08:49:35,146 INFO L78 Accepts]: Start accepts. Automaton has 8626 states and 13283 transitions. Word has length 320 [2019-09-10 08:49:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:35,146 INFO L475 AbstractCegarLoop]: Abstraction has 8626 states and 13283 transitions. [2019-09-10 08:49:35,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8626 states and 13283 transitions. [2019-09-10 08:49:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 08:49:35,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:35,166 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, 1, 1] [2019-09-10 08:49:35,167 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1487447872, now seen corresponding path program 1 times [2019-09-10 08:49:35,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:35,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:35,414 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 08:49:35,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:35,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:35,415 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:35,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:35,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:35,417 INFO L87 Difference]: Start difference. First operand 8626 states and 13283 transitions. Second operand 3 states. [2019-09-10 08:49:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:35,571 INFO L93 Difference]: Finished difference Result 17219 states and 26506 transitions. [2019-09-10 08:49:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:35,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 08:49:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:35,649 INFO L225 Difference]: With dead ends: 17219 [2019-09-10 08:49:35,650 INFO L226 Difference]: Without dead ends: 17219 [2019-09-10 08:49:35,650 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 08:49:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17219 states. [2019-09-10 08:49:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17219 to 8645. [2019-09-10 08:49:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-09-10 08:49:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13311 transitions. [2019-09-10 08:49:35,920 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13311 transitions. Word has length 320 [2019-09-10 08:49:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:35,920 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13311 transitions. [2019-09-10 08:49:35,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13311 transitions. [2019-09-10 08:49:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 08:49:35,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:35,942 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, 1, 1, 1] [2019-09-10 08:49:35,942 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:35,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:35,942 INFO L82 PathProgramCache]: Analyzing trace with hash 415483124, now seen corresponding path program 1 times [2019-09-10 08:49:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:35,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:35,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:36,243 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 08:49:36,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:36,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:36,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:36,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:36,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:36,246 INFO L87 Difference]: Start difference. First operand 8645 states and 13311 transitions. Second operand 3 states. [2019-09-10 08:49:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:36,367 INFO L93 Difference]: Finished difference Result 17237 states and 26527 transitions. [2019-09-10 08:49:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:36,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 08:49:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:36,417 INFO L225 Difference]: With dead ends: 17237 [2019-09-10 08:49:36,417 INFO L226 Difference]: Without dead ends: 17237 [2019-09-10 08:49:36,418 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 08:49:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17237 states. [2019-09-10 08:49:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17237 to 8663. [2019-09-10 08:49:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8663 states. [2019-09-10 08:49:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8663 states to 8663 states and 13332 transitions. [2019-09-10 08:49:36,702 INFO L78 Accepts]: Start accepts. Automaton has 8663 states and 13332 transitions. Word has length 321 [2019-09-10 08:49:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:36,703 INFO L475 AbstractCegarLoop]: Abstraction has 8663 states and 13332 transitions. [2019-09-10 08:49:36,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 8663 states and 13332 transitions. [2019-09-10 08:49:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:49:36,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:36,728 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, 1, 1, 1, 1] [2019-09-10 08:49:36,729 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1540137930, now seen corresponding path program 1 times [2019-09-10 08:49:36,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:36,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:36,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:36,988 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 08:49:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:36,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:36,988 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:36,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:36,990 INFO L87 Difference]: Start difference. First operand 8663 states and 13332 transitions. Second operand 3 states. [2019-09-10 08:49:37,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:37,168 INFO L93 Difference]: Finished difference Result 16892 states and 25821 transitions. [2019-09-10 08:49:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:37,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 08:49:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:37,205 INFO L225 Difference]: With dead ends: 16892 [2019-09-10 08:49:37,205 INFO L226 Difference]: Without dead ends: 16892 [2019-09-10 08:49:37,205 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 08:49:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16892 states. [2019-09-10 08:49:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16892 to 16890. [2019-09-10 08:49:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-09-10 08:49:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 25820 transitions. [2019-09-10 08:49:37,496 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 25820 transitions. Word has length 322 [2019-09-10 08:49:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:37,497 INFO L475 AbstractCegarLoop]: Abstraction has 16890 states and 25820 transitions. [2019-09-10 08:49:37,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 25820 transitions. [2019-09-10 08:49:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 08:49:37,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:37,528 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, 1, 1, 1, 1] [2019-09-10 08:49:37,528 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -301419309, now seen corresponding path program 1 times [2019-09-10 08:49:37,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:37,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:37,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:37,932 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 08:49:37,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:37,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:37,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:37,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:37,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:37,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:37,934 INFO L87 Difference]: Start difference. First operand 16890 states and 25820 transitions. Second operand 4 states. [2019-09-10 08:49:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:38,090 INFO L93 Difference]: Finished difference Result 31480 states and 48012 transitions. [2019-09-10 08:49:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:38,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 08:49:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:38,154 INFO L225 Difference]: With dead ends: 31480 [2019-09-10 08:49:38,154 INFO L226 Difference]: Without dead ends: 31480 [2019-09-10 08:49:38,154 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 08:49:38,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31480 states. [2019-09-10 08:49:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31480 to 17125. [2019-09-10 08:49:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17125 states. [2019-09-10 08:49:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 26208 transitions. [2019-09-10 08:49:38,743 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 26208 transitions. Word has length 322 [2019-09-10 08:49:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:38,744 INFO L475 AbstractCegarLoop]: Abstraction has 17125 states and 26208 transitions. [2019-09-10 08:49:38,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 26208 transitions. [2019-09-10 08:49:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:49:38,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:38,776 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:38,776 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:38,777 INFO L82 PathProgramCache]: Analyzing trace with hash -395160752, now seen corresponding path program 1 times [2019-09-10 08:49:38,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:38,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:38,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:38,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:38,942 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 08:49:38,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:38,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:38,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:38,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:38,944 INFO L87 Difference]: Start difference. First operand 17125 states and 26208 transitions. Second operand 3 states. [2019-09-10 08:49:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:39,087 INFO L93 Difference]: Finished difference Result 26599 states and 40973 transitions. [2019-09-10 08:49:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:39,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:49:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:39,136 INFO L225 Difference]: With dead ends: 26599 [2019-09-10 08:49:39,137 INFO L226 Difference]: Without dead ends: 26599 [2019-09-10 08:49:39,137 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 08:49:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26599 states. [2019-09-10 08:49:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26599 to 21189. [2019-09-10 08:49:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21189 states. [2019-09-10 08:49:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21189 states to 21189 states and 32908 transitions. [2019-09-10 08:49:40,335 INFO L78 Accepts]: Start accepts. Automaton has 21189 states and 32908 transitions. Word has length 324 [2019-09-10 08:49:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:40,336 INFO L475 AbstractCegarLoop]: Abstraction has 21189 states and 32908 transitions. [2019-09-10 08:49:40,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21189 states and 32908 transitions. [2019-09-10 08:49:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:49:40,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:40,376 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, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:40,377 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -54184761, now seen corresponding path program 1 times [2019-09-10 08:49:40,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:40,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:40,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:40,541 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 08:49:40,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:40,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:40,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:40,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:40,543 INFO L87 Difference]: Start difference. First operand 21189 states and 32908 transitions. Second operand 3 states. [2019-09-10 08:49:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:40,669 INFO L93 Difference]: Finished difference Result 41611 states and 64460 transitions. [2019-09-10 08:49:40,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:40,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:49:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:40,720 INFO L225 Difference]: With dead ends: 41611 [2019-09-10 08:49:40,720 INFO L226 Difference]: Without dead ends: 41611 [2019-09-10 08:49:40,720 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 08:49:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41611 states. [2019-09-10 08:49:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41611 to 21293. [2019-09-10 08:49:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21293 states. [2019-09-10 08:49:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 33051 transitions. [2019-09-10 08:49:41,182 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 33051 transitions. Word has length 324 [2019-09-10 08:49:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:41,183 INFO L475 AbstractCegarLoop]: Abstraction has 21293 states and 33051 transitions. [2019-09-10 08:49:41,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 33051 transitions. [2019-09-10 08:49:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 08:49:41,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:41,206 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:41,207 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:41,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:41,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1092389941, now seen corresponding path program 1 times [2019-09-10 08:49:41,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:41,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:41,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:41,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:41,474 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 08:49:41,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:41,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:41,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:41,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:41,477 INFO L87 Difference]: Start difference. First operand 21293 states and 33051 transitions. Second operand 3 states. [2019-09-10 08:49:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:41,690 INFO L93 Difference]: Finished difference Result 41736 states and 64606 transitions. [2019-09-10 08:49:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:41,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-10 08:49:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:41,739 INFO L225 Difference]: With dead ends: 41736 [2019-09-10 08:49:41,740 INFO L226 Difference]: Without dead ends: 41736 [2019-09-10 08:49:41,742 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 08:49:41,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41736 states. [2019-09-10 08:49:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41736 to 21418. [2019-09-10 08:49:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21418 states. [2019-09-10 08:49:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21418 states to 21418 states and 33197 transitions. [2019-09-10 08:49:42,266 INFO L78 Accepts]: Start accepts. Automaton has 21418 states and 33197 transitions. Word has length 325 [2019-09-10 08:49:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:42,267 INFO L475 AbstractCegarLoop]: Abstraction has 21418 states and 33197 transitions. [2019-09-10 08:49:42,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21418 states and 33197 transitions. [2019-09-10 08:49:42,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:49:42,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:42,286 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1223465517, now seen corresponding path program 1 times [2019-09-10 08:49:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:42,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:42,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:42,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:42,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:42,480 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 08:49:42,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:42,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:49:42,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:42,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:49:42,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:49:42,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:49:42,483 INFO L87 Difference]: Start difference. First operand 21418 states and 33197 transitions. Second operand 3 states. [2019-09-10 08:49:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:42,637 INFO L93 Difference]: Finished difference Result 33164 states and 51690 transitions. [2019-09-10 08:49:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:49:42,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:49:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:42,683 INFO L225 Difference]: With dead ends: 33164 [2019-09-10 08:49:42,683 INFO L226 Difference]: Without dead ends: 33164 [2019-09-10 08:49:42,684 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 08:49:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33164 states. [2019-09-10 08:49:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33164 to 28682. [2019-09-10 08:49:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-09-10 08:49:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 45113 transitions. [2019-09-10 08:49:43,279 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 45113 transitions. Word has length 326 [2019-09-10 08:49:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:43,280 INFO L475 AbstractCegarLoop]: Abstraction has 28682 states and 45113 transitions. [2019-09-10 08:49:43,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:49:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 45113 transitions. [2019-09-10 08:49:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:49:43,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:43,297 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:43,297 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1016185114, now seen corresponding path program 1 times [2019-09-10 08:49:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:43,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:43,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:43,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:43,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:43,821 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 08:49:43,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:43,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:43,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:43,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:43,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:43,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:43,823 INFO L87 Difference]: Start difference. First operand 28682 states and 45113 transitions. Second operand 4 states. [2019-09-10 08:49:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:44,005 INFO L93 Difference]: Finished difference Result 30358 states and 47402 transitions. [2019-09-10 08:49:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:44,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-10 08:49:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:44,047 INFO L225 Difference]: With dead ends: 30358 [2019-09-10 08:49:44,047 INFO L226 Difference]: Without dead ends: 29568 [2019-09-10 08:49:44,047 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 08:49:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29568 states. [2019-09-10 08:49:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29568 to 29566. [2019-09-10 08:49:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29566 states. [2019-09-10 08:49:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29566 states to 29566 states and 46210 transitions. [2019-09-10 08:49:44,448 INFO L78 Accepts]: Start accepts. Automaton has 29566 states and 46210 transitions. Word has length 326 [2019-09-10 08:49:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:44,449 INFO L475 AbstractCegarLoop]: Abstraction has 29566 states and 46210 transitions. [2019-09-10 08:49:44,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:49:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29566 states and 46210 transitions. [2019-09-10 08:49:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:49:44,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:44,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:44,471 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:44,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash -403823476, now seen corresponding path program 1 times [2019-09-10 08:49:44,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:44,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:44,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:45,334 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 08:49:45,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:49:45,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:45,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:49:45,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:49:45,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:49:45,337 INFO L87 Difference]: Start difference. First operand 29566 states and 46210 transitions. Second operand 8 states. [2019-09-10 08:49:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:48,417 INFO L93 Difference]: Finished difference Result 132124 states and 207839 transitions. [2019-09-10 08:49:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:49:48,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-09-10 08:49:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:48,594 INFO L225 Difference]: With dead ends: 132124 [2019-09-10 08:49:48,595 INFO L226 Difference]: Without dead ends: 132124 [2019-09-10 08:49:48,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:49:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132124 states. [2019-09-10 08:49:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132124 to 73270. [2019-09-10 08:49:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73270 states. [2019-09-10 08:49:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73270 states to 73270 states and 114042 transitions. [2019-09-10 08:49:50,769 INFO L78 Accepts]: Start accepts. Automaton has 73270 states and 114042 transitions. Word has length 327 [2019-09-10 08:49:50,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:50,769 INFO L475 AbstractCegarLoop]: Abstraction has 73270 states and 114042 transitions. [2019-09-10 08:49:50,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:49:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 73270 states and 114042 transitions. [2019-09-10 08:49:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:49:50,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:50,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:50,808 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1533969227, now seen corresponding path program 1 times [2019-09-10 08:49:50,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:50,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:51,287 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 08:49:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:51,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:49:51,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:51,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:49:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:49:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:49:51,289 INFO L87 Difference]: Start difference. First operand 73270 states and 114042 transitions. Second operand 10 states. [2019-09-10 08:49:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:54,063 INFO L93 Difference]: Finished difference Result 160500 states and 248834 transitions. [2019-09-10 08:49:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:49:54,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 327 [2019-09-10 08:49:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:54,224 INFO L225 Difference]: With dead ends: 160500 [2019-09-10 08:49:54,224 INFO L226 Difference]: Without dead ends: 160500 [2019-09-10 08:49:54,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:49:54,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160500 states. [2019-09-10 08:49:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160500 to 112016. [2019-09-10 08:49:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112016 states. [2019-09-10 08:49:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112016 states to 112016 states and 173518 transitions. [2019-09-10 08:49:57,530 INFO L78 Accepts]: Start accepts. Automaton has 112016 states and 173518 transitions. Word has length 327 [2019-09-10 08:49:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:49:57,530 INFO L475 AbstractCegarLoop]: Abstraction has 112016 states and 173518 transitions. [2019-09-10 08:49:57,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:49:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 112016 states and 173518 transitions. [2019-09-10 08:49:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:49:57,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:49:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:49:57,580 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:49:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:49:57,581 INFO L82 PathProgramCache]: Analyzing trace with hash -397615245, now seen corresponding path program 1 times [2019-09-10 08:49:57,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:49:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:57,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:49:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:49:57,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:49:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:49:58,050 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 08:49:58,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:49:58,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:49:58,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:49:58,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:49:58,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:49:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:49:58,054 INFO L87 Difference]: Start difference. First operand 112016 states and 173518 transitions. Second operand 4 states. [2019-09-10 08:49:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:49:58,553 INFO L93 Difference]: Finished difference Result 134002 states and 208415 transitions. [2019-09-10 08:49:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:49:58,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 08:49:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:49:58,713 INFO L225 Difference]: With dead ends: 134002 [2019-09-10 08:49:58,713 INFO L226 Difference]: Without dead ends: 134002 [2019-09-10 08:49:58,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 08:49:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134002 states. [2019-09-10 08:50:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134002 to 86608. [2019-09-10 08:50:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86608 states. [2019-09-10 08:50:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86608 states to 86608 states and 135050 transitions. [2019-09-10 08:50:01,972 INFO L78 Accepts]: Start accepts. Automaton has 86608 states and 135050 transitions. Word has length 327 [2019-09-10 08:50:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:01,972 INFO L475 AbstractCegarLoop]: Abstraction has 86608 states and 135050 transitions. [2019-09-10 08:50:01,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86608 states and 135050 transitions. [2019-09-10 08:50:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:50:01,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:01,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:01,995 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:01,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1527760996, now seen corresponding path program 1 times [2019-09-10 08:50:01,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:01,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:01,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:02,504 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 08:50:02,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:02,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:02,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:02,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:02,506 INFO L87 Difference]: Start difference. First operand 86608 states and 135050 transitions. Second operand 4 states. [2019-09-10 08:50:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:03,065 INFO L93 Difference]: Finished difference Result 169423 states and 262906 transitions. [2019-09-10 08:50:03,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:03,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 08:50:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:03,281 INFO L225 Difference]: With dead ends: 169423 [2019-09-10 08:50:03,281 INFO L226 Difference]: Without dead ends: 169423 [2019-09-10 08:50:03,281 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 08:50:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169423 states. [2019-09-10 08:50:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169423 to 169421. [2019-09-10 08:50:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169421 states. [2019-09-10 08:50:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169421 states to 169421 states and 262905 transitions. [2019-09-10 08:50:05,613 INFO L78 Accepts]: Start accepts. Automaton has 169421 states and 262905 transitions. Word has length 327 [2019-09-10 08:50:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:05,613 INFO L475 AbstractCegarLoop]: Abstraction has 169421 states and 262905 transitions. [2019-09-10 08:50:05,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 169421 states and 262905 transitions. [2019-09-10 08:50:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:50:05,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:05,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:05,664 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash -49446034, now seen corresponding path program 1 times [2019-09-10 08:50:05,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:05,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:05,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:05,953 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 08:50:05,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:05,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:05,954 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:05,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:05,956 INFO L87 Difference]: Start difference. First operand 169421 states and 262905 transitions. Second operand 4 states. [2019-09-10 08:50:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:09,493 INFO L93 Difference]: Finished difference Result 338240 states and 524796 transitions. [2019-09-10 08:50:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:09,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:50:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:09,911 INFO L225 Difference]: With dead ends: 338240 [2019-09-10 08:50:09,912 INFO L226 Difference]: Without dead ends: 338240 [2019-09-10 08:50:09,912 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 08:50:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338240 states. [2019-09-10 08:50:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338240 to 170450. [2019-09-10 08:50:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170450 states. [2019-09-10 08:50:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170450 states to 170450 states and 264629 transitions. [2019-09-10 08:50:12,951 INFO L78 Accepts]: Start accepts. Automaton has 170450 states and 264629 transitions. Word has length 328 [2019-09-10 08:50:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:12,951 INFO L475 AbstractCegarLoop]: Abstraction has 170450 states and 264629 transitions. [2019-09-10 08:50:12,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:50:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 170450 states and 264629 transitions. [2019-09-10 08:50:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:50:12,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:12,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:12,998 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:12,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:12,998 INFO L82 PathProgramCache]: Analyzing trace with hash -963849709, now seen corresponding path program 1 times [2019-09-10 08:50:12,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:13,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:13,229 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 08:50:13,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:13,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:13,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:13,232 INFO L87 Difference]: Start difference. First operand 170450 states and 264629 transitions. Second operand 3 states. [2019-09-10 08:50:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:14,197 INFO L93 Difference]: Finished difference Result 332500 states and 513105 transitions. [2019-09-10 08:50:14,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:14,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:50:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:14,612 INFO L225 Difference]: With dead ends: 332500 [2019-09-10 08:50:14,612 INFO L226 Difference]: Without dead ends: 332500 [2019-09-10 08:50:14,613 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 08:50:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332500 states. [2019-09-10 08:50:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332500 to 332498. [2019-09-10 08:50:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332498 states. [2019-09-10 08:50:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332498 states to 332498 states and 513104 transitions. [2019-09-10 08:50:22,003 INFO L78 Accepts]: Start accepts. Automaton has 332498 states and 513104 transitions. Word has length 328 [2019-09-10 08:50:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:22,003 INFO L475 AbstractCegarLoop]: Abstraction has 332498 states and 513104 transitions. [2019-09-10 08:50:22,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 332498 states and 513104 transitions. [2019-09-10 08:50:22,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-10 08:50:22,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:22,095 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:22,095 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:22,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:22,095 INFO L82 PathProgramCache]: Analyzing trace with hash 590275532, now seen corresponding path program 1 times [2019-09-10 08:50:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:22,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:22,315 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 08:50:22,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:22,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:50:22,316 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:22,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:50:22,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:50:22,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:50:22,317 INFO L87 Difference]: Start difference. First operand 332498 states and 513104 transitions. Second operand 3 states. [2019-09-10 08:50:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:24,959 INFO L93 Difference]: Finished difference Result 648817 states and 997330 transitions. [2019-09-10 08:50:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:50:24,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-10 08:50:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:50:25,958 INFO L225 Difference]: With dead ends: 648817 [2019-09-10 08:50:25,958 INFO L226 Difference]: Without dead ends: 648817 [2019-09-10 08:50:25,958 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 08:50:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648817 states. [2019-09-10 08:50:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648817 to 648815. [2019-09-10 08:50:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648815 states. [2019-09-10 08:50:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648815 states to 648815 states and 997329 transitions. [2019-09-10 08:50:42,262 INFO L78 Accepts]: Start accepts. Automaton has 648815 states and 997329 transitions. Word has length 329 [2019-09-10 08:50:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:50:42,262 INFO L475 AbstractCegarLoop]: Abstraction has 648815 states and 997329 transitions. [2019-09-10 08:50:42,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:50:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 648815 states and 997329 transitions. [2019-09-10 08:50:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:50:42,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:50:42,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:50:42,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:50:42,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:50:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1260398662, now seen corresponding path program 1 times [2019-09-10 08:50:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:50:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:50:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:50:42,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:50:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:50:50,348 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 08:50:50,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:50:50,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:50:50,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:50:50,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:50:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:50:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:50:50,351 INFO L87 Difference]: Start difference. First operand 648815 states and 997329 transitions. Second operand 4 states. [2019-09-10 08:50:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:50:53,940 INFO L93 Difference]: Finished difference Result 1270200 states and 1945772 transitions. [2019-09-10 08:50:53,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:50:53,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-10 08:50:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:51:04,236 INFO L225 Difference]: With dead ends: 1270200 [2019-09-10 08:51:04,236 INFO L226 Difference]: Without dead ends: 1270200 [2019-09-10 08:51:04,237 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 08:51:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270200 states. [2019-09-10 08:51:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270200 to 1270198. [2019-09-10 08:51:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270198 states. [2019-09-10 08:51:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270198 states to 1270198 states and 1945771 transitions. [2019-09-10 08:51:48,986 INFO L78 Accepts]: Start accepts. Automaton has 1270198 states and 1945771 transitions. Word has length 330 [2019-09-10 08:51:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:51:48,986 INFO L475 AbstractCegarLoop]: Abstraction has 1270198 states and 1945771 transitions. [2019-09-10 08:51:48,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:51:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1270198 states and 1945771 transitions. [2019-09-10 08:51:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:51:49,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:51:49,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:51:49,309 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:51:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:51:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1390737476, now seen corresponding path program 1 times [2019-09-10 08:51:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:51:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:51:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:51:49,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:51:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:51:51,864 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 08:51:51,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:51:51,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:51:51,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:51:51,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:51:51,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:51:51,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:51:51,865 INFO L87 Difference]: Start difference. First operand 1270198 states and 1945771 transitions. Second operand 3 states. [2019-09-10 08:52:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:23,134 INFO L93 Difference]: Finished difference Result 2491294 states and 3797994 transitions. [2019-09-10 08:52:23,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:52:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:26,590 INFO L225 Difference]: With dead ends: 2491294 [2019-09-10 08:52:26,590 INFO L226 Difference]: Without dead ends: 2491294 [2019-09-10 08:52:26,590 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 08:52:29,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491294 states.