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.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:23:13,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:23:13,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:23:13,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:23:13,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:23:13,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:23:13,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:23:13,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:23:13,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:23:13,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:23:13,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:23:13,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:23:13,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:23:13,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:23:13,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:23:13,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:23:13,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:23:13,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:23:13,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:23:13,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:23:13,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:23:13,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:23:13,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:23:13,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:23:13,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:23:13,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:23:13,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:23:13,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:23:13,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:23:13,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:23:13,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:23:13,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:23:13,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:23:13,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:23:13,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:23:13,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:23:13,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:23:13,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:23:13,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:23:13,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:23:13,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:23:13,644 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:13,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:23:13,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:23:13,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:23:13,668 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:23:13,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:23:13,669 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:23:13,669 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:23:13,669 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:23:13,669 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:23:13,669 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:23:13,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:23:13,670 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:23:13,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:23:13,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:23:13,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:23:13,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:23:13,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:23:13,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:23:13,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:23:13,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:23:13,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:23:13,672 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:23:13,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:23:13,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:23:13,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:23:13,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:23:13,673 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:23:13,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:23:13,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:23:13,674 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:23:13,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:23:13,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:23:13,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:23:13,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:23:13,728 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:23:13,728 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.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:23:13,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0011134c8/c49dff4e18e74cd99df31093a02c0ff0/FLAG49e3190dd [2019-09-10 06:23:14,463 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:23:14,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:23:14,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0011134c8/c49dff4e18e74cd99df31093a02c0ff0/FLAG49e3190dd [2019-09-10 06:23:14,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0011134c8/c49dff4e18e74cd99df31093a02c0ff0 [2019-09-10 06:23:14,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:23:14,599 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:23:14,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:14,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:23:14,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:23:14,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:14" (1/1) ... [2019-09-10 06:23:14,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2ba9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:14, skipping insertion in model container [2019-09-10 06:23:14,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:23:14" (1/1) ... [2019-09-10 06:23:14,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:23:14,756 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:23:16,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:16,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:23:17,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:23:17,543 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:23:17,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17 WrapperNode [2019-09-10 06:23:17,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:23:17,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:23:17,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:23:17,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:23:17,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (1/1) ... [2019-09-10 06:23:17,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:23:17,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:23:17,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:23:17,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:23:17,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (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:23:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:23:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:23:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:23:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:23:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:23:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:23:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:23:17,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:23:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:23:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:23:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:23:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:23:17,835 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:23:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:23:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:23:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:23:17,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:23:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:23:17,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:23:21,209 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:23:21,210 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:23:21,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:21 BoogieIcfgContainer [2019-09-10 06:23:21,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:23:21,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:23:21,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:23:21,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:23:21,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:23:14" (1/3) ... [2019-09-10 06:23:21,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a85a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:21, skipping insertion in model container [2019-09-10 06:23:21,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:23:17" (2/3) ... [2019-09-10 06:23:21,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a85a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:23:21, skipping insertion in model container [2019-09-10 06:23:21,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:23:21" (3/3) ... [2019-09-10 06:23:21,231 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-10 06:23:21,245 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:23:21,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2019-09-10 06:23:21,297 INFO L252 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-09-10 06:23:21,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:23:21,330 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:23:21,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:23:21,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:23:21,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:23:21,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:23:21,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:23:21,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:23:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states. [2019-09-10 06:23:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 06:23:21,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:21,417 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] [2019-09-10 06:23:21,420 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash 879468556, now seen corresponding path program 1 times [2019-09-10 06:23:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:21,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:21,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:21,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:21,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:23,082 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:23:23,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:23,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:23,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:23,110 INFO L87 Difference]: Start difference. First operand 894 states. Second operand 4 states. [2019-09-10 06:23:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:23,434 INFO L93 Difference]: Finished difference Result 1758 states and 3140 transitions. [2019-09-10 06:23:23,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:23:23,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-09-10 06:23:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:23,464 INFO L225 Difference]: With dead ends: 1758 [2019-09-10 06:23:23,464 INFO L226 Difference]: Without dead ends: 1750 [2019-09-10 06:23:23,466 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:23:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-09-10 06:23:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1659. [2019-09-10 06:23:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-10 06:23:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2536 transitions. [2019-09-10 06:23:23,612 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2536 transitions. Word has length 298 [2019-09-10 06:23:23,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:23,613 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2536 transitions. [2019-09-10 06:23:23,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2536 transitions. [2019-09-10 06:23:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:23:23,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:23,622 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] [2019-09-10 06:23:23,623 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2014471081, now seen corresponding path program 1 times [2019-09-10 06:23:23,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:23,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:24,088 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:23:24,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:24,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:24,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:24,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:24,102 INFO L87 Difference]: Start difference. First operand 1659 states and 2536 transitions. Second operand 3 states. [2019-09-10 06:23:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:24,310 INFO L93 Difference]: Finished difference Result 3262 states and 4960 transitions. [2019-09-10 06:23:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:24,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:23:24,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:24,334 INFO L225 Difference]: With dead ends: 3262 [2019-09-10 06:23:24,334 INFO L226 Difference]: Without dead ends: 3262 [2019-09-10 06:23:24,335 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:23:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2019-09-10 06:23:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3171. [2019-09-10 06:23:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3171 states. [2019-09-10 06:23:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4846 transitions. [2019-09-10 06:23:24,482 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4846 transitions. Word has length 300 [2019-09-10 06:23:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:24,485 INFO L475 AbstractCegarLoop]: Abstraction has 3171 states and 4846 transitions. [2019-09-10 06:23:24,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4846 transitions. [2019-09-10 06:23:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-10 06:23:24,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:24,506 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] [2019-09-10 06:23:24,507 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:24,509 INFO L82 PathProgramCache]: Analyzing trace with hash -86719460, now seen corresponding path program 1 times [2019-09-10 06:23:24,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:24,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:24,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:23:24,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:24,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:24,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:24,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:24,857 INFO L87 Difference]: Start difference. First operand 3171 states and 4846 transitions. Second operand 3 states. [2019-09-10 06:23:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:24,945 INFO L93 Difference]: Finished difference Result 6309 states and 9632 transitions. [2019-09-10 06:23:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:24,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-10 06:23:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:24,984 INFO L225 Difference]: With dead ends: 6309 [2019-09-10 06:23:24,984 INFO L226 Difference]: Without dead ends: 6309 [2019-09-10 06:23:24,985 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:23:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2019-09-10 06:23:25,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 3190. [2019-09-10 06:23:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2019-09-10 06:23:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 4874 transitions. [2019-09-10 06:23:25,120 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 4874 transitions. Word has length 300 [2019-09-10 06:23:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:25,120 INFO L475 AbstractCegarLoop]: Abstraction has 3190 states and 4874 transitions. [2019-09-10 06:23:25,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 4874 transitions. [2019-09-10 06:23:25,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-10 06:23:25,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:25,131 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] [2019-09-10 06:23:25,132 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -251320664, now seen corresponding path program 1 times [2019-09-10 06:23:25,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:25,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:25,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:23:25,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:25,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:25,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:25,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:25,313 INFO L87 Difference]: Start difference. First operand 3190 states and 4874 transitions. Second operand 3 states. [2019-09-10 06:23:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:25,418 INFO L93 Difference]: Finished difference Result 6327 states and 9653 transitions. [2019-09-10 06:23:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:25,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-10 06:23:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:25,457 INFO L225 Difference]: With dead ends: 6327 [2019-09-10 06:23:25,457 INFO L226 Difference]: Without dead ends: 6327 [2019-09-10 06:23:25,458 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:23:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6327 states. [2019-09-10 06:23:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6327 to 3208. [2019-09-10 06:23:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2019-09-10 06:23:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4895 transitions. [2019-09-10 06:23:25,610 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 4895 transitions. Word has length 301 [2019-09-10 06:23:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:25,611 INFO L475 AbstractCegarLoop]: Abstraction has 3208 states and 4895 transitions. [2019-09-10 06:23:25,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 4895 transitions. [2019-09-10 06:23:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:23:25,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:25,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:25,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1409603182, now seen corresponding path program 1 times [2019-09-10 06:23:25,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:25,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:26,039 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:23:26,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:26,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:26,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:26,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:26,042 INFO L87 Difference]: Start difference. First operand 3208 states and 4895 transitions. Second operand 3 states. [2019-09-10 06:23:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:26,194 INFO L93 Difference]: Finished difference Result 6214 states and 9411 transitions. [2019-09-10 06:23:26,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:26,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-10 06:23:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:26,235 INFO L225 Difference]: With dead ends: 6214 [2019-09-10 06:23:26,235 INFO L226 Difference]: Without dead ends: 6214 [2019-09-10 06:23:26,235 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:23:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2019-09-10 06:23:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 6123. [2019-09-10 06:23:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6123 states. [2019-09-10 06:23:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 9297 transitions. [2019-09-10 06:23:26,386 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 9297 transitions. Word has length 302 [2019-09-10 06:23:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:26,387 INFO L475 AbstractCegarLoop]: Abstraction has 6123 states and 9297 transitions. [2019-09-10 06:23:26,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:26,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 9297 transitions. [2019-09-10 06:23:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 06:23:26,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:26,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:26,404 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash -673500497, now seen corresponding path program 1 times [2019-09-10 06:23:26,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:26,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:26,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:26,854 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:23:26,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:26,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:26,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:26,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:26,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:26,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:26,856 INFO L87 Difference]: Start difference. First operand 6123 states and 9297 transitions. Second operand 4 states. [2019-09-10 06:23:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:26,968 INFO L93 Difference]: Finished difference Result 11214 states and 16923 transitions. [2019-09-10 06:23:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:26,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-09-10 06:23:26,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:26,999 INFO L225 Difference]: With dead ends: 11214 [2019-09-10 06:23:26,999 INFO L226 Difference]: Without dead ends: 11214 [2019-09-10 06:23:26,999 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:23:27,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2019-09-10 06:23:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 6358. [2019-09-10 06:23:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6358 states. [2019-09-10 06:23:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 9685 transitions. [2019-09-10 06:23:27,174 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 9685 transitions. Word has length 302 [2019-09-10 06:23:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:27,174 INFO L475 AbstractCegarLoop]: Abstraction has 6358 states and 9685 transitions. [2019-09-10 06:23:27,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 9685 transitions. [2019-09-10 06:23:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-10 06:23:27,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:27,195 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:23:27,196 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:27,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1900469541, now seen corresponding path program 1 times [2019-09-10 06:23:27,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:27,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:27,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:27,374 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:23:27,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:27,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:27,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:27,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:27,376 INFO L87 Difference]: Start difference. First operand 6358 states and 9685 transitions. Second operand 3 states. [2019-09-10 06:23:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:27,453 INFO L93 Difference]: Finished difference Result 11949 states and 18014 transitions. [2019-09-10 06:23:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:27,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-09-10 06:23:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:27,480 INFO L225 Difference]: With dead ends: 11949 [2019-09-10 06:23:27,480 INFO L226 Difference]: Without dead ends: 11949 [2019-09-10 06:23:27,481 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:23:27,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11949 states. [2019-09-10 06:23:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11949 to 6462. [2019-09-10 06:23:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6462 states. [2019-09-10 06:23:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 9828 transitions. [2019-09-10 06:23:27,645 INFO L78 Accepts]: Start accepts. Automaton has 6462 states and 9828 transitions. Word has length 304 [2019-09-10 06:23:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 6462 states and 9828 transitions. [2019-09-10 06:23:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 6462 states and 9828 transitions. [2019-09-10 06:23:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-10 06:23:27,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:27,663 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:27,663 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:27,664 INFO L82 PathProgramCache]: Analyzing trace with hash 261434929, now seen corresponding path program 1 times [2019-09-10 06:23:27,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:27,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:27,869 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:23:27,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:27,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:27,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:27,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:27,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:27,872 INFO L87 Difference]: Start difference. First operand 6462 states and 9828 transitions. Second operand 3 states. [2019-09-10 06:23:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:27,953 INFO L93 Difference]: Finished difference Result 12074 states and 18160 transitions. [2019-09-10 06:23:27,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:27,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-10 06:23:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:27,982 INFO L225 Difference]: With dead ends: 12074 [2019-09-10 06:23:27,982 INFO L226 Difference]: Without dead ends: 12074 [2019-09-10 06:23:27,983 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:23:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12074 states. [2019-09-10 06:23:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12074 to 6587. [2019-09-10 06:23:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6587 states. [2019-09-10 06:23:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 9974 transitions. [2019-09-10 06:23:28,149 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 9974 transitions. Word has length 305 [2019-09-10 06:23:28,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,150 INFO L475 AbstractCegarLoop]: Abstraction has 6587 states and 9974 transitions. [2019-09-10 06:23:28,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 9974 transitions. [2019-09-10 06:23:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-10 06:23:28,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:28,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:28,170 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:28,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -185535570, now seen corresponding path program 1 times [2019-09-10 06:23:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:28,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:28,510 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:23:28,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:28,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:28,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:28,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:28,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:28,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:28,512 INFO L87 Difference]: Start difference. First operand 6587 states and 9974 transitions. Second operand 4 states. [2019-09-10 06:23:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:28,582 INFO L93 Difference]: Finished difference Result 6601 states and 10042 transitions. [2019-09-10 06:23:28,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:28,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-09-10 06:23:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:28,596 INFO L225 Difference]: With dead ends: 6601 [2019-09-10 06:23:28,597 INFO L226 Difference]: Without dead ends: 5804 [2019-09-10 06:23:28,598 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:23:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-09-10 06:23:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5784. [2019-09-10 06:23:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-09-10 06:23:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 8775 transitions. [2019-09-10 06:23:28,699 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 8775 transitions. Word has length 306 [2019-09-10 06:23:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:28,700 INFO L475 AbstractCegarLoop]: Abstraction has 5784 states and 8775 transitions. [2019-09-10 06:23:28,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 8775 transitions. [2019-09-10 06:23:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:23:28,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:28,713 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:23:28,714 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:28,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 872440992, now seen corresponding path program 1 times [2019-09-10 06:23:28,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:28,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:28,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:28,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:29,053 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:23:29,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:29,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:29,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:29,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:29,057 INFO L87 Difference]: Start difference. First operand 5784 states and 8775 transitions. Second operand 3 states. [2019-09-10 06:23:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:29,866 INFO L93 Difference]: Finished difference Result 9848 states and 14794 transitions. [2019-09-10 06:23:29,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:29,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 06:23:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:29,894 INFO L225 Difference]: With dead ends: 9848 [2019-09-10 06:23:29,895 INFO L226 Difference]: Without dead ends: 9848 [2019-09-10 06:23:29,897 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:23:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9848 states. [2019-09-10 06:23:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9848 to 9757. [2019-09-10 06:23:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9757 states. [2019-09-10 06:23:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9757 states to 9757 states and 14680 transitions. [2019-09-10 06:23:30,051 INFO L78 Accepts]: Start accepts. Automaton has 9757 states and 14680 transitions. Word has length 307 [2019-09-10 06:23:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:30,052 INFO L475 AbstractCegarLoop]: Abstraction has 9757 states and 14680 transitions. [2019-09-10 06:23:30,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9757 states and 14680 transitions. [2019-09-10 06:23:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:23:30,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:30,073 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:30,075 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:30,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:30,075 INFO L82 PathProgramCache]: Analyzing trace with hash 167056645, now seen corresponding path program 1 times [2019-09-10 06:23:30,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:30,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:30,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:30,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:30,632 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:23:30,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:30,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:23:30,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:30,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:23:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:23:30,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:23:30,635 INFO L87 Difference]: Start difference. First operand 9757 states and 14680 transitions. Second operand 8 states. [2019-09-10 06:23:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:32,420 INFO L93 Difference]: Finished difference Result 14960 states and 22888 transitions. [2019-09-10 06:23:32,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:23:32,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 307 [2019-09-10 06:23:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:32,454 INFO L225 Difference]: With dead ends: 14960 [2019-09-10 06:23:32,454 INFO L226 Difference]: Without dead ends: 14960 [2019-09-10 06:23:32,454 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:23:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2019-09-10 06:23:32,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 10789. [2019-09-10 06:23:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10789 states. [2019-09-10 06:23:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 16160 transitions. [2019-09-10 06:23:32,659 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 16160 transitions. Word has length 307 [2019-09-10 06:23:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:32,660 INFO L475 AbstractCegarLoop]: Abstraction has 10789 states and 16160 transitions. [2019-09-10 06:23:32,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:23:32,661 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 16160 transitions. [2019-09-10 06:23:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 06:23:32,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:32,678 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:23:32,678 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:32,679 INFO L82 PathProgramCache]: Analyzing trace with hash -639901102, now seen corresponding path program 1 times [2019-09-10 06:23:32,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:32,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:33,347 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:23:33,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:33,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:33,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:33,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:33,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:33,350 INFO L87 Difference]: Start difference. First operand 10789 states and 16160 transitions. Second operand 4 states. [2019-09-10 06:23:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:33,544 INFO L93 Difference]: Finished difference Result 20997 states and 31201 transitions. [2019-09-10 06:23:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:33,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-09-10 06:23:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:33,594 INFO L225 Difference]: With dead ends: 20997 [2019-09-10 06:23:33,595 INFO L226 Difference]: Without dead ends: 20997 [2019-09-10 06:23:33,599 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:23:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20997 states. [2019-09-10 06:23:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20997 to 20909. [2019-09-10 06:23:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20909 states. [2019-09-10 06:23:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20909 states to 20909 states and 31092 transitions. [2019-09-10 06:23:34,751 INFO L78 Accepts]: Start accepts. Automaton has 20909 states and 31092 transitions. Word has length 307 [2019-09-10 06:23:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:34,752 INFO L475 AbstractCegarLoop]: Abstraction has 20909 states and 31092 transitions. [2019-09-10 06:23:34,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20909 states and 31092 transitions. [2019-09-10 06:23:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-10 06:23:34,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:34,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:34,784 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 903586634, now seen corresponding path program 1 times [2019-09-10 06:23:34,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:34,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:34,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:34,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:35,041 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:23:35,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:35,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:35,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:35,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:35,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:35,044 INFO L87 Difference]: Start difference. First operand 20909 states and 31092 transitions. Second operand 3 states. [2019-09-10 06:23:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:35,273 INFO L93 Difference]: Finished difference Result 40550 states and 59828 transitions. [2019-09-10 06:23:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:35,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-09-10 06:23:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:35,363 INFO L225 Difference]: With dead ends: 40550 [2019-09-10 06:23:35,363 INFO L226 Difference]: Without dead ends: 40550 [2019-09-10 06:23:35,364 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:23:35,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40550 states. [2019-09-10 06:23:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40550 to 40464. [2019-09-10 06:23:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40464 states. [2019-09-10 06:23:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40464 states to 40464 states and 59723 transitions. [2019-09-10 06:23:36,081 INFO L78 Accepts]: Start accepts. Automaton has 40464 states and 59723 transitions. Word has length 309 [2019-09-10 06:23:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:36,081 INFO L475 AbstractCegarLoop]: Abstraction has 40464 states and 59723 transitions. [2019-09-10 06:23:36,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40464 states and 59723 transitions. [2019-09-10 06:23:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:23:36,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:36,121 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:23:36,122 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:36,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2000096977, now seen corresponding path program 1 times [2019-09-10 06:23:36,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:36,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:36,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:36,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:36,601 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:23:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:36,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:36,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:36,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:36,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:36,603 INFO L87 Difference]: Start difference. First operand 40464 states and 59723 transitions. Second operand 3 states. [2019-09-10 06:23:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:36,892 INFO L93 Difference]: Finished difference Result 79133 states and 115799 transitions. [2019-09-10 06:23:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:36,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:23:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:37,012 INFO L225 Difference]: With dead ends: 79133 [2019-09-10 06:23:37,013 INFO L226 Difference]: Without dead ends: 79133 [2019-09-10 06:23:37,014 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:23:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79133 states. [2019-09-10 06:23:37,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79133 to 79049. [2019-09-10 06:23:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79049 states. [2019-09-10 06:23:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79049 states to 79049 states and 115698 transitions. [2019-09-10 06:23:38,060 INFO L78 Accepts]: Start accepts. Automaton has 79049 states and 115698 transitions. Word has length 311 [2019-09-10 06:23:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:38,061 INFO L475 AbstractCegarLoop]: Abstraction has 79049 states and 115698 transitions. [2019-09-10 06:23:38,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 79049 states and 115698 transitions. [2019-09-10 06:23:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:23:38,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:38,147 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:23:38,147 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -268509838, now seen corresponding path program 1 times [2019-09-10 06:23:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:38,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:38,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:38,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:39,870 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:23:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:39,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:39,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:39,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:39,872 INFO L87 Difference]: Start difference. First operand 79049 states and 115698 transitions. Second operand 4 states. [2019-09-10 06:23:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:40,267 INFO L93 Difference]: Finished difference Result 133263 states and 194474 transitions. [2019-09-10 06:23:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:40,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-09-10 06:23:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:40,471 INFO L225 Difference]: With dead ends: 133263 [2019-09-10 06:23:40,471 INFO L226 Difference]: Without dead ends: 133263 [2019-09-10 06:23:40,475 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:23:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133263 states. [2019-09-10 06:23:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133263 to 77210. [2019-09-10 06:23:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77210 states. [2019-09-10 06:23:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77210 states to 77210 states and 113072 transitions. [2019-09-10 06:23:41,931 INFO L78 Accepts]: Start accepts. Automaton has 77210 states and 113072 transitions. Word has length 311 [2019-09-10 06:23:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:41,931 INFO L475 AbstractCegarLoop]: Abstraction has 77210 states and 113072 transitions. [2019-09-10 06:23:41,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 77210 states and 113072 transitions. [2019-09-10 06:23:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:23:41,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:41,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:41,994 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash 348476886, now seen corresponding path program 1 times [2019-09-10 06:23:41,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:41,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:41,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:42,174 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:23:42,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:42,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:42,175 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:42,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:42,176 INFO L87 Difference]: Start difference. First operand 77210 states and 113072 transitions. Second operand 3 states. [2019-09-10 06:23:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:42,518 INFO L93 Difference]: Finished difference Result 135098 states and 197002 transitions. [2019-09-10 06:23:42,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:42,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:23:42,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:42,736 INFO L225 Difference]: With dead ends: 135098 [2019-09-10 06:23:42,736 INFO L226 Difference]: Without dead ends: 135098 [2019-09-10 06:23:42,737 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:23:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135098 states. [2019-09-10 06:23:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135098 to 77691. [2019-09-10 06:23:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77691 states. [2019-09-10 06:23:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77691 states to 77691 states and 113670 transitions. [2019-09-10 06:23:46,184 INFO L78 Accepts]: Start accepts. Automaton has 77691 states and 113670 transitions. Word has length 314 [2019-09-10 06:23:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:46,185 INFO L475 AbstractCegarLoop]: Abstraction has 77691 states and 113670 transitions. [2019-09-10 06:23:46,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:46,185 INFO L276 IsEmpty]: Start isEmpty. Operand 77691 states and 113670 transitions. [2019-09-10 06:23:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:23:46,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:46,231 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:23:46,232 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1786640950, now seen corresponding path program 1 times [2019-09-10 06:23:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:46,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:46,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:46,594 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:23:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:46,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:46,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:46,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:46,596 INFO L87 Difference]: Start difference. First operand 77691 states and 113670 transitions. Second operand 4 states. [2019-09-10 06:23:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:46,841 INFO L93 Difference]: Finished difference Result 73752 states and 108079 transitions. [2019-09-10 06:23:46,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:46,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-09-10 06:23:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:46,940 INFO L225 Difference]: With dead ends: 73752 [2019-09-10 06:23:46,940 INFO L226 Difference]: Without dead ends: 69584 [2019-09-10 06:23:46,941 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:23:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69584 states. [2019-09-10 06:23:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69584 to 69257. [2019-09-10 06:23:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69257 states. [2019-09-10 06:23:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69257 states to 69257 states and 101214 transitions. [2019-09-10 06:23:48,290 INFO L78 Accepts]: Start accepts. Automaton has 69257 states and 101214 transitions. Word has length 315 [2019-09-10 06:23:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:48,290 INFO L475 AbstractCegarLoop]: Abstraction has 69257 states and 101214 transitions. [2019-09-10 06:23:48,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 69257 states and 101214 transitions. [2019-09-10 06:23:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:23:48,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:48,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:48,328 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash -748494562, now seen corresponding path program 1 times [2019-09-10 06:23:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:48,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:48,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:48,974 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:23:48,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:48,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:48,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:48,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:48,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:48,976 INFO L87 Difference]: Start difference. First operand 69257 states and 101214 transitions. Second operand 4 states. [2019-09-10 06:23:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:49,453 INFO L93 Difference]: Finished difference Result 128326 states and 185969 transitions. [2019-09-10 06:23:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:49,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 06:23:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:49,639 INFO L225 Difference]: With dead ends: 128326 [2019-09-10 06:23:49,640 INFO L226 Difference]: Without dead ends: 128326 [2019-09-10 06:23:49,640 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:23:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128326 states. [2019-09-10 06:23:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128326 to 128256. [2019-09-10 06:23:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128256 states. [2019-09-10 06:23:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128256 states to 128256 states and 185891 transitions. [2019-09-10 06:23:53,239 INFO L78 Accepts]: Start accepts. Automaton has 128256 states and 185891 transitions. Word has length 316 [2019-09-10 06:23:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:53,239 INFO L475 AbstractCegarLoop]: Abstraction has 128256 states and 185891 transitions. [2019-09-10 06:23:53,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 128256 states and 185891 transitions. [2019-09-10 06:23:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:23:53,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:53,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:23:53,320 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1841320925, now seen corresponding path program 1 times [2019-09-10 06:23:53,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:53,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:53,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:53,548 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:23:53,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:53,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:53,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:53,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:53,551 INFO L87 Difference]: Start difference. First operand 128256 states and 185891 transitions. Second operand 3 states. [2019-09-10 06:23:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:54,374 INFO L93 Difference]: Finished difference Result 250589 states and 360306 transitions. [2019-09-10 06:23:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:54,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-10 06:23:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:54,706 INFO L225 Difference]: With dead ends: 250589 [2019-09-10 06:23:54,706 INFO L226 Difference]: Without dead ends: 250589 [2019-09-10 06:23:54,707 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:23:54,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250589 states. [2019-09-10 06:23:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250589 to 250275. [2019-09-10 06:23:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250275 states. [2019-09-10 06:24:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250275 states to 250275 states and 359929 transitions. [2019-09-10 06:24:03,598 INFO L78 Accepts]: Start accepts. Automaton has 250275 states and 359929 transitions. Word has length 318 [2019-09-10 06:24:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:03,599 INFO L475 AbstractCegarLoop]: Abstraction has 250275 states and 359929 transitions. [2019-09-10 06:24:03,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 250275 states and 359929 transitions. [2019-09-10 06:24:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:24:03,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:03,751 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:03,751 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:03,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1602373406, now seen corresponding path program 1 times [2019-09-10 06:24:03,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:03,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:03,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:04,000 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:04,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:04,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:04,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:04,002 INFO L87 Difference]: Start difference. First operand 250275 states and 359929 transitions. Second operand 3 states. [2019-09-10 06:24:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:05,094 INFO L93 Difference]: Finished difference Result 489877 states and 697488 transitions. [2019-09-10 06:24:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:05,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:24:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:05,715 INFO L225 Difference]: With dead ends: 489877 [2019-09-10 06:24:05,716 INFO L226 Difference]: Without dead ends: 489877 [2019-09-10 06:24:05,716 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:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489877 states. [2019-09-10 06:24:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489877 to 489823. [2019-09-10 06:24:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489823 states. [2019-09-10 06:24:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489823 states to 489823 states and 697442 transitions. [2019-09-10 06:24:17,417 INFO L78 Accepts]: Start accepts. Automaton has 489823 states and 697442 transitions. Word has length 320 [2019-09-10 06:24:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:17,417 INFO L475 AbstractCegarLoop]: Abstraction has 489823 states and 697442 transitions. [2019-09-10 06:24:17,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:24:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 489823 states and 697442 transitions. [2019-09-10 06:24:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:24:17,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:17,712 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:17,712 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash 670669179, now seen corresponding path program 1 times [2019-09-10 06:24:17,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:17,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:17,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:17,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:17,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:18,077 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:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:18,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:24:18,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:18,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:24:18,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:24:18,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:24:18,079 INFO L87 Difference]: Start difference. First operand 489823 states and 697442 transitions. Second operand 4 states. [2019-09-10 06:24:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:26,409 INFO L93 Difference]: Finished difference Result 749294 states and 1064336 transitions. [2019-09-10 06:24:26,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:26,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 06:24:26,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:27,375 INFO L225 Difference]: With dead ends: 749294 [2019-09-10 06:24:27,375 INFO L226 Difference]: Without dead ends: 747278 [2019-09-10 06:24:27,376 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:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747278 states. [2019-09-10 06:24:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747278 to 466859. [2019-09-10 06:24:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466859 states. [2019-09-10 06:24:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466859 states to 466859 states and 664798 transitions. [2019-09-10 06:24:41,493 INFO L78 Accepts]: Start accepts. Automaton has 466859 states and 664798 transitions. Word has length 320 [2019-09-10 06:24:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:41,493 INFO L475 AbstractCegarLoop]: Abstraction has 466859 states and 664798 transitions. [2019-09-10 06:24:41,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 466859 states and 664798 transitions. [2019-09-10 06:24:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 06:24:41,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:41,747 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] [2019-09-10 06:24:41,748 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash -607694389, now seen corresponding path program 1 times [2019-09-10 06:24:41,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:41,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:41,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:41,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:41,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:41,896 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:41,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:41,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:41,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:41,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:41,899 INFO L87 Difference]: Start difference. First operand 466859 states and 664798 transitions. Second operand 3 states. [2019-09-10 06:24:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:45,423 INFO L93 Difference]: Finished difference Result 792605 states and 1124336 transitions. [2019-09-10 06:24:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:45,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 06:24:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:46,531 INFO L225 Difference]: With dead ends: 792605 [2019-09-10 06:24:46,531 INFO L226 Difference]: Without dead ends: 792605 [2019-09-10 06:24:46,532 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:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792605 states. [2019-09-10 06:25:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792605 to 466319. [2019-09-10 06:25:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466319 states. [2019-09-10 06:25:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466319 states to 466319 states and 663200 transitions. [2019-09-10 06:25:02,995 INFO L78 Accepts]: Start accepts. Automaton has 466319 states and 663200 transitions. Word has length 323 [2019-09-10 06:25:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:02,995 INFO L475 AbstractCegarLoop]: Abstraction has 466319 states and 663200 transitions. [2019-09-10 06:25:02,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 466319 states and 663200 transitions. [2019-09-10 06:25:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:25:03,255 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:03,255 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:25:03,255 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2099548108, now seen corresponding path program 1 times [2019-09-10 06:25:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:03,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:03,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:03,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:09,906 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:09,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:09,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:09,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:09,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:09,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:09,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:09,909 INFO L87 Difference]: Start difference. First operand 466319 states and 663200 transitions. Second operand 4 states. [2019-09-10 06:25:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:11,058 INFO L93 Difference]: Finished difference Result 448148 states and 638215 transitions. [2019-09-10 06:25:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:11,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 06:25:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:11,611 INFO L225 Difference]: With dead ends: 448148 [2019-09-10 06:25:11,612 INFO L226 Difference]: Without dead ends: 426350 [2019-09-10 06:25:11,612 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:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426350 states. [2019-09-10 06:25:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426350 to 423072. [2019-09-10 06:25:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423072 states. [2019-09-10 06:25:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423072 states to 423072 states and 600920 transitions. [2019-09-10 06:25:18,994 INFO L78 Accepts]: Start accepts. Automaton has 423072 states and 600920 transitions. Word has length 324 [2019-09-10 06:25:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:18,994 INFO L475 AbstractCegarLoop]: Abstraction has 423072 states and 600920 transitions. [2019-09-10 06:25:18,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 423072 states and 600920 transitions. [2019-09-10 06:25:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 06:25:19,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:19,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:19,253 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash -159531066, now seen corresponding path program 1 times [2019-09-10 06:25:19,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:19,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:19,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:20,547 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:20,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:20,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:25:20,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:20,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:25:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:25:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:20,549 INFO L87 Difference]: Start difference. First operand 423072 states and 600920 transitions. Second operand 5 states. [2019-09-10 06:25:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:24,566 INFO L93 Difference]: Finished difference Result 965426 states and 1378356 transitions. [2019-09-10 06:25:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:25:24,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2019-09-10 06:25:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:25,879 INFO L225 Difference]: With dead ends: 965426 [2019-09-10 06:25:25,879 INFO L226 Difference]: Without dead ends: 965426 [2019-09-10 06:25:25,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965426 states. [2019-09-10 06:25:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965426 to 693253. [2019-09-10 06:25:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693253 states. [2019-09-10 06:25:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693253 states to 693253 states and 989306 transitions. [2019-09-10 06:25:55,991 INFO L78 Accepts]: Start accepts. Automaton has 693253 states and 989306 transitions. Word has length 325 [2019-09-10 06:25:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:55,991 INFO L475 AbstractCegarLoop]: Abstraction has 693253 states and 989306 transitions. [2019-09-10 06:25:55,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:25:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 693253 states and 989306 transitions. [2019-09-10 06:25:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 06:25:56,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:56,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:56,399 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash -159192442, now seen corresponding path program 1 times [2019-09-10 06:25:56,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:56,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:56,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:57,196 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,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:25:57,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:57,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:25:57,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:25:57,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:25:57,198 INFO L87 Difference]: Start difference. First operand 693253 states and 989306 transitions. Second operand 16 states. [2019-09-10 06:26:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:08,356 INFO L93 Difference]: Finished difference Result 1473291 states and 2093401 transitions. [2019-09-10 06:26:08,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 06:26:08,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 325 [2019-09-10 06:26:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:20,780 INFO L225 Difference]: With dead ends: 1473291 [2019-09-10 06:26:20,780 INFO L226 Difference]: Without dead ends: 1473291 [2019-09-10 06:26:20,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 06:26:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473291 states. [2019-09-10 06:26:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473291 to 1111033. [2019-09-10 06:26:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111033 states. [2019-09-10 06:26:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111033 states to 1111033 states and 1571986 transitions. [2019-09-10 06:26:57,982 INFO L78 Accepts]: Start accepts. Automaton has 1111033 states and 1571986 transitions. Word has length 325 [2019-09-10 06:26:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:57,982 INFO L475 AbstractCegarLoop]: Abstraction has 1111033 states and 1571986 transitions. [2019-09-10 06:26:57,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:26:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1111033 states and 1571986 transitions. [2019-09-10 06:26:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-10 06:26:58,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:58,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:58,740 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -285022094, now seen corresponding path program 1 times [2019-09-10 06:26:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:58,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:59,171 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:26:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:59,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:59,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:59,175 INFO L87 Difference]: Start difference. First operand 1111033 states and 1571986 transitions. Second operand 4 states. [2019-09-10 06:27:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:19,244 INFO L93 Difference]: Finished difference Result 2170988 states and 3051464 transitions. [2019-09-10 06:27:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:19,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 325 [2019-09-10 06:27:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:23,894 INFO L225 Difference]: With dead ends: 2170988 [2019-09-10 06:27:23,895 INFO L226 Difference]: Without dead ends: 2170988 [2019-09-10 06:27:23,895 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:27:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170988 states.