java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:23:58,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:23:58,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:23:58,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:23:58,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:23:58,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:23:58,940 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:23:58,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:23:58,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:23:58,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:23:58,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:23:58,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:23:58,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:23:58,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:23:58,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:23:58,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:23:58,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:23:58,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:23:58,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:23:58,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:23:58,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:23:58,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:23:58,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:23:58,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:23:58,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:23:58,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:23:58,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:23:58,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:23:58,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:23:58,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:23:58,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:23:58,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:23:58,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:23:58,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:23:58,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:23:58,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:23:58,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:23:58,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:23:58,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:23:58,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:23:58,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:23:58,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:23:58,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:23:58,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:23:58,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:23:58,990 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:23:58,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:23:58,993 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:23:58,993 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:23:58,994 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:23:58,994 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:23:58,994 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:23:58,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:23:58,995 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:23:58,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:23:58,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:23:58,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:23:58,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:23:58,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:23:58,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:23:58,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:23:58,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:23:58,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:23:58,997 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:23:58,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:23:58,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:58,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:23:58,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:23:59,000 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:23:59,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:23:59,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:23:59,000 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:23:59,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:23:59,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:23:59,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:23:59,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:23:59,064 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:23:59,065 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:23:59,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebac9b12/d3c43b1669004cb987b3596dde9bd21a/FLAG16c61af9a [2019-09-10 06:23:59,783 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:23:59,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:23:59,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebac9b12/d3c43b1669004cb987b3596dde9bd21a/FLAG16c61af9a [2019-09-10 06:23:59,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebac9b12/d3c43b1669004cb987b3596dde9bd21a [2019-09-10 06:23:59,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:23:59,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:23:59,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:59,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:24:00,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:24:00,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:59" (1/1) ... [2019-09-10 06:24:00,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300edefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:00, skipping insertion in model container [2019-09-10 06:24:00,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:59" (1/1) ... [2019-09-10 06:24:00,014 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:24:00,168 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:24:01,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:01,604 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:24:02,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:02,540 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:24:02,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02 WrapperNode [2019-09-10 06:24:02,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:24:02,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:24:02,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:24:02,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:24:02,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... [2019-09-10 06:24:02,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:24:02,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:24:02,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:24:02,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:24:02,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:24:02,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:24:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:24:02,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:24:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:24:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:24:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:24:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:24:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:24:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:24:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:24:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:24:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:24:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:24:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:24:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:24:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:24:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:24:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:24:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:24:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:24:05,807 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:24:05,808 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:24:05,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:05 BoogieIcfgContainer [2019-09-10 06:24:05,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:24:05,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:24:05,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:24:05,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:24:05,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:23:59" (1/3) ... [2019-09-10 06:24:05,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebad98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:05, skipping insertion in model container [2019-09-10 06:24:05,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:02" (2/3) ... [2019-09-10 06:24:05,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ebad98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:05, skipping insertion in model container [2019-09-10 06:24:05,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:05" (3/3) ... [2019-09-10 06:24:05,818 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 06:24:05,827 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:24:05,838 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:24:05,855 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:24:05,888 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:24:05,888 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:24:05,889 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:24:05,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:24:05,889 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:24:05,889 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:24:05,889 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:24:05,889 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:24:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states. [2019-09-10 06:24:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:24:05,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:05,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:05,975 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1089815166, now seen corresponding path program 1 times [2019-09-10 06:24:05,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:06,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:06,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:06,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:06,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:06,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:06,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:06,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:06,987 INFO L87 Difference]: Start difference. First operand 918 states. Second operand 3 states. [2019-09-10 06:24:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:07,363 INFO L93 Difference]: Finished difference Result 1322 states and 2354 transitions. [2019-09-10 06:24:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:07,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:24:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:07,401 INFO L225 Difference]: With dead ends: 1322 [2019-09-10 06:24:07,401 INFO L226 Difference]: Without dead ends: 1314 [2019-09-10 06:24:07,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-09-10 06:24:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1312. [2019-09-10 06:24:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-09-10 06:24:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1997 transitions. [2019-09-10 06:24:07,540 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1997 transitions. Word has length 304 [2019-09-10 06:24:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:07,542 INFO L475 AbstractCegarLoop]: Abstraction has 1312 states and 1997 transitions. [2019-09-10 06:24:07,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1997 transitions. [2019-09-10 06:24:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:24:07,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:07,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:07,554 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:07,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1639083294, now seen corresponding path program 1 times [2019-09-10 06:24:07,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:07,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:07,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:08,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:08,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:08,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:08,007 INFO L87 Difference]: Start difference. First operand 1312 states and 1997 transitions. Second operand 3 states. [2019-09-10 06:24:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:08,352 INFO L93 Difference]: Finished difference Result 2132 states and 3259 transitions. [2019-09-10 06:24:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:08,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:24:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:08,366 INFO L225 Difference]: With dead ends: 2132 [2019-09-10 06:24:08,367 INFO L226 Difference]: Without dead ends: 2132 [2019-09-10 06:24:08,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-09-10 06:24:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2130. [2019-09-10 06:24:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-09-10 06:24:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3258 transitions. [2019-09-10 06:24:08,424 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3258 transitions. Word has length 304 [2019-09-10 06:24:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:08,426 INFO L475 AbstractCegarLoop]: Abstraction has 2130 states and 3258 transitions. [2019-09-10 06:24:08,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3258 transitions. [2019-09-10 06:24:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:24:08,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:08,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:08,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:08,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -94104104, now seen corresponding path program 1 times [2019-09-10 06:24:08,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:08,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:08,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:08,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:08,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:09,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:09,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:09,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:09,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:09,216 INFO L87 Difference]: Start difference. First operand 2130 states and 3258 transitions. Second operand 4 states. [2019-09-10 06:24:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:09,401 INFO L93 Difference]: Finished difference Result 4192 states and 6372 transitions. [2019-09-10 06:24:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:09,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-09-10 06:24:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:09,423 INFO L225 Difference]: With dead ends: 4192 [2019-09-10 06:24:09,424 INFO L226 Difference]: Without dead ends: 4192 [2019-09-10 06:24:09,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2019-09-10 06:24:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4078. [2019-09-10 06:24:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4078 states. [2019-09-10 06:24:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 6229 transitions. [2019-09-10 06:24:09,529 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 6229 transitions. Word has length 304 [2019-09-10 06:24:09,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:09,529 INFO L475 AbstractCegarLoop]: Abstraction has 4078 states and 6229 transitions. [2019-09-10 06:24:09,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:09,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 6229 transitions. [2019-09-10 06:24:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:24:09,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:09,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:09,542 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:09,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1862797433, now seen corresponding path program 1 times [2019-09-10 06:24:09,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:09,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:09,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:09,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:09,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:09,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:09,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:09,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:09,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:09,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:09,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:09,870 INFO L87 Difference]: Start difference. First operand 4078 states and 6229 transitions. Second operand 3 states. [2019-09-10 06:24:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:10,026 INFO L93 Difference]: Finished difference Result 8001 states and 12141 transitions. [2019-09-10 06:24:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:10,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:24:10,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:10,065 INFO L225 Difference]: With dead ends: 8001 [2019-09-10 06:24:10,065 INFO L226 Difference]: Without dead ends: 8001 [2019-09-10 06:24:10,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-09-10 06:24:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 7887. [2019-09-10 06:24:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7887 states. [2019-09-10 06:24:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7887 states to 7887 states and 11998 transitions. [2019-09-10 06:24:10,267 INFO L78 Accepts]: Start accepts. Automaton has 7887 states and 11998 transitions. Word has length 306 [2019-09-10 06:24:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:10,268 INFO L475 AbstractCegarLoop]: Abstraction has 7887 states and 11998 transitions. [2019-09-10 06:24:10,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:10,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7887 states and 11998 transitions. [2019-09-10 06:24:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:24:10,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:10,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:10,285 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1026459764, now seen corresponding path program 1 times [2019-09-10 06:24:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:10,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:10,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:10,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:10,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:10,475 INFO L87 Difference]: Start difference. First operand 7887 states and 11998 transitions. Second operand 3 states. [2019-09-10 06:24:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:10,565 INFO L93 Difference]: Finished difference Result 15741 states and 23936 transitions. [2019-09-10 06:24:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:10,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-09-10 06:24:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:10,626 INFO L225 Difference]: With dead ends: 15741 [2019-09-10 06:24:10,626 INFO L226 Difference]: Without dead ends: 15741 [2019-09-10 06:24:10,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15741 states. [2019-09-10 06:24:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15741 to 7906. [2019-09-10 06:24:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7906 states. [2019-09-10 06:24:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7906 states to 7906 states and 12026 transitions. [2019-09-10 06:24:10,869 INFO L78 Accepts]: Start accepts. Automaton has 7906 states and 12026 transitions. Word has length 306 [2019-09-10 06:24:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 7906 states and 12026 transitions. [2019-09-10 06:24:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 7906 states and 12026 transitions. [2019-09-10 06:24:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:24:10,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:10,892 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] [2019-09-10 06:24:10,893 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash -454298708, now seen corresponding path program 1 times [2019-09-10 06:24:10,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:10,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:10,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:11,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:11,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:11,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:11,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:11,060 INFO L87 Difference]: Start difference. First operand 7906 states and 12026 transitions. Second operand 3 states. [2019-09-10 06:24:11,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:11,180 INFO L93 Difference]: Finished difference Result 15759 states and 23957 transitions. [2019-09-10 06:24:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:11,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 06:24:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:11,215 INFO L225 Difference]: With dead ends: 15759 [2019-09-10 06:24:11,216 INFO L226 Difference]: Without dead ends: 15759 [2019-09-10 06:24:11,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2019-09-10 06:24:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 7924. [2019-09-10 06:24:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2019-09-10 06:24:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 12047 transitions. [2019-09-10 06:24:11,422 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 12047 transitions. Word has length 307 [2019-09-10 06:24:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:11,422 INFO L475 AbstractCegarLoop]: Abstraction has 7924 states and 12047 transitions. [2019-09-10 06:24:11,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 12047 transitions. [2019-09-10 06:24:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:24:11,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:11,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:11,447 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:11,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:11,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1587691774, now seen corresponding path program 1 times [2019-09-10 06:24:11,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:11,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:11,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:11,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:11,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:11,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:11,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:11,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:11,869 INFO L87 Difference]: Start difference. First operand 7924 states and 12047 transitions. Second operand 3 states. [2019-09-10 06:24:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:12,017 INFO L93 Difference]: Finished difference Result 14641 states and 22072 transitions. [2019-09-10 06:24:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:12,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:24:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:12,047 INFO L225 Difference]: With dead ends: 14641 [2019-09-10 06:24:12,048 INFO L226 Difference]: Without dead ends: 14641 [2019-09-10 06:24:12,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14641 states. [2019-09-10 06:24:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14641 to 14527. [2019-09-10 06:24:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14527 states. [2019-09-10 06:24:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14527 states to 14527 states and 21929 transitions. [2019-09-10 06:24:12,270 INFO L78 Accepts]: Start accepts. Automaton has 14527 states and 21929 transitions. Word has length 308 [2019-09-10 06:24:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:12,270 INFO L475 AbstractCegarLoop]: Abstraction has 14527 states and 21929 transitions. [2019-09-10 06:24:12,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 14527 states and 21929 transitions. [2019-09-10 06:24:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:24:12,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:12,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:12,296 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2070396511, now seen corresponding path program 1 times [2019-09-10 06:24:12,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:12,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:12,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:12,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:12,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:12,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:12,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:12,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:12,597 INFO L87 Difference]: Start difference. First operand 14527 states and 21929 transitions. Second operand 4 states. [2019-09-10 06:24:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:12,862 INFO L93 Difference]: Finished difference Result 27751 states and 41776 transitions. [2019-09-10 06:24:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:12,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:24:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:12,912 INFO L225 Difference]: With dead ends: 27751 [2019-09-10 06:24:12,913 INFO L226 Difference]: Without dead ends: 27751 [2019-09-10 06:24:12,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27751 states. [2019-09-10 06:24:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27751 to 14762. [2019-09-10 06:24:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14762 states. [2019-09-10 06:24:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14762 states to 14762 states and 22317 transitions. [2019-09-10 06:24:13,199 INFO L78 Accepts]: Start accepts. Automaton has 14762 states and 22317 transitions. Word has length 308 [2019-09-10 06:24:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:13,199 INFO L475 AbstractCegarLoop]: Abstraction has 14762 states and 22317 transitions. [2019-09-10 06:24:13,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14762 states and 22317 transitions. [2019-09-10 06:24:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:24:13,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:13,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:13,224 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1042389551, now seen corresponding path program 1 times [2019-09-10 06:24:13,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:13,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:13,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:13,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:13,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:13,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:13,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:13,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:13,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:13,358 INFO L87 Difference]: Start difference. First operand 14762 states and 22317 transitions. Second operand 3 states. [2019-09-10 06:24:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:13,474 INFO L93 Difference]: Finished difference Result 28757 states and 43278 transitions. [2019-09-10 06:24:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:13,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:24:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:13,534 INFO L225 Difference]: With dead ends: 28757 [2019-09-10 06:24:13,534 INFO L226 Difference]: Without dead ends: 28757 [2019-09-10 06:24:13,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28757 states. [2019-09-10 06:24:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28757 to 14866. [2019-09-10 06:24:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14866 states. [2019-09-10 06:24:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14866 states to 14866 states and 22460 transitions. [2019-09-10 06:24:13,839 INFO L78 Accepts]: Start accepts. Automaton has 14866 states and 22460 transitions. Word has length 310 [2019-09-10 06:24:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:13,839 INFO L475 AbstractCegarLoop]: Abstraction has 14866 states and 22460 transitions. [2019-09-10 06:24:13,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 14866 states and 22460 transitions. [2019-09-10 06:24:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:24:13,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:13,869 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] [2019-09-10 06:24:13,869 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:13,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:13,870 INFO L82 PathProgramCache]: Analyzing trace with hash 209482193, now seen corresponding path program 1 times [2019-09-10 06:24:13,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:13,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:13,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:13,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:14,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:14,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:14,694 INFO L87 Difference]: Start difference. First operand 14866 states and 22460 transitions. Second operand 3 states. [2019-09-10 06:24:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:14,789 INFO L93 Difference]: Finished difference Result 28882 states and 43424 transitions. [2019-09-10 06:24:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:14,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:24:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:14,840 INFO L225 Difference]: With dead ends: 28882 [2019-09-10 06:24:14,841 INFO L226 Difference]: Without dead ends: 28882 [2019-09-10 06:24:14,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28882 states. [2019-09-10 06:24:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28882 to 14991. [2019-09-10 06:24:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14991 states. [2019-09-10 06:24:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14991 states to 14991 states and 22606 transitions. [2019-09-10 06:24:15,143 INFO L78 Accepts]: Start accepts. Automaton has 14991 states and 22606 transitions. Word has length 311 [2019-09-10 06:24:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:15,143 INFO L475 AbstractCegarLoop]: Abstraction has 14991 states and 22606 transitions. [2019-09-10 06:24:15,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 14991 states and 22606 transitions. [2019-09-10 06:24:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:24:15,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:15,181 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:15,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1671112126, now seen corresponding path program 1 times [2019-09-10 06:24:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:15,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:15,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:15,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:15,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:15,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:15,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:15,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:15,493 INFO L87 Difference]: Start difference. First operand 14991 states and 22606 transitions. Second operand 4 states. [2019-09-10 06:24:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:15,564 INFO L93 Difference]: Finished difference Result 14734 states and 22263 transitions. [2019-09-10 06:24:15,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:15,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:24:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:15,594 INFO L225 Difference]: With dead ends: 14734 [2019-09-10 06:24:15,595 INFO L226 Difference]: Without dead ends: 13937 [2019-09-10 06:24:15,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:15,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13937 states. [2019-09-10 06:24:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13937 to 13917. [2019-09-10 06:24:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13917 states. [2019-09-10 06:24:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13917 states to 13917 states and 20996 transitions. [2019-09-10 06:24:15,772 INFO L78 Accepts]: Start accepts. Automaton has 13917 states and 20996 transitions. Word has length 312 [2019-09-10 06:24:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:15,773 INFO L475 AbstractCegarLoop]: Abstraction has 13917 states and 20996 transitions. [2019-09-10 06:24:15,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 13917 states and 20996 transitions. [2019-09-10 06:24:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:24:15,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:15,786 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:15,787 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1258337204, now seen corresponding path program 1 times [2019-09-10 06:24:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:15,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:15,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:16,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:16,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:16,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:16,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:16,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:16,136 INFO L87 Difference]: Start difference. First operand 13917 states and 20996 transitions. Second operand 3 states. [2019-09-10 06:24:16,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:16,459 INFO L93 Difference]: Finished difference Result 24743 states and 37327 transitions. [2019-09-10 06:24:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:16,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-10 06:24:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:16,509 INFO L225 Difference]: With dead ends: 24743 [2019-09-10 06:24:16,513 INFO L226 Difference]: Without dead ends: 24743 [2019-09-10 06:24:16,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24743 states. [2019-09-10 06:24:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24743 to 24705. [2019-09-10 06:24:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24705 states. [2019-09-10 06:24:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24705 states to 24705 states and 37290 transitions. [2019-09-10 06:24:16,819 INFO L78 Accepts]: Start accepts. Automaton has 24705 states and 37290 transitions. Word has length 313 [2019-09-10 06:24:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:16,820 INFO L475 AbstractCegarLoop]: Abstraction has 24705 states and 37290 transitions. [2019-09-10 06:24:16,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 24705 states and 37290 transitions. [2019-09-10 06:24:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:24:16,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:16,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:16,843 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:16,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:16,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1258675828, now seen corresponding path program 1 times [2019-09-10 06:24:16,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:16,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:17,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:17,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:24:17,325 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:17,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:24:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:24:17,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:17,326 INFO L87 Difference]: Start difference. First operand 24705 states and 37290 transitions. Second operand 9 states. [2019-09-10 06:24:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:20,321 INFO L93 Difference]: Finished difference Result 60018 states and 93349 transitions. [2019-09-10 06:24:20,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:24:20,321 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 313 [2019-09-10 06:24:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:20,403 INFO L225 Difference]: With dead ends: 60018 [2019-09-10 06:24:20,403 INFO L226 Difference]: Without dead ends: 60018 [2019-09-10 06:24:20,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:24:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60018 states. [2019-09-10 06:24:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60018 to 37656. [2019-09-10 06:24:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37656 states. [2019-09-10 06:24:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37656 states to 37656 states and 57943 transitions. [2019-09-10 06:24:21,003 INFO L78 Accepts]: Start accepts. Automaton has 37656 states and 57943 transitions. Word has length 313 [2019-09-10 06:24:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:21,004 INFO L475 AbstractCegarLoop]: Abstraction has 37656 states and 57943 transitions. [2019-09-10 06:24:21,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:24:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37656 states and 57943 transitions. [2019-09-10 06:24:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:24:21,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:21,025 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:21,026 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1601555817, now seen corresponding path program 1 times [2019-09-10 06:24:21,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:21,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:21,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:21,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:21,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:21,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:21,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:21,637 INFO L87 Difference]: Start difference. First operand 37656 states and 57943 transitions. Second operand 4 states. [2019-09-10 06:24:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:21,932 INFO L93 Difference]: Finished difference Result 73752 states and 112617 transitions. [2019-09-10 06:24:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:21,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-09-10 06:24:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:22,049 INFO L225 Difference]: With dead ends: 73752 [2019-09-10 06:24:22,049 INFO L226 Difference]: Without dead ends: 73752 [2019-09-10 06:24:22,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73752 states. [2019-09-10 06:24:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73752 to 73588. [2019-09-10 06:24:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73588 states. [2019-09-10 06:24:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73588 states to 73588 states and 112395 transitions. [2019-09-10 06:24:23,043 INFO L78 Accepts]: Start accepts. Automaton has 73588 states and 112395 transitions. Word has length 313 [2019-09-10 06:24:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:23,043 INFO L475 AbstractCegarLoop]: Abstraction has 73588 states and 112395 transitions. [2019-09-10 06:24:23,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 73588 states and 112395 transitions. [2019-09-10 06:24:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:24:23,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:23,087 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] [2019-09-10 06:24:23,088 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash 993380925, now seen corresponding path program 1 times [2019-09-10 06:24:23,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:23,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:23,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:23,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:23,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:23,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:23,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:23,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:23,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:23,307 INFO L87 Difference]: Start difference. First operand 73588 states and 112395 transitions. Second operand 3 states. [2019-09-10 06:24:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:23,643 INFO L93 Difference]: Finished difference Result 143867 states and 218391 transitions. [2019-09-10 06:24:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:23,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:24:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:23,868 INFO L225 Difference]: With dead ends: 143867 [2019-09-10 06:24:23,868 INFO L226 Difference]: Without dead ends: 143867 [2019-09-10 06:24:23,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143867 states. [2019-09-10 06:24:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143867 to 143711. [2019-09-10 06:24:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143711 states. [2019-09-10 06:24:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143711 states to 143711 states and 218185 transitions. [2019-09-10 06:24:27,110 INFO L78 Accepts]: Start accepts. Automaton has 143711 states and 218185 transitions. Word has length 315 [2019-09-10 06:24:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:27,110 INFO L475 AbstractCegarLoop]: Abstraction has 143711 states and 218185 transitions. [2019-09-10 06:24:27,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 143711 states and 218185 transitions. [2019-09-10 06:24:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:24:27,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:27,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] [2019-09-10 06:24:27,167 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:27,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1748366818, now seen corresponding path program 1 times [2019-09-10 06:24:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:27,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:27,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:29,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:29,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:29,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:29,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:29,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:29,451 INFO L87 Difference]: Start difference. First operand 143711 states and 218185 transitions. Second operand 3 states. [2019-09-10 06:24:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:29,997 INFO L93 Difference]: Finished difference Result 262368 states and 394099 transitions. [2019-09-10 06:24:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:29,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 06:24:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:30,279 INFO L225 Difference]: With dead ends: 262368 [2019-09-10 06:24:30,280 INFO L226 Difference]: Without dead ends: 262368 [2019-09-10 06:24:30,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262368 states. [2019-09-10 06:24:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262368 to 262220. [2019-09-10 06:24:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262220 states. [2019-09-10 06:24:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262220 states to 262220 states and 393909 transitions. [2019-09-10 06:24:33,286 INFO L78 Accepts]: Start accepts. Automaton has 262220 states and 393909 transitions. Word has length 317 [2019-09-10 06:24:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:33,286 INFO L475 AbstractCegarLoop]: Abstraction has 262220 states and 393909 transitions. [2019-09-10 06:24:33,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 262220 states and 393909 transitions. [2019-09-10 06:24:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:24:33,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:33,394 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:33,395 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:33,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:33,395 INFO L82 PathProgramCache]: Analyzing trace with hash -359898139, now seen corresponding path program 1 times [2019-09-10 06:24:33,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:33,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:33,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:33,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:36,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:36,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:36,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:36,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:36,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:36,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:36,952 INFO L87 Difference]: Start difference. First operand 262220 states and 393909 transitions. Second operand 4 states. [2019-09-10 06:24:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:38,137 INFO L93 Difference]: Finished difference Result 459155 states and 688777 transitions. [2019-09-10 06:24:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:38,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-09-10 06:24:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:38,645 INFO L225 Difference]: With dead ends: 459155 [2019-09-10 06:24:38,645 INFO L226 Difference]: Without dead ends: 459155 [2019-09-10 06:24:38,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:24:38,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459155 states. [2019-09-10 06:24:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459155 to 256443. [2019-09-10 06:24:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256443 states. [2019-09-10 06:24:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256443 states to 256443 states and 385212 transitions. [2019-09-10 06:24:48,437 INFO L78 Accepts]: Start accepts. Automaton has 256443 states and 385212 transitions. Word has length 317 [2019-09-10 06:24:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:48,437 INFO L475 AbstractCegarLoop]: Abstraction has 256443 states and 385212 transitions. [2019-09-10 06:24:48,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 256443 states and 385212 transitions. [2019-09-10 06:24:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:24:48,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:48,558 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 06:24:48,558 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:48,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash -239317031, now seen corresponding path program 1 times [2019-09-10 06:24:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:48,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:48,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:48,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:48,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:48,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:48,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:48,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:48,702 INFO L87 Difference]: Start difference. First operand 256443 states and 385212 transitions. Second operand 3 states. [2019-09-10 06:24:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:49,822 INFO L93 Difference]: Finished difference Result 460279 states and 690415 transitions. [2019-09-10 06:24:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:49,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:24:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:50,394 INFO L225 Difference]: With dead ends: 460279 [2019-09-10 06:24:50,395 INFO L226 Difference]: Without dead ends: 460279 [2019-09-10 06:24:50,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460279 states. [2019-09-10 06:24:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460279 to 256924. [2019-09-10 06:24:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256924 states. [2019-09-10 06:24:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256924 states to 256924 states and 385810 transitions. [2019-09-10 06:24:59,320 INFO L78 Accepts]: Start accepts. Automaton has 256924 states and 385810 transitions. Word has length 320 [2019-09-10 06:24:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:59,320 INFO L475 AbstractCegarLoop]: Abstraction has 256924 states and 385810 transitions. [2019-09-10 06:24:59,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 256924 states and 385810 transitions. [2019-09-10 06:24:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:24:59,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:59,430 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 06:24:59,431 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash 206739205, now seen corresponding path program 1 times [2019-09-10 06:24:59,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:59,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:59,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:59,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:59,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:00,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:00,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:00,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:00,462 INFO L87 Difference]: Start difference. First operand 256924 states and 385810 transitions. Second operand 4 states. [2019-09-10 06:25:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:01,113 INFO L93 Difference]: Finished difference Result 248660 states and 373625 transitions. [2019-09-10 06:25:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:01,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-09-10 06:25:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:01,395 INFO L225 Difference]: With dead ends: 248660 [2019-09-10 06:25:01,395 INFO L226 Difference]: Without dead ends: 244492 [2019-09-10 06:25:01,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244492 states. [2019-09-10 06:25:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244492 to 244165. [2019-09-10 06:25:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244165 states. [2019-09-10 06:25:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244165 states to 244165 states and 366760 transitions. [2019-09-10 06:25:11,068 INFO L78 Accepts]: Start accepts. Automaton has 244165 states and 366760 transitions. Word has length 321 [2019-09-10 06:25:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:11,069 INFO L475 AbstractCegarLoop]: Abstraction has 244165 states and 366760 transitions. [2019-09-10 06:25:11,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 244165 states and 366760 transitions. [2019-09-10 06:25:11,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:25:11,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:11,165 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 06:25:11,166 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:11,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash -961728584, now seen corresponding path program 1 times [2019-09-10 06:25:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:11,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:11,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:11,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:11,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:11,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:11,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:11,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:11,312 INFO L87 Difference]: Start difference. First operand 244165 states and 366760 transitions. Second operand 3 states. [2019-09-10 06:25:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:13,526 INFO L93 Difference]: Finished difference Result 475490 states and 709825 transitions. [2019-09-10 06:25:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:13,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 06:25:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:13,991 INFO L225 Difference]: With dead ends: 475490 [2019-09-10 06:25:13,992 INFO L226 Difference]: Without dead ends: 475490 [2019-09-10 06:25:13,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475490 states. [2019-09-10 06:25:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475490 to 475150. [2019-09-10 06:25:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475150 states. [2019-09-10 06:25:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475150 states to 475150 states and 709391 transitions. [2019-09-10 06:25:24,105 INFO L78 Accepts]: Start accepts. Automaton has 475150 states and 709391 transitions. Word has length 322 [2019-09-10 06:25:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:24,105 INFO L475 AbstractCegarLoop]: Abstraction has 475150 states and 709391 transitions. [2019-09-10 06:25:24,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 475150 states and 709391 transitions. [2019-09-10 06:25:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:25:25,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:25,561 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 06:25:25,562 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:25,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1425793245, now seen corresponding path program 1 times [2019-09-10 06:25:25,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:25,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:25,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:25,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:25,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:25:25,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:25,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:25:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:25:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:25:25,946 INFO L87 Difference]: Start difference. First operand 475150 states and 709391 transitions. Second operand 8 states. [2019-09-10 06:25:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:36,692 INFO L93 Difference]: Finished difference Result 1116326 states and 1696197 transitions. [2019-09-10 06:25:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:25:36,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 322 [2019-09-10 06:25:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:38,274 INFO L225 Difference]: With dead ends: 1116326 [2019-09-10 06:25:38,274 INFO L226 Difference]: Without dead ends: 1116326 [2019-09-10 06:25:38,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:25:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116326 states. [2019-09-10 06:25:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116326 to 643998. [2019-09-10 06:25:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643998 states. [2019-09-10 06:25:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643998 states to 643998 states and 960945 transitions. [2019-09-10 06:25:56,499 INFO L78 Accepts]: Start accepts. Automaton has 643998 states and 960945 transitions. Word has length 322 [2019-09-10 06:25:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:56,500 INFO L475 AbstractCegarLoop]: Abstraction has 643998 states and 960945 transitions. [2019-09-10 06:25:56,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:25:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 643998 states and 960945 transitions. [2019-09-10 06:25:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:25:56,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:56,700 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 06:25:56,700 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 524219355, now seen corresponding path program 1 times [2019-09-10 06:25:56,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:57,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:57,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:57,218 INFO L87 Difference]: Start difference. First operand 643998 states and 960945 transitions. Second operand 4 states. [2019-09-10 06:26:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:08,462 INFO L93 Difference]: Finished difference Result 1212736 states and 1799291 transitions. [2019-09-10 06:26:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:08,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-10 06:26:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:10,201 INFO L225 Difference]: With dead ends: 1212736 [2019-09-10 06:26:10,201 INFO L226 Difference]: Without dead ends: 1212736 [2019-09-10 06:26:10,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212736 states. [2019-09-10 06:26:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212736 to 1212636. [2019-09-10 06:26:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212636 states. [2019-09-10 06:26:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212636 states to 1212636 states and 1799167 transitions. [2019-09-10 06:26:58,296 INFO L78 Accepts]: Start accepts. Automaton has 1212636 states and 1799167 transitions. Word has length 322 [2019-09-10 06:26:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:58,296 INFO L475 AbstractCegarLoop]: Abstraction has 1212636 states and 1799167 transitions. [2019-09-10 06:26:58,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1212636 states and 1799167 transitions. [2019-09-10 06:26:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:26:58,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:58,684 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 06:26:58,684 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:58,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash -51183164, now seen corresponding path program 1 times [2019-09-10 06:26:58,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:58,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:58,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:00,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:00,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:00,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:00,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:00,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:00,645 INFO L87 Difference]: Start difference. First operand 1212636 states and 1799167 transitions. Second operand 3 states. [2019-09-10 06:27:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:18,694 INFO L93 Difference]: Finished difference Result 2373333 states and 3502306 transitions. [2019-09-10 06:27:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:27:18,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 06:27:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:22,118 INFO L225 Difference]: With dead ends: 2373333 [2019-09-10 06:27:22,118 INFO L226 Difference]: Without dead ends: 2373333 [2019-09-10 06:27:22,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373333 states.