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/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:58:31,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:58:31,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:58:31,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:58:31,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:58:31,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:58:31,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:58:31,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:58:31,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:58:31,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:58:31,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:58:31,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:58:31,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:58:31,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:58:31,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:58:31,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:58:31,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:58:31,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:58:31,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:58:31,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:58:31,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:58:31,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:58:31,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:58:31,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:58:31,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:58:31,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:58:31,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:58:31,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:58:31,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:58:31,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:58:31,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:58:31,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:58:32,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:58:32,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:58:32,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:58:32,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:58:32,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:58:32,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:58:32,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:58:32,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:58:32,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:58:32,005 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 04:58:32,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:58:32,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:58:32,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:58:32,021 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:58:32,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:58:32,022 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:58:32,022 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:58:32,023 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:58:32,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:58:32,023 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:58:32,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:58:32,024 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:58:32,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:58:32,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:58:32,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:58:32,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:58:32,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:58:32,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:58:32,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:58:32,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:58:32,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:58:32,026 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:58:32,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:58:32,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:58:32,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:58:32,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:58:32,027 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:58:32,027 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:58:32,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:58:32,028 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:58:32,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:58:32,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:58:32,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:58:32,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:58:32,074 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:58:32,075 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:32,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42869aea6/c1b3a9a1ef4942e7a323345356f6998f/FLAGe125c736b [2019-09-10 04:58:32,702 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:58:32,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:32,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42869aea6/c1b3a9a1ef4942e7a323345356f6998f/FLAGe125c736b [2019-09-10 04:58:32,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42869aea6/c1b3a9a1ef4942e7a323345356f6998f [2019-09-10 04:58:32,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:58:32,942 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:58:32,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:32,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:58:32,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:58:32,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:32" (1/1) ... [2019-09-10 04:58:32,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6493fb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:32, skipping insertion in model container [2019-09-10 04:58:32,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:58:32" (1/1) ... [2019-09-10 04:58:32,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:58:33,030 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:58:33,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:33,523 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:58:33,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:58:33,636 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:58:33,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33 WrapperNode [2019-09-10 04:58:33,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:58:33,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:58:33,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:58:33,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:58:33,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (1/1) ... [2019-09-10 04:58:33,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:58:33,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:58:33,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:58:33,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:58:33,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (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 04:58:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:58:33,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:58:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:58:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:58:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:58:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:58:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:58:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:58:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:58:33,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:58:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:58:33,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:58:33,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:58:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:58:33,831 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:58:33,832 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:58:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:58:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:58:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:58:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:58:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:58:33,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:58:35,382 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:58:35,382 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:58:35,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:35 BoogieIcfgContainer [2019-09-10 04:58:35,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:58:35,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:58:35,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:58:35,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:58:35,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:58:32" (1/3) ... [2019-09-10 04:58:35,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1e73fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:35, skipping insertion in model container [2019-09-10 04:58:35,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:58:33" (2/3) ... [2019-09-10 04:58:35,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1e73fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:58:35, skipping insertion in model container [2019-09-10 04:58:35,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:58:35" (3/3) ... [2019-09-10 04:58:35,394 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2019-09-10 04:58:35,405 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:58:35,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:58:35,430 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:58:35,454 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:58:35,455 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:58:35,455 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:58:35,455 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:58:35,455 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:58:35,455 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:58:35,455 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:58:35,455 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:58:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-10 04:58:35,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 04:58:35,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:35,506 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:58:35,509 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash 987011754, now seen corresponding path program 1 times [2019-09-10 04:58:35,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:35,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:35,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:35,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:35,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:36,095 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 04:58:36,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:36,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:58:36,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:36,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:58:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:58:36,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:58:36,125 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 5 states. [2019-09-10 04:58:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:36,300 INFO L93 Difference]: Finished difference Result 346 states and 592 transitions. [2019-09-10 04:58:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:58:36,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-10 04:58:36,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:36,329 INFO L225 Difference]: With dead ends: 346 [2019-09-10 04:58:36,329 INFO L226 Difference]: Without dead ends: 342 [2019-09-10 04:58:36,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-10 04:58:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-09-10 04:58:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-10 04:58:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 555 transitions. [2019-09-10 04:58:36,403 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 555 transitions. Word has length 102 [2019-09-10 04:58:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:36,404 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 555 transitions. [2019-09-10 04:58:36,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:58:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 555 transitions. [2019-09-10 04:58:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 04:58:36,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:36,414 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] [2019-09-10 04:58:36,416 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2122494834, now seen corresponding path program 1 times [2019-09-10 04:58:36,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:36,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:36,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:36,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:36,992 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 04:58:36,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:36,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:58:36,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:36,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:58:36,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:58:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:58:36,997 INFO L87 Difference]: Start difference. First operand 342 states and 555 transitions. Second operand 11 states. [2019-09-10 04:58:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:43,473 INFO L93 Difference]: Finished difference Result 1499 states and 2446 transitions. [2019-09-10 04:58:43,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 04:58:43,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2019-09-10 04:58:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:43,488 INFO L225 Difference]: With dead ends: 1499 [2019-09-10 04:58:43,488 INFO L226 Difference]: Without dead ends: 1499 [2019-09-10 04:58:43,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 04:58:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2019-09-10 04:58:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1272. [2019-09-10 04:58:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-10 04:58:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2064 transitions. [2019-09-10 04:58:43,595 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2064 transitions. Word has length 135 [2019-09-10 04:58:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:43,596 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2064 transitions. [2019-09-10 04:58:43,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:58:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2064 transitions. [2019-09-10 04:58:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 04:58:43,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:43,606 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] [2019-09-10 04:58:43,606 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 46803838, now seen corresponding path program 1 times [2019-09-10 04:58:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:43,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:43,868 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 04:58:43,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:43,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:58:43,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:43,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:58:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:58:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:43,881 INFO L87 Difference]: Start difference. First operand 1272 states and 2064 transitions. Second operand 6 states. [2019-09-10 04:58:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:46,971 INFO L93 Difference]: Finished difference Result 3228 states and 5200 transitions. [2019-09-10 04:58:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:58:46,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 04:58:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:46,989 INFO L225 Difference]: With dead ends: 3228 [2019-09-10 04:58:46,990 INFO L226 Difference]: Without dead ends: 3228 [2019-09-10 04:58:46,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:58:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-09-10 04:58:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 3213. [2019-09-10 04:58:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3213 states. [2019-09-10 04:58:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 3213 states and 5182 transitions. [2019-09-10 04:58:47,098 INFO L78 Accepts]: Start accepts. Automaton has 3213 states and 5182 transitions. Word has length 136 [2019-09-10 04:58:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:47,099 INFO L475 AbstractCegarLoop]: Abstraction has 3213 states and 5182 transitions. [2019-09-10 04:58:47,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:58:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3213 states and 5182 transitions. [2019-09-10 04:58:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 04:58:47,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:47,103 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] [2019-09-10 04:58:47,104 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 73207465, now seen corresponding path program 1 times [2019-09-10 04:58:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:47,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:47,271 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 04:58:47,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:47,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:58:47,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:47,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:58:47,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:58:47,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:47,273 INFO L87 Difference]: Start difference. First operand 3213 states and 5182 transitions. Second operand 6 states. [2019-09-10 04:58:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:49,601 INFO L93 Difference]: Finished difference Result 8883 states and 14234 transitions. [2019-09-10 04:58:49,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:58:49,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-10 04:58:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:49,655 INFO L225 Difference]: With dead ends: 8883 [2019-09-10 04:58:49,656 INFO L226 Difference]: Without dead ends: 8883 [2019-09-10 04:58:49,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:58:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8883 states. [2019-09-10 04:58:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8883 to 8853. [2019-09-10 04:58:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8853 states. [2019-09-10 04:58:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8853 states to 8853 states and 14186 transitions. [2019-09-10 04:58:49,974 INFO L78 Accepts]: Start accepts. Automaton has 8853 states and 14186 transitions. Word has length 137 [2019-09-10 04:58:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:49,975 INFO L475 AbstractCegarLoop]: Abstraction has 8853 states and 14186 transitions. [2019-09-10 04:58:49,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:58:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 8853 states and 14186 transitions. [2019-09-10 04:58:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 04:58:49,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:49,980 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] [2019-09-10 04:58:49,980 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:49,980 INFO L82 PathProgramCache]: Analyzing trace with hash 840034965, now seen corresponding path program 1 times [2019-09-10 04:58:49,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:49,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:49,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:50,137 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 04:58:50,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:50,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:58:50,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:50,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:58:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:58:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:50,139 INFO L87 Difference]: Start difference. First operand 8853 states and 14186 transitions. Second operand 6 states. [2019-09-10 04:58:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:53,055 INFO L93 Difference]: Finished difference Result 30028 states and 47900 transitions. [2019-09-10 04:58:53,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:58:53,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-10 04:58:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:53,239 INFO L225 Difference]: With dead ends: 30028 [2019-09-10 04:58:53,240 INFO L226 Difference]: Without dead ends: 30028 [2019-09-10 04:58:53,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:58:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30028 states. [2019-09-10 04:58:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30028 to 29940. [2019-09-10 04:58:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29940 states. [2019-09-10 04:58:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29940 states to 29940 states and 47736 transitions. [2019-09-10 04:58:54,379 INFO L78 Accepts]: Start accepts. Automaton has 29940 states and 47736 transitions. Word has length 138 [2019-09-10 04:58:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:58:54,379 INFO L475 AbstractCegarLoop]: Abstraction has 29940 states and 47736 transitions. [2019-09-10 04:58:54,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:58:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29940 states and 47736 transitions. [2019-09-10 04:58:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 04:58:54,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:58:54,387 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] [2019-09-10 04:58:54,388 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:58:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:58:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1209801248, now seen corresponding path program 1 times [2019-09-10 04:58:54,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:58:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:58:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:58:54,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:58:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:58:54,628 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 04:58:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:58:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:58:54,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:58:54,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:58:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:58:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:58:54,631 INFO L87 Difference]: Start difference. First operand 29940 states and 47736 transitions. Second operand 6 states. [2019-09-10 04:58:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:57,911 INFO L93 Difference]: Finished difference Result 128739 states and 205961 transitions. [2019-09-10 04:58:57,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:58:57,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-10 04:58:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:58,419 INFO L225 Difference]: With dead ends: 128739 [2019-09-10 04:58:58,419 INFO L226 Difference]: Without dead ends: 128739 [2019-09-10 04:58:58,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:58:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128739 states. [2019-09-10 04:59:00,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128739 to 102306. [2019-09-10 04:59:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102306 states. [2019-09-10 04:59:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102306 states to 102306 states and 163562 transitions. [2019-09-10 04:59:03,378 INFO L78 Accepts]: Start accepts. Automaton has 102306 states and 163562 transitions. Word has length 139 [2019-09-10 04:59:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:03,388 INFO L475 AbstractCegarLoop]: Abstraction has 102306 states and 163562 transitions. [2019-09-10 04:59:03,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:59:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 102306 states and 163562 transitions. [2019-09-10 04:59:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 04:59:03,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:03,401 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] [2019-09-10 04:59:03,401 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2058852264, now seen corresponding path program 1 times [2019-09-10 04:59:03,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:03,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:03,521 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 04:59:03,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:03,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:59:03,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:03,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:59:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:59:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:59:03,524 INFO L87 Difference]: Start difference. First operand 102306 states and 163562 transitions. Second operand 4 states. [2019-09-10 04:59:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:04,669 INFO L93 Difference]: Finished difference Result 270529 states and 430738 transitions. [2019-09-10 04:59:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:59:04,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-10 04:59:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:06,258 INFO L225 Difference]: With dead ends: 270529 [2019-09-10 04:59:06,258 INFO L226 Difference]: Without dead ends: 270529 [2019-09-10 04:59:06,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:59:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270529 states. [2019-09-10 04:59:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270529 to 268521. [2019-09-10 04:59:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268521 states. [2019-09-10 04:59:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268521 states to 268521 states and 428076 transitions. [2019-09-10 04:59:14,069 INFO L78 Accepts]: Start accepts. Automaton has 268521 states and 428076 transitions. Word has length 141 [2019-09-10 04:59:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:14,070 INFO L475 AbstractCegarLoop]: Abstraction has 268521 states and 428076 transitions. [2019-09-10 04:59:14,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:59:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 268521 states and 428076 transitions. [2019-09-10 04:59:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 04:59:14,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:14,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:14,080 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash 285888988, now seen corresponding path program 1 times [2019-09-10 04:59:14,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:14,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:14,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:17,929 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 04:59:17,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:17,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:59:17,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:17,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:59:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:59:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:59:17,931 INFO L87 Difference]: Start difference. First operand 268521 states and 428076 transitions. Second operand 11 states. [2019-09-10 04:59:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:27,878 INFO L93 Difference]: Finished difference Result 385379 states and 615440 transitions. [2019-09-10 04:59:27,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-10 04:59:27,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2019-09-10 04:59:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:28,857 INFO L225 Difference]: With dead ends: 385379 [2019-09-10 04:59:28,857 INFO L226 Difference]: Without dead ends: 385379 [2019-09-10 04:59:28,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=2473, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 04:59:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385379 states. [2019-09-10 04:59:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385379 to 346429. [2019-09-10 04:59:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346429 states. [2019-09-10 04:59:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346429 states to 346429 states and 552200 transitions. [2019-09-10 04:59:36,541 INFO L78 Accepts]: Start accepts. Automaton has 346429 states and 552200 transitions. Word has length 142 [2019-09-10 04:59:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:59:36,544 INFO L475 AbstractCegarLoop]: Abstraction has 346429 states and 552200 transitions. [2019-09-10 04:59:36,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:59:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 346429 states and 552200 transitions. [2019-09-10 04:59:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 04:59:36,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:59:36,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:59:36,552 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:59:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:59:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1053402540, now seen corresponding path program 1 times [2019-09-10 04:59:36,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:59:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:36,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:59:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:59:36,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:59:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:59:42,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 04:59:42,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:59:42,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 04:59:42,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:59:42,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 04:59:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 04:59:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:59:42,417 INFO L87 Difference]: Start difference. First operand 346429 states and 552200 transitions. Second operand 12 states. [2019-09-10 04:59:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:59:54,894 INFO L93 Difference]: Finished difference Result 867055 states and 1400812 transitions. [2019-09-10 04:59:54,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-10 04:59:54,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-09-10 04:59:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:59:57,320 INFO L225 Difference]: With dead ends: 867055 [2019-09-10 04:59:57,320 INFO L226 Difference]: Without dead ends: 867055 [2019-09-10 04:59:57,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=771, Invalid=2651, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 05:00:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867055 states. [2019-09-10 05:00:13,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867055 to 713904. [2019-09-10 05:00:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713904 states. [2019-09-10 05:00:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713904 states to 713904 states and 1152524 transitions. [2019-09-10 05:00:24,342 INFO L78 Accepts]: Start accepts. Automaton has 713904 states and 1152524 transitions. Word has length 143 [2019-09-10 05:00:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:00:24,343 INFO L475 AbstractCegarLoop]: Abstraction has 713904 states and 1152524 transitions. [2019-09-10 05:00:24,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 05:00:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 713904 states and 1152524 transitions. [2019-09-10 05:00:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 05:00:24,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:00:24,350 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] [2019-09-10 05:00:24,350 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:00:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:00:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2082761838, now seen corresponding path program 1 times [2019-09-10 05:00:24,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:00:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:24,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:00:24,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:00:24,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:00:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:00:24,489 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 05:00:24,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:00:24,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 05:00:24,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:00:24,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 05:00:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 05:00:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:00:24,491 INFO L87 Difference]: Start difference. First operand 713904 states and 1152524 transitions. Second operand 7 states. [2019-09-10 05:00:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:00:37,804 INFO L93 Difference]: Finished difference Result 698509 states and 1128583 transitions. [2019-09-10 05:00:37,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 05:00:37,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-10 05:00:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:00:40,452 INFO L225 Difference]: With dead ends: 698509 [2019-09-10 05:00:40,453 INFO L226 Difference]: Without dead ends: 698509 [2019-09-10 05:00:40,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 05:00:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698509 states. [2019-09-10 05:00:54,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698509 to 589641. [2019-09-10 05:00:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589641 states. [2019-09-10 05:01:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589641 states to 589641 states and 952468 transitions. [2019-09-10 05:01:05,288 INFO L78 Accepts]: Start accepts. Automaton has 589641 states and 952468 transitions. Word has length 143 [2019-09-10 05:01:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:05,288 INFO L475 AbstractCegarLoop]: Abstraction has 589641 states and 952468 transitions. [2019-09-10 05:01:05,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 05:01:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 589641 states and 952468 transitions. [2019-09-10 05:01:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 05:01:05,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:05,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 05:01:05,295 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -286420435, now seen corresponding path program 1 times [2019-09-10 05:01:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:05,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:05,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:05,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:05,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:05,470 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 05:01:05,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:01:05,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:05,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:01:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:01:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:01:05,472 INFO L87 Difference]: Start difference. First operand 589641 states and 952468 transitions. Second operand 5 states. [2019-09-10 05:01:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:01:17,947 INFO L93 Difference]: Finished difference Result 773994 states and 1235527 transitions. [2019-09-10 05:01:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:01:17,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 05:01:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:01:19,961 INFO L225 Difference]: With dead ends: 773994 [2019-09-10 05:01:19,961 INFO L226 Difference]: Without dead ends: 773994 [2019-09-10 05:01:19,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:01:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773994 states. [2019-09-10 05:01:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773994 to 730482. [2019-09-10 05:01:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730482 states. [2019-09-10 05:01:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730482 states to 730482 states and 1187947 transitions. [2019-09-10 05:01:46,864 INFO L78 Accepts]: Start accepts. Automaton has 730482 states and 1187947 transitions. Word has length 144 [2019-09-10 05:01:46,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:01:46,864 INFO L475 AbstractCegarLoop]: Abstraction has 730482 states and 1187947 transitions. [2019-09-10 05:01:46,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 05:01:46,864 INFO L276 IsEmpty]: Start isEmpty. Operand 730482 states and 1187947 transitions. [2019-09-10 05:01:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 05:01:46,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:01:46,871 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] [2019-09-10 05:01:46,871 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:01:46,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:01:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1038829530, now seen corresponding path program 1 times [2019-09-10 05:01:46,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:01:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:01:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:01:46,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:01:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:01:47,090 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 05:01:47,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:01:47,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 05:01:47,090 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:01:47,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 05:01:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 05:01:47,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 05:01:47,091 INFO L87 Difference]: Start difference. First operand 730482 states and 1187947 transitions. Second operand 11 states. [2019-09-10 05:02:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:02:15,604 INFO L93 Difference]: Finished difference Result 1119247 states and 1825776 transitions. [2019-09-10 05:02:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-10 05:02:15,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 145 [2019-09-10 05:02:15,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:02:18,956 INFO L225 Difference]: With dead ends: 1119247 [2019-09-10 05:02:18,956 INFO L226 Difference]: Without dead ends: 1119247 [2019-09-10 05:02:18,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=625, Invalid=2567, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 05:02:19,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119247 states. [2019-09-10 05:02:46,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119247 to 1077875. [2019-09-10 05:02:46,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077875 states. [2019-09-10 05:03:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077875 states to 1077875 states and 1754281 transitions. [2019-09-10 05:03:06,322 INFO L78 Accepts]: Start accepts. Automaton has 1077875 states and 1754281 transitions. Word has length 145 [2019-09-10 05:03:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 05:03:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 1077875 states and 1754281 transitions. [2019-09-10 05:03:06,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 05:03:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1077875 states and 1754281 transitions. [2019-09-10 05:03:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 05:03:06,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 05:03:06,331 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] [2019-09-10 05:03:06,331 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 05:03:06,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 05:03:06,331 INFO L82 PathProgramCache]: Analyzing trace with hash -898697865, now seen corresponding path program 1 times [2019-09-10 05:03:06,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 05:03:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 05:03:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 05:03:06,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 05:03:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 05:03:06,531 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 05:03:06,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 05:03:06,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 05:03:06,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 05:03:06,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 05:03:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 05:03:06,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 05:03:06,533 INFO L87 Difference]: Start difference. First operand 1077875 states and 1754281 transitions. Second operand 5 states. [2019-09-10 05:03:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 05:03:27,742 INFO L93 Difference]: Finished difference Result 2140861 states and 3461057 transitions. [2019-09-10 05:03:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 05:03:27,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-10 05:03:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 05:03:48,749 INFO L225 Difference]: With dead ends: 2140861 [2019-09-10 05:03:48,750 INFO L226 Difference]: Without dead ends: 2140861 [2019-09-10 05:03:48,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 05:03:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140861 states.