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.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:17:59,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:17:59,660 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:17:59,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:17:59,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:17:59,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:17:59,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:17:59,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:17:59,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:17:59,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:17:59,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:17:59,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:17:59,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:17:59,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:17:59,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:17:59,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:17:59,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:17:59,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:17:59,719 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:17:59,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:17:59,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:17:59,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:17:59,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:17:59,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:17:59,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:17:59,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:17:59,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:17:59,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:17:59,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:17:59,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:17:59,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:17:59,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:17:59,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:17:59,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:17:59,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:17:59,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:17:59,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:17:59,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:17:59,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:17:59,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:17:59,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:17:59,751 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:17:59,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:17:59,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:17:59,777 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:17:59,777 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:17:59,778 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:17:59,778 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:17:59,779 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:17:59,779 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:17:59,779 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:17:59,779 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:17:59,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:17:59,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:17:59,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:17:59,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:17:59,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:17:59,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:17:59,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:17:59,783 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:17:59,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:17:59,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:17:59,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:17:59,784 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:17:59,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:17:59,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:17:59,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:17:59,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:17:59,785 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:17:59,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:17:59,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:17:59,786 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:17:59,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:17:59,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:17:59,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:17:59,864 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:17:59,865 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:17:59,866 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.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:17:59,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfacca464/67d06234170b456094a6d37f6c70c178/FLAG1b6fa5610 [2019-09-10 06:18:00,538 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:18:00,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:18:00,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfacca464/67d06234170b456094a6d37f6c70c178/FLAG1b6fa5610 [2019-09-10 06:18:00,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfacca464/67d06234170b456094a6d37f6c70c178 [2019-09-10 06:18:00,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:18:00,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:18:00,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:18:00,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:18:00,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:18:00,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:18:00" (1/1) ... [2019-09-10 06:18:00,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64899908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:00, skipping insertion in model container [2019-09-10 06:18:00,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:18:00" (1/1) ... [2019-09-10 06:18:00,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:18:00,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:18:01,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:18:01,651 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:18:02,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:18:02,188 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:18:02,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02 WrapperNode [2019-09-10 06:18:02,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:18:02,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:18:02,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:18:02,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:18:02,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... [2019-09-10 06:18:02,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:18:02,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:18:02,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:18:02,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:18:02,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:18:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:18:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:18:02,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:18:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:18:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:18:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:18:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:18:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:18:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:18:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:18:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:18:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:18:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:18:04,377 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:18:04,378 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:18:04,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:04 BoogieIcfgContainer [2019-09-10 06:18:04,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:18:04,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:18:04,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:18:04,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:18:04,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:18:00" (1/3) ... [2019-09-10 06:18:04,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2627ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:04, skipping insertion in model container [2019-09-10 06:18:04,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:18:02" (2/3) ... [2019-09-10 06:18:04,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2627ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:18:04, skipping insertion in model container [2019-09-10 06:18:04,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:18:04" (3/3) ... [2019-09-10 06:18:04,387 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:18:04,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:18:04,417 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:18:04,433 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:18:04,457 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:18:04,457 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:18:04,457 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:18:04,458 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:18:04,458 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:18:04,458 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:18:04,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:18:04,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:18:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states. [2019-09-10 06:18:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 06:18:04,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:04,516 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] [2019-09-10 06:18:04,518 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1318645382, now seen corresponding path program 1 times [2019-09-10 06:18:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:04,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:04,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:05,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:05,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:05,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:05,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:05,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:05,817 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 4 states. [2019-09-10 06:18:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:06,052 INFO L93 Difference]: Finished difference Result 1144 states and 2026 transitions. [2019-09-10 06:18:06,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:18:06,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 06:18:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:06,085 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 06:18:06,086 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 06:18:06,089 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:18:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 06:18:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2019-09-10 06:18:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-09-10 06:18:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1769 transitions. [2019-09-10 06:18:06,223 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1769 transitions. Word has length 238 [2019-09-10 06:18:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:06,224 INFO L475 AbstractCegarLoop]: Abstraction has 1134 states and 1769 transitions. [2019-09-10 06:18:06,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1769 transitions. [2019-09-10 06:18:06,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 06:18:06,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:06,239 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] [2019-09-10 06:18:06,240 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 359530467, now seen corresponding path program 1 times [2019-09-10 06:18:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:06,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:06,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:06,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:18:06,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:06,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:06,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:06,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:06,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:06,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,551 INFO L87 Difference]: Start difference. First operand 1134 states and 1769 transitions. Second operand 3 states. [2019-09-10 06:18:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:06,632 INFO L93 Difference]: Finished difference Result 2224 states and 3452 transitions. [2019-09-10 06:18:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:06,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-10 06:18:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:06,645 INFO L225 Difference]: With dead ends: 2224 [2019-09-10 06:18:06,646 INFO L226 Difference]: Without dead ends: 2224 [2019-09-10 06:18:06,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-09-10 06:18:06,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2222. [2019-09-10 06:18:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-09-10 06:18:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3451 transitions. [2019-09-10 06:18:06,704 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3451 transitions. Word has length 240 [2019-09-10 06:18:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:06,705 INFO L475 AbstractCegarLoop]: Abstraction has 2222 states and 3451 transitions. [2019-09-10 06:18:06,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3451 transitions. [2019-09-10 06:18:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 06:18:06,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:06,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] [2019-09-10 06:18:06,713 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1850631464, now seen corresponding path program 1 times [2019-09-10 06:18:06,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:06,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:06,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:06,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:06,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:06,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:06,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:06,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:06,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,869 INFO L87 Difference]: Start difference. First operand 2222 states and 3451 transitions. Second operand 3 states. [2019-09-10 06:18:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:06,921 INFO L93 Difference]: Finished difference Result 4411 states and 6842 transitions. [2019-09-10 06:18:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:06,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-10 06:18:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:06,952 INFO L225 Difference]: With dead ends: 4411 [2019-09-10 06:18:06,952 INFO L226 Difference]: Without dead ends: 4411 [2019-09-10 06:18:06,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4411 states. [2019-09-10 06:18:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4411 to 2241. [2019-09-10 06:18:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2241 states. [2019-09-10 06:18:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3479 transitions. [2019-09-10 06:18:07,071 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3479 transitions. Word has length 240 [2019-09-10 06:18:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:07,072 INFO L475 AbstractCegarLoop]: Abstraction has 2241 states and 3479 transitions. [2019-09-10 06:18:07,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3479 transitions. [2019-09-10 06:18:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 06:18:07,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:07,084 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] [2019-09-10 06:18:07,085 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:07,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:07,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1279339238, now seen corresponding path program 1 times [2019-09-10 06:18:07,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:07,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:07,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:07,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:07,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:07,252 INFO L87 Difference]: Start difference. First operand 2241 states and 3479 transitions. Second operand 3 states. [2019-09-10 06:18:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:07,337 INFO L93 Difference]: Finished difference Result 4429 states and 6863 transitions. [2019-09-10 06:18:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:07,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-10 06:18:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:07,365 INFO L225 Difference]: With dead ends: 4429 [2019-09-10 06:18:07,366 INFO L226 Difference]: Without dead ends: 4429 [2019-09-10 06:18:07,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2019-09-10 06:18:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 2259. [2019-09-10 06:18:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-09-10 06:18:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3500 transitions. [2019-09-10 06:18:07,461 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3500 transitions. Word has length 241 [2019-09-10 06:18:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:07,461 INFO L475 AbstractCegarLoop]: Abstraction has 2259 states and 3500 transitions. [2019-09-10 06:18:07,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3500 transitions. [2019-09-10 06:18:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 06:18:07,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:07,473 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] [2019-09-10 06:18:07,473 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1753365598, now seen corresponding path program 1 times [2019-09-10 06:18:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:07,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:07,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:07,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:07,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:07,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:07,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:07,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:07,847 INFO L87 Difference]: Start difference. First operand 2259 states and 3500 transitions. Second operand 3 states. [2019-09-10 06:18:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:07,947 INFO L93 Difference]: Finished difference Result 4340 states and 6673 transitions. [2019-09-10 06:18:07,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:07,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-09-10 06:18:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:07,971 INFO L225 Difference]: With dead ends: 4340 [2019-09-10 06:18:07,971 INFO L226 Difference]: Without dead ends: 4340 [2019-09-10 06:18:07,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2019-09-10 06:18:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4338. [2019-09-10 06:18:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4338 states. [2019-09-10 06:18:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6672 transitions. [2019-09-10 06:18:08,083 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6672 transitions. Word has length 242 [2019-09-10 06:18:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:08,084 INFO L475 AbstractCegarLoop]: Abstraction has 4338 states and 6672 transitions. [2019-09-10 06:18:08,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6672 transitions. [2019-09-10 06:18:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 06:18:08,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:08,096 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] [2019-09-10 06:18:08,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1077008123, now seen corresponding path program 1 times [2019-09-10 06:18:08,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:08,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:08,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:08,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:08,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:08,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:08,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:08,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:08,426 INFO L87 Difference]: Start difference. First operand 4338 states and 6672 transitions. Second operand 4 states. [2019-09-10 06:18:08,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:08,534 INFO L93 Difference]: Finished difference Result 7849 states and 11979 transitions. [2019-09-10 06:18:08,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:08,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-10 06:18:08,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:08,578 INFO L225 Difference]: With dead ends: 7849 [2019-09-10 06:18:08,579 INFO L226 Difference]: Without dead ends: 7849 [2019-09-10 06:18:08,579 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:18:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7849 states. [2019-09-10 06:18:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7849 to 4573. [2019-09-10 06:18:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4573 states. [2019-09-10 06:18:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 7060 transitions. [2019-09-10 06:18:08,709 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 7060 transitions. Word has length 242 [2019-09-10 06:18:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:08,710 INFO L475 AbstractCegarLoop]: Abstraction has 4573 states and 7060 transitions. [2019-09-10 06:18:08,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 7060 transitions. [2019-09-10 06:18:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 06:18:08,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:08,723 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] [2019-09-10 06:18:08,723 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:08,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1840004283, now seen corresponding path program 1 times [2019-09-10 06:18:08,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:08,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:08,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:08,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:08,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:08,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:08,848 INFO L87 Difference]: Start difference. First operand 4573 states and 7060 transitions. Second operand 3 states. [2019-09-10 06:18:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:08,905 INFO L93 Difference]: Finished difference Result 8379 states and 12764 transitions. [2019-09-10 06:18:08,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:08,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-10 06:18:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:08,924 INFO L225 Difference]: With dead ends: 8379 [2019-09-10 06:18:08,924 INFO L226 Difference]: Without dead ends: 8379 [2019-09-10 06:18:08,925 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2019-09-10 06:18:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 4677. [2019-09-10 06:18:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4677 states. [2019-09-10 06:18:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4677 states to 4677 states and 7203 transitions. [2019-09-10 06:18:09,042 INFO L78 Accepts]: Start accepts. Automaton has 4677 states and 7203 transitions. Word has length 244 [2019-09-10 06:18:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:09,042 INFO L475 AbstractCegarLoop]: Abstraction has 4677 states and 7203 transitions. [2019-09-10 06:18:09,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 4677 states and 7203 transitions. [2019-09-10 06:18:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 06:18:09,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:09,053 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] [2019-09-10 06:18:09,054 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1634782981, now seen corresponding path program 1 times [2019-09-10 06:18:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:09,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:09,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:09,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:09,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:09,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:09,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:09,207 INFO L87 Difference]: Start difference. First operand 4677 states and 7203 transitions. Second operand 3 states. [2019-09-10 06:18:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:09,259 INFO L93 Difference]: Finished difference Result 8504 states and 12910 transitions. [2019-09-10 06:18:09,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:09,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 06:18:09,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:09,276 INFO L225 Difference]: With dead ends: 8504 [2019-09-10 06:18:09,276 INFO L226 Difference]: Without dead ends: 8504 [2019-09-10 06:18:09,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8504 states. [2019-09-10 06:18:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8504 to 4802. [2019-09-10 06:18:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4802 states. [2019-09-10 06:18:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4802 states to 4802 states and 7349 transitions. [2019-09-10 06:18:09,374 INFO L78 Accepts]: Start accepts. Automaton has 4802 states and 7349 transitions. Word has length 245 [2019-09-10 06:18:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:09,374 INFO L475 AbstractCegarLoop]: Abstraction has 4802 states and 7349 transitions. [2019-09-10 06:18:09,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4802 states and 7349 transitions. [2019-09-10 06:18:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:18:09,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:09,385 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] [2019-09-10 06:18:09,385 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1220135646, now seen corresponding path program 1 times [2019-09-10 06:18:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:09,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:09,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:09,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:09,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:09,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:09,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:09,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:09,552 INFO L87 Difference]: Start difference. First operand 4802 states and 7349 transitions. Second operand 3 states. [2019-09-10 06:18:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:10,035 INFO L93 Difference]: Finished difference Result 7616 states and 11550 transitions. [2019-09-10 06:18:10,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:10,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-10 06:18:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:10,052 INFO L225 Difference]: With dead ends: 7616 [2019-09-10 06:18:10,052 INFO L226 Difference]: Without dead ends: 7616 [2019-09-10 06:18:10,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7616 states. [2019-09-10 06:18:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7616 to 7614. [2019-09-10 06:18:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2019-09-10 06:18:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 11549 transitions. [2019-09-10 06:18:10,225 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 11549 transitions. Word has length 246 [2019-09-10 06:18:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:10,225 INFO L475 AbstractCegarLoop]: Abstraction has 7614 states and 11549 transitions. [2019-09-10 06:18:10,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 11549 transitions. [2019-09-10 06:18:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:18:10,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:10,245 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] [2019-09-10 06:18:10,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:10,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:10,246 INFO L82 PathProgramCache]: Analyzing trace with hash -724010275, now seen corresponding path program 1 times [2019-09-10 06:18:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:10,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:11,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:11,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 06:18:11,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:11,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 06:18:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 06:18:11,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:18:11,194 INFO L87 Difference]: Start difference. First operand 7614 states and 11549 transitions. Second operand 17 states. [2019-09-10 06:18:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:13,866 INFO L93 Difference]: Finished difference Result 20447 states and 31397 transitions. [2019-09-10 06:18:13,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 06:18:13,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 246 [2019-09-10 06:18:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:13,908 INFO L225 Difference]: With dead ends: 20447 [2019-09-10 06:18:13,909 INFO L226 Difference]: Without dead ends: 20447 [2019-09-10 06:18:13,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=945, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 06:18:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20447 states. [2019-09-10 06:18:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20447 to 12606. [2019-09-10 06:18:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12606 states. [2019-09-10 06:18:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12606 states to 12606 states and 19121 transitions. [2019-09-10 06:18:14,210 INFO L78 Accepts]: Start accepts. Automaton has 12606 states and 19121 transitions. Word has length 246 [2019-09-10 06:18:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:14,211 INFO L475 AbstractCegarLoop]: Abstraction has 12606 states and 19121 transitions. [2019-09-10 06:18:14,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 06:18:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 12606 states and 19121 transitions. [2019-09-10 06:18:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 06:18:14,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:14,236 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] [2019-09-10 06:18:14,236 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:14,237 INFO L82 PathProgramCache]: Analyzing trace with hash -572749154, now seen corresponding path program 1 times [2019-09-10 06:18:14,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:14,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:14,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:14,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:14,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:14,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:14,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:14,650 INFO L87 Difference]: Start difference. First operand 12606 states and 19121 transitions. Second operand 4 states. [2019-09-10 06:18:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:14,789 INFO L93 Difference]: Finished difference Result 24481 states and 36893 transitions. [2019-09-10 06:18:14,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:14,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 06:18:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:14,835 INFO L225 Difference]: With dead ends: 24481 [2019-09-10 06:18:14,836 INFO L226 Difference]: Without dead ends: 24481 [2019-09-10 06:18:14,837 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:18:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2019-09-10 06:18:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 24479. [2019-09-10 06:18:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24479 states. [2019-09-10 06:18:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24479 states to 24479 states and 36892 transitions. [2019-09-10 06:18:15,208 INFO L78 Accepts]: Start accepts. Automaton has 24479 states and 36892 transitions. Word has length 246 [2019-09-10 06:18:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:15,209 INFO L475 AbstractCegarLoop]: Abstraction has 24479 states and 36892 transitions. [2019-09-10 06:18:15,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 24479 states and 36892 transitions. [2019-09-10 06:18:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:18:15,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:15,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] [2019-09-10 06:18:15,254 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:15,254 INFO L82 PathProgramCache]: Analyzing trace with hash -154325052, now seen corresponding path program 1 times [2019-09-10 06:18:15,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:15,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:15,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:15,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:16,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:16,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:16,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:16,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:16,033 INFO L87 Difference]: Start difference. First operand 24479 states and 36892 transitions. Second operand 3 states. [2019-09-10 06:18:16,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:16,219 INFO L93 Difference]: Finished difference Result 47499 states and 70952 transitions. [2019-09-10 06:18:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:16,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 06:18:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:16,299 INFO L225 Difference]: With dead ends: 47499 [2019-09-10 06:18:16,299 INFO L226 Difference]: Without dead ends: 47499 [2019-09-10 06:18:16,300 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47499 states. [2019-09-10 06:18:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47499 to 47497. [2019-09-10 06:18:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47497 states. [2019-09-10 06:18:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47497 states to 47497 states and 70951 transitions. [2019-09-10 06:18:17,072 INFO L78 Accepts]: Start accepts. Automaton has 47497 states and 70951 transitions. Word has length 248 [2019-09-10 06:18:17,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:17,072 INFO L475 AbstractCegarLoop]: Abstraction has 47497 states and 70951 transitions. [2019-09-10 06:18:17,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47497 states and 70951 transitions. [2019-09-10 06:18:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:18:17,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:17,122 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] [2019-09-10 06:18:17,123 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:17,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1734884072, now seen corresponding path program 1 times [2019-09-10 06:18:17,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:17,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:17,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:17,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:17,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:17,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:17,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:17,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:17,418 INFO L87 Difference]: Start difference. First operand 47497 states and 70951 transitions. Second operand 4 states. [2019-09-10 06:18:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:17,873 INFO L93 Difference]: Finished difference Result 93702 states and 139723 transitions. [2019-09-10 06:18:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:17,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2019-09-10 06:18:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:18,027 INFO L225 Difference]: With dead ends: 93702 [2019-09-10 06:18:18,028 INFO L226 Difference]: Without dead ends: 93702 [2019-09-10 06:18:18,028 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:18:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93702 states. [2019-09-10 06:18:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93702 to 48348. [2019-09-10 06:18:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48348 states. [2019-09-10 06:18:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48348 states to 48348 states and 72354 transitions. [2019-09-10 06:18:19,035 INFO L78 Accepts]: Start accepts. Automaton has 48348 states and 72354 transitions. Word has length 248 [2019-09-10 06:18:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:19,035 INFO L475 AbstractCegarLoop]: Abstraction has 48348 states and 72354 transitions. [2019-09-10 06:18:19,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 48348 states and 72354 transitions. [2019-09-10 06:18:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 06:18:20,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:20,235 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] [2019-09-10 06:18:20,235 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:20,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash -295412293, now seen corresponding path program 1 times [2019-09-10 06:18:20,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:20,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:20,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:20,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:20,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:20,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:20,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:20,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:20,455 INFO L87 Difference]: Start difference. First operand 48348 states and 72354 transitions. Second operand 3 states. [2019-09-10 06:18:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:20,770 INFO L93 Difference]: Finished difference Result 93438 states and 138564 transitions. [2019-09-10 06:18:20,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:20,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-09-10 06:18:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:20,894 INFO L225 Difference]: With dead ends: 93438 [2019-09-10 06:18:20,895 INFO L226 Difference]: Without dead ends: 93438 [2019-09-10 06:18:20,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93438 states. [2019-09-10 06:18:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93438 to 93436. [2019-09-10 06:18:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93436 states. [2019-09-10 06:18:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93436 states to 93436 states and 138563 transitions. [2019-09-10 06:18:22,131 INFO L78 Accepts]: Start accepts. Automaton has 93436 states and 138563 transitions. Word has length 248 [2019-09-10 06:18:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:22,132 INFO L475 AbstractCegarLoop]: Abstraction has 93436 states and 138563 transitions. [2019-09-10 06:18:22,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 93436 states and 138563 transitions. [2019-09-10 06:18:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-10 06:18:22,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:22,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:22,207 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:22,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:22,207 INFO L82 PathProgramCache]: Analyzing trace with hash 134212028, now seen corresponding path program 1 times [2019-09-10 06:18:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:22,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:22,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:22,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:22,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:22,445 INFO L87 Difference]: Start difference. First operand 93436 states and 138563 transitions. Second operand 4 states. [2019-09-10 06:18:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:22,685 INFO L93 Difference]: Finished difference Result 85652 states and 127121 transitions. [2019-09-10 06:18:22,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:22,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2019-09-10 06:18:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:22,926 INFO L225 Difference]: With dead ends: 85652 [2019-09-10 06:18:22,926 INFO L226 Difference]: Without dead ends: 80220 [2019-09-10 06:18:22,927 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:18:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80220 states. [2019-09-10 06:18:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80220 to 79612. [2019-09-10 06:18:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79612 states. [2019-09-10 06:18:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79612 states to 79612 states and 117874 transitions. [2019-09-10 06:18:25,372 INFO L78 Accepts]: Start accepts. Automaton has 79612 states and 117874 transitions. Word has length 250 [2019-09-10 06:18:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:25,373 INFO L475 AbstractCegarLoop]: Abstraction has 79612 states and 117874 transitions. [2019-09-10 06:18:25,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:25,373 INFO L276 IsEmpty]: Start isEmpty. Operand 79612 states and 117874 transitions. [2019-09-10 06:18:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 06:18:25,422 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:25,423 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] [2019-09-10 06:18:25,423 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 869891100, now seen corresponding path program 1 times [2019-09-10 06:18:25,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:25,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:25,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:25,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:18:25,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:25,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:18:25,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:18:25,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:18:25,943 INFO L87 Difference]: Start difference. First operand 79612 states and 117874 transitions. Second operand 4 states. [2019-09-10 06:18:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:26,461 INFO L93 Difference]: Finished difference Result 148395 states and 217995 transitions. [2019-09-10 06:18:26,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:18:26,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-09-10 06:18:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:26,609 INFO L225 Difference]: With dead ends: 148395 [2019-09-10 06:18:26,609 INFO L226 Difference]: Without dead ends: 148395 [2019-09-10 06:18:26,610 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:18:26,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148395 states. [2019-09-10 06:18:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148395 to 148393. [2019-09-10 06:18:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148393 states. [2019-09-10 06:18:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148393 states to 148393 states and 217994 transitions. [2019-09-10 06:18:30,390 INFO L78 Accepts]: Start accepts. Automaton has 148393 states and 217994 transitions. Word has length 254 [2019-09-10 06:18:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:30,391 INFO L475 AbstractCegarLoop]: Abstraction has 148393 states and 217994 transitions. [2019-09-10 06:18:30,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:18:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 148393 states and 217994 transitions. [2019-09-10 06:18:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 06:18:30,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:30,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:18:30,476 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 357940351, now seen corresponding path program 1 times [2019-09-10 06:18:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:30,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:30,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:30,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:30,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:30,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:30,650 INFO L87 Difference]: Start difference. First operand 148393 states and 217994 transitions. Second operand 3 states. [2019-09-10 06:18:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:31,439 INFO L93 Difference]: Finished difference Result 289891 states and 422186 transitions. [2019-09-10 06:18:31,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:31,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 06:18:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:31,774 INFO L225 Difference]: With dead ends: 289891 [2019-09-10 06:18:31,774 INFO L226 Difference]: Without dead ends: 289891 [2019-09-10 06:18:31,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289891 states. [2019-09-10 06:18:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289891 to 289826. [2019-09-10 06:18:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289826 states. [2019-09-10 06:18:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289826 states to 289826 states and 422122 transitions. [2019-09-10 06:18:37,626 INFO L78 Accepts]: Start accepts. Automaton has 289826 states and 422122 transitions. Word has length 256 [2019-09-10 06:18:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:18:37,626 INFO L475 AbstractCegarLoop]: Abstraction has 289826 states and 422122 transitions. [2019-09-10 06:18:37,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:18:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 289826 states and 422122 transitions. [2019-09-10 06:18:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 06:18:41,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:18:41,800 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] [2019-09-10 06:18:41,800 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:18:41,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:18:41,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1555643955, now seen corresponding path program 1 times [2019-09-10 06:18:41,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:18:41,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:41,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:18:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:18:41,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:18:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:18:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:18:41,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:18:41,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:18:41,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:18:41,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:18:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:18:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:41,998 INFO L87 Difference]: Start difference. First operand 289826 states and 422122 transitions. Second operand 3 states. [2019-09-10 06:18:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:18:43,157 INFO L93 Difference]: Finished difference Result 566951 states and 818747 transitions. [2019-09-10 06:18:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:18:43,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-09-10 06:18:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:18:43,997 INFO L225 Difference]: With dead ends: 566951 [2019-09-10 06:18:43,997 INFO L226 Difference]: Without dead ends: 566951 [2019-09-10 06:18:43,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:18:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566951 states. [2019-09-10 06:18:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566951 to 566949. [2019-09-10 06:18:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566949 states. [2019-09-10 06:19:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566949 states to 566949 states and 818746 transitions. [2019-09-10 06:19:01,756 INFO L78 Accepts]: Start accepts. Automaton has 566949 states and 818746 transitions. Word has length 256 [2019-09-10 06:19:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:01,756 INFO L475 AbstractCegarLoop]: Abstraction has 566949 states and 818746 transitions. [2019-09-10 06:19:01,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 566949 states and 818746 transitions. [2019-09-10 06:19:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 06:19:02,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:02,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:02,166 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1957982058, now seen corresponding path program 1 times [2019-09-10 06:19:02,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:02,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:02,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:02,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:02,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:02,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:02,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:02,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:02,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:02,420 INFO L87 Difference]: Start difference. First operand 566949 states and 818746 transitions. Second operand 4 states. [2019-09-10 06:19:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:06,499 INFO L93 Difference]: Finished difference Result 892501 states and 1283709 transitions. [2019-09-10 06:19:06,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:06,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-10 06:19:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:07,524 INFO L225 Difference]: With dead ends: 892501 [2019-09-10 06:19:07,524 INFO L226 Difference]: Without dead ends: 889643 [2019-09-10 06:19:07,524 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:19:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889643 states. [2019-09-10 06:19:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889643 to 541217. [2019-09-10 06:19:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541217 states. [2019-09-10 06:19:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541217 states to 541217 states and 781608 transitions. [2019-09-10 06:19:25,717 INFO L78 Accepts]: Start accepts. Automaton has 541217 states and 781608 transitions. Word has length 256 [2019-09-10 06:19:25,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:25,717 INFO L475 AbstractCegarLoop]: Abstraction has 541217 states and 781608 transitions. [2019-09-10 06:19:25,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:19:25,718 INFO L276 IsEmpty]: Start isEmpty. Operand 541217 states and 781608 transitions. [2019-09-10 06:19:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 06:19:26,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:26,040 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] [2019-09-10 06:19:26,040 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:26,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2062702899, now seen corresponding path program 1 times [2019-09-10 06:19:26,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:26,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:26,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:26,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:26,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:19:26,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:26,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:19:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:19:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:26,180 INFO L87 Difference]: Start difference. First operand 541217 states and 781608 transitions. Second operand 3 states. [2019-09-10 06:19:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:35,204 INFO L93 Difference]: Finished difference Result 912859 states and 1312821 transitions. [2019-09-10 06:19:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:19:35,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 06:19:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:36,245 INFO L225 Difference]: With dead ends: 912859 [2019-09-10 06:19:36,245 INFO L226 Difference]: Without dead ends: 912859 [2019-09-10 06:19:36,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:19:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912859 states. [2019-09-10 06:19:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912859 to 542177. [2019-09-10 06:19:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542177 states. [2019-09-10 06:19:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542177 states to 542177 states and 781852 transitions. [2019-09-10 06:19:52,301 INFO L78 Accepts]: Start accepts. Automaton has 542177 states and 781852 transitions. Word has length 257 [2019-09-10 06:19:52,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:19:52,301 INFO L475 AbstractCegarLoop]: Abstraction has 542177 states and 781852 transitions. [2019-09-10 06:19:52,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:19:52,301 INFO L276 IsEmpty]: Start isEmpty. Operand 542177 states and 781852 transitions. [2019-09-10 06:19:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 06:19:52,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:19:52,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:19:52,673 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:19:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:19:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1184695454, now seen corresponding path program 1 times [2019-09-10 06:19:52,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:19:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:52,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:19:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:19:52,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:19:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:19:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:19:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:19:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:19:52,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:19:52,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:19:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:19:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:19:52,905 INFO L87 Difference]: Start difference. First operand 542177 states and 781852 transitions. Second operand 4 states. [2019-09-10 06:19:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:19:55,538 INFO L93 Difference]: Finished difference Result 510529 states and 737136 transitions. [2019-09-10 06:19:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:19:55,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 06:19:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:19:56,071 INFO L225 Difference]: With dead ends: 510529 [2019-09-10 06:19:56,071 INFO L226 Difference]: Without dead ends: 483089 [2019-09-10 06:19:56,071 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:19:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483089 states. [2019-09-10 06:20:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483089 to 478777. [2019-09-10 06:20:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478777 states. [2019-09-10 06:20:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478777 states to 478777 states and 689509 transitions. [2019-09-10 06:20:11,265 INFO L78 Accepts]: Start accepts. Automaton has 478777 states and 689509 transitions. Word has length 258 [2019-09-10 06:20:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:11,265 INFO L475 AbstractCegarLoop]: Abstraction has 478777 states and 689509 transitions. [2019-09-10 06:20:11,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 478777 states and 689509 transitions. [2019-09-10 06:20:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 06:20:11,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:11,591 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] [2019-09-10 06:20:11,592 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1777596726, now seen corresponding path program 1 times [2019-09-10 06:20:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:11,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:11,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:11,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:11,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:20:19,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:19,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:20:19,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:19,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:20:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:20:19,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:20:19,694 INFO L87 Difference]: Start difference. First operand 478777 states and 689509 transitions. Second operand 4 states. [2019-09-10 06:20:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:20:22,610 INFO L93 Difference]: Finished difference Result 931236 states and 1327332 transitions. [2019-09-10 06:20:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:20:22,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-09-10 06:20:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:20:23,806 INFO L225 Difference]: With dead ends: 931236 [2019-09-10 06:20:23,806 INFO L226 Difference]: Without dead ends: 931236 [2019-09-10 06:20:23,806 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:20:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931236 states. [2019-09-10 06:20:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931236 to 931234. [2019-09-10 06:20:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931234 states. [2019-09-10 06:20:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931234 states to 931234 states and 1327331 transitions. [2019-09-10 06:20:57,708 INFO L78 Accepts]: Start accepts. Automaton has 931234 states and 1327331 transitions. Word has length 262 [2019-09-10 06:20:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:20:57,708 INFO L475 AbstractCegarLoop]: Abstraction has 931234 states and 1327331 transitions. [2019-09-10 06:20:57,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:20:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 931234 states and 1327331 transitions. [2019-09-10 06:20:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 06:20:58,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:20:58,372 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] [2019-09-10 06:20:58,372 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:20:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:20:58,372 INFO L82 PathProgramCache]: Analyzing trace with hash -388319510, now seen corresponding path program 1 times [2019-09-10 06:20:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:20:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:58,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:20:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:20:58,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:20:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:20:58,557 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:20:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:20:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:20:58,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:20:58,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:20:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:20:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:20:58,559 INFO L87 Difference]: Start difference. First operand 931234 states and 1327331 transitions. Second operand 3 states. [2019-09-10 06:21:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:14,926 INFO L93 Difference]: Finished difference Result 1822994 states and 2573104 transitions. [2019-09-10 06:21:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:14,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 06:21:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:18,192 INFO L225 Difference]: With dead ends: 1822994 [2019-09-10 06:21:18,192 INFO L226 Difference]: Without dead ends: 1822994 [2019-09-10 06:21:18,192 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:21:19,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822994 states. [2019-09-10 06:22:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822994 to 1822992. [2019-09-10 06:22:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822992 states.