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_floodmax.5_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:08:06,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:08:06,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:08:06,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:08:06,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:08:06,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:08:06,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:08:06,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:08:06,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:08:06,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:08:06,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:08:06,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:08:06,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:08:06,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:08:06,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:08:06,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:08:06,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:08:06,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:08:06,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:08:06,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:08:06,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:08:06,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:08:06,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:08:06,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:08:06,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:08:06,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:08:06,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:08:06,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:08:06,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:08:06,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:08:06,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:08:06,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:08:06,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:08:06,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:08:06,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:08:06,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:08:06,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:08:06,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:08:06,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:08:06,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:08:06,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:08:06,915 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:08:06,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:08:06,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:08:06,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:08:06,931 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:08:06,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:08:06,932 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:08:06,932 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:08:06,933 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:08:06,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:08:06,933 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:08:06,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:08:06,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:08:06,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:08:06,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:08:06,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:08:06,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:08:06,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:08:06,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:08:06,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:08:06,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:08:06,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:08:06,936 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:08:06,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:08:06,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:08:06,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:08:06,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:08:06,937 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:08:06,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:08:06,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:08:06,937 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:08:06,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:08:06,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:08:06,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:08:06,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:08:06,999 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:08:07,000 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:08:07,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af60714d/5c8d92a0b5e548a2aa6558cd86ea9fc3/FLAG81ca40a92 [2019-09-10 04:08:07,673 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:08:07,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:08:07,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af60714d/5c8d92a0b5e548a2aa6558cd86ea9fc3/FLAG81ca40a92 [2019-09-10 04:08:07,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af60714d/5c8d92a0b5e548a2aa6558cd86ea9fc3 [2019-09-10 04:08:07,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:08:07,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:08:07,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:08:07,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:08:07,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:08:07,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:08:07" (1/1) ... [2019-09-10 04:08:07,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743d159a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:07, skipping insertion in model container [2019-09-10 04:08:07,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:08:07" (1/1) ... [2019-09-10 04:08:07,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:08:08,064 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:08:08,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:08:08,764 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:08:08,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:08:08,980 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:08:08,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08 WrapperNode [2019-09-10 04:08:08,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:08:08,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:08:08,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:08:08,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:08:08,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (1/1) ... [2019-09-10 04:08:09,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:08:09,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:08:09,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:08:09,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:08:09,178 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (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:08:09,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:08:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:08:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:08:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:08:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:08:09,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:08:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:08:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:08:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:08:09,269 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:08:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:08:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:08:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:08:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:08:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:08:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:08:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:08:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:08:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:08:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:08:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:08:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:08:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:08:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:08:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:08:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:08:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:08:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:08:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:08:11,636 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:08:11,636 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:08:11,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:08:11 BoogieIcfgContainer [2019-09-10 04:08:11,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:08:11,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:08:11,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:08:11,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:08:11,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:08:07" (1/3) ... [2019-09-10 04:08:11,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5101a27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:08:11, skipping insertion in model container [2019-09-10 04:08:11,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:08:08" (2/3) ... [2019-09-10 04:08:11,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5101a27b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:08:11, skipping insertion in model container [2019-09-10 04:08:11,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:08:11" (3/3) ... [2019-09-10 04:08:11,646 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:08:11,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:08:11,670 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:08:11,687 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:08:11,723 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:08:11,723 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:08:11,723 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:08:11,724 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:08:11,724 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:08:11,724 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:08:11,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:08:11,724 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:08:11,769 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states. [2019-09-10 04:08:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 04:08:11,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:11,804 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] [2019-09-10 04:08:11,807 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1458522874, now seen corresponding path program 1 times [2019-09-10 04:08:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:11,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:11,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:11,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:12,505 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:08:12,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:12,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:08:12,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:12,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:08:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:08:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:08:12,532 INFO L87 Difference]: Start difference. First operand 731 states. Second operand 5 states. [2019-09-10 04:08:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:12,816 INFO L93 Difference]: Finished difference Result 730 states and 1323 transitions. [2019-09-10 04:08:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:08:12,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 04:08:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:12,864 INFO L225 Difference]: With dead ends: 730 [2019-09-10 04:08:12,864 INFO L226 Difference]: Without dead ends: 726 [2019-09-10 04:08:12,870 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:08:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-10 04:08:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2019-09-10 04:08:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2019-09-10 04:08:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1260 transitions. [2019-09-10 04:08:12,974 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1260 transitions. Word has length 176 [2019-09-10 04:08:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:12,976 INFO L475 AbstractCegarLoop]: Abstraction has 726 states and 1260 transitions. [2019-09-10 04:08:12,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:08:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1260 transitions. [2019-09-10 04:08:12,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 04:08:12,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:12,984 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] [2019-09-10 04:08:12,984 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:12,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1878998709, now seen corresponding path program 1 times [2019-09-10 04:08:12,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:12,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:12,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:12,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:13,654 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:08:13,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:13,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:08:13,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:13,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:08:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:08:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:08:13,658 INFO L87 Difference]: Start difference. First operand 726 states and 1260 transitions. Second operand 13 states. [2019-09-10 04:08:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:27,490 INFO L93 Difference]: Finished difference Result 2702 states and 4559 transitions. [2019-09-10 04:08:27,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:08:27,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-10 04:08:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:27,511 INFO L225 Difference]: With dead ends: 2702 [2019-09-10 04:08:27,511 INFO L226 Difference]: Without dead ends: 2702 [2019-09-10 04:08:27,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:08:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-09-10 04:08:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1950. [2019-09-10 04:08:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-09-10 04:08:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 3302 transitions. [2019-09-10 04:08:27,628 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 3302 transitions. Word has length 235 [2019-09-10 04:08:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:27,629 INFO L475 AbstractCegarLoop]: Abstraction has 1950 states and 3302 transitions. [2019-09-10 04:08:27,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:08:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 3302 transitions. [2019-09-10 04:08:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:08:27,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:27,636 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] [2019-09-10 04:08:27,637 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:27,638 INFO L82 PathProgramCache]: Analyzing trace with hash 943582996, now seen corresponding path program 1 times [2019-09-10 04:08:27,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:27,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:27,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:27,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:27,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:08:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:27,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:27,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:27,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:27,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:27,964 INFO L87 Difference]: Start difference. First operand 1950 states and 3302 transitions. Second operand 6 states. [2019-09-10 04:08:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:32,198 INFO L93 Difference]: Finished difference Result 3376 states and 5661 transitions. [2019-09-10 04:08:32,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:08:32,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-10 04:08:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:32,219 INFO L225 Difference]: With dead ends: 3376 [2019-09-10 04:08:32,220 INFO L226 Difference]: Without dead ends: 3376 [2019-09-10 04:08:32,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:08:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-09-10 04:08:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3195. [2019-09-10 04:08:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-09-10 04:08:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 5365 transitions. [2019-09-10 04:08:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 5365 transitions. Word has length 236 [2019-09-10 04:08:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:32,328 INFO L475 AbstractCegarLoop]: Abstraction has 3195 states and 5365 transitions. [2019-09-10 04:08:32,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 5365 transitions. [2019-09-10 04:08:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 04:08:32,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:32,336 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] [2019-09-10 04:08:32,337 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1802382302, now seen corresponding path program 1 times [2019-09-10 04:08:32,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:32,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:32,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:32,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:32,729 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:08:32,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:32,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:32,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:32,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:32,732 INFO L87 Difference]: Start difference. First operand 3195 states and 5365 transitions. Second operand 6 states. [2019-09-10 04:08:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:37,523 INFO L93 Difference]: Finished difference Result 6261 states and 10418 transitions. [2019-09-10 04:08:37,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:08:37,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 04:08:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:37,558 INFO L225 Difference]: With dead ends: 6261 [2019-09-10 04:08:37,558 INFO L226 Difference]: Without dead ends: 6261 [2019-09-10 04:08:37,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:08:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6261 states. [2019-09-10 04:08:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6261 to 5347. [2019-09-10 04:08:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5347 states. [2019-09-10 04:08:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 8908 transitions. [2019-09-10 04:08:37,744 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 8908 transitions. Word has length 237 [2019-09-10 04:08:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:37,745 INFO L475 AbstractCegarLoop]: Abstraction has 5347 states and 8908 transitions. [2019-09-10 04:08:37,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 8908 transitions. [2019-09-10 04:08:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 04:08:37,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:37,754 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 04:08:37,754 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1079645557, now seen corresponding path program 1 times [2019-09-10 04:08:37,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:37,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:37,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:38,108 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:08:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:38,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:38,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:38,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:38,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:38,111 INFO L87 Difference]: Start difference. First operand 5347 states and 8908 transitions. Second operand 6 states. [2019-09-10 04:08:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:42,403 INFO L93 Difference]: Finished difference Result 16000 states and 26436 transitions. [2019-09-10 04:08:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:08:42,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-10 04:08:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:42,497 INFO L225 Difference]: With dead ends: 16000 [2019-09-10 04:08:42,498 INFO L226 Difference]: Without dead ends: 16000 [2019-09-10 04:08:42,498 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:08:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16000 states. [2019-09-10 04:08:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16000 to 13206. [2019-09-10 04:08:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13206 states. [2019-09-10 04:08:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13206 states to 13206 states and 21807 transitions. [2019-09-10 04:08:42,900 INFO L78 Accepts]: Start accepts. Automaton has 13206 states and 21807 transitions. Word has length 238 [2019-09-10 04:08:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:42,901 INFO L475 AbstractCegarLoop]: Abstraction has 13206 states and 21807 transitions. [2019-09-10 04:08:42,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13206 states and 21807 transitions. [2019-09-10 04:08:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 04:08:42,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:42,918 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] [2019-09-10 04:08:42,919 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash -201327879, now seen corresponding path program 1 times [2019-09-10 04:08:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:42,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:43,355 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:08:43,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:43,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:43,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:43,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:43,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:43,358 INFO L87 Difference]: Start difference. First operand 13206 states and 21807 transitions. Second operand 6 states. [2019-09-10 04:08:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:48,820 INFO L93 Difference]: Finished difference Result 63264 states and 104046 transitions. [2019-09-10 04:08:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:08:48,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-10 04:08:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:49,127 INFO L225 Difference]: With dead ends: 63264 [2019-09-10 04:08:49,128 INFO L226 Difference]: Without dead ends: 63264 [2019-09-10 04:08:49,130 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:08:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63264 states. [2019-09-10 04:08:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63264 to 63112. [2019-09-10 04:08:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63112 states. [2019-09-10 04:08:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63112 states to 63112 states and 103754 transitions. [2019-09-10 04:08:51,512 INFO L78 Accepts]: Start accepts. Automaton has 63112 states and 103754 transitions. Word has length 239 [2019-09-10 04:08:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:08:51,513 INFO L475 AbstractCegarLoop]: Abstraction has 63112 states and 103754 transitions. [2019-09-10 04:08:51,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:08:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 63112 states and 103754 transitions. [2019-09-10 04:08:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:08:51,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:08:51,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:08:51,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:08:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:08:51,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1205031426, now seen corresponding path program 1 times [2019-09-10 04:08:51,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:08:51,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:08:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:08:51,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:08:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:08:51,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 04:08:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:08:51,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:08:51,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:08:51,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:08:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:08:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:08:51,869 INFO L87 Difference]: Start difference. First operand 63112 states and 103754 transitions. Second operand 6 states. [2019-09-10 04:08:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:57,919 INFO L93 Difference]: Finished difference Result 223740 states and 367308 transitions. [2019-09-10 04:08:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:08:57,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 04:08:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:01,042 INFO L225 Difference]: With dead ends: 223740 [2019-09-10 04:09:01,043 INFO L226 Difference]: Without dead ends: 223740 [2019-09-10 04:09:01,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:09:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223740 states. [2019-09-10 04:09:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223740 to 223338. [2019-09-10 04:09:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223338 states. [2019-09-10 04:09:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223338 states to 223338 states and 366549 transitions. [2019-09-10 04:09:05,322 INFO L78 Accepts]: Start accepts. Automaton has 223338 states and 366549 transitions. Word has length 240 [2019-09-10 04:09:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:05,323 INFO L475 AbstractCegarLoop]: Abstraction has 223338 states and 366549 transitions. [2019-09-10 04:09:05,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:09:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 223338 states and 366549 transitions. [2019-09-10 04:09:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:09:05,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:05,339 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 04:09:05,339 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1944727475, now seen corresponding path program 1 times [2019-09-10 04:09:05,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:05,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:05,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:05,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:05,738 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:09:05,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:05,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:09:05,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:05,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:09:05,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:09:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:09:05,741 INFO L87 Difference]: Start difference. First operand 223338 states and 366549 transitions. Second operand 13 states. [2019-09-10 04:09:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:25,616 INFO L93 Difference]: Finished difference Result 299126 states and 492013 transitions. [2019-09-10 04:09:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:09:25,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-10 04:09:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:26,641 INFO L225 Difference]: With dead ends: 299126 [2019-09-10 04:09:26,641 INFO L226 Difference]: Without dead ends: 299126 [2019-09-10 04:09:26,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:09:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299126 states. [2019-09-10 04:09:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299126 to 277932. [2019-09-10 04:09:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277932 states. [2019-09-10 04:09:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277932 states to 277932 states and 456906 transitions. [2019-09-10 04:09:37,953 INFO L78 Accepts]: Start accepts. Automaton has 277932 states and 456906 transitions. Word has length 240 [2019-09-10 04:09:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:09:37,954 INFO L475 AbstractCegarLoop]: Abstraction has 277932 states and 456906 transitions. [2019-09-10 04:09:37,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:09:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 277932 states and 456906 transitions. [2019-09-10 04:09:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:09:37,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:09:37,966 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 04:09:37,967 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:09:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:09:37,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1172011226, now seen corresponding path program 1 times [2019-09-10 04:09:37,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:09:37,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:37,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:09:37,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:09:37,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:09:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:09:38,316 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:09:38,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:09:38,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:09:38,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:09:38,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:09:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:09:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:09:38,318 INFO L87 Difference]: Start difference. First operand 277932 states and 456906 transitions. Second operand 13 states. [2019-09-10 04:09:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:09:58,172 INFO L93 Difference]: Finished difference Result 369316 states and 608709 transitions. [2019-09-10 04:09:58,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:09:58,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-10 04:09:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:09:58,999 INFO L225 Difference]: With dead ends: 369316 [2019-09-10 04:09:58,999 INFO L226 Difference]: Without dead ends: 369316 [2019-09-10 04:09:59,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1069, Invalid=4631, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:09:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369316 states. [2019-09-10 04:10:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369316 to 239721. [2019-09-10 04:10:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239721 states. [2019-09-10 04:10:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239721 states to 239721 states and 394190 transitions. [2019-09-10 04:10:08,666 INFO L78 Accepts]: Start accepts. Automaton has 239721 states and 394190 transitions. Word has length 240 [2019-09-10 04:10:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:08,666 INFO L475 AbstractCegarLoop]: Abstraction has 239721 states and 394190 transitions. [2019-09-10 04:10:08,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:10:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 239721 states and 394190 transitions. [2019-09-10 04:10:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:10:08,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:08,681 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 04:10:08,682 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 823250115, now seen corresponding path program 1 times [2019-09-10 04:10:08,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:08,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:08,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:08,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:09,831 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:10:09,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:10:09,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:10:09,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:09,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:10:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:10:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:10:09,835 INFO L87 Difference]: Start difference. First operand 239721 states and 394190 transitions. Second operand 13 states. [2019-09-10 04:10:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:28,907 INFO L93 Difference]: Finished difference Result 301431 states and 496665 transitions. [2019-09-10 04:10:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-09-10 04:10:28,908 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-10 04:10:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:29,541 INFO L225 Difference]: With dead ends: 301431 [2019-09-10 04:10:29,541 INFO L226 Difference]: Without dead ends: 301431 [2019-09-10 04:10:29,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1055, Invalid=4495, Unknown=0, NotChecked=0, Total=5550 [2019-09-10 04:10:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301431 states. [2019-09-10 04:10:37,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301431 to 278566. [2019-09-10 04:10:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278566 states. [2019-09-10 04:10:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278566 states to 278566 states and 458747 transitions. [2019-09-10 04:10:37,749 INFO L78 Accepts]: Start accepts. Automaton has 278566 states and 458747 transitions. Word has length 240 [2019-09-10 04:10:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:10:37,750 INFO L475 AbstractCegarLoop]: Abstraction has 278566 states and 458747 transitions. [2019-09-10 04:10:37,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:10:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 278566 states and 458747 transitions. [2019-09-10 04:10:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:10:37,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:10:37,762 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 04:10:37,762 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:10:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:10:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1335725012, now seen corresponding path program 1 times [2019-09-10 04:10:37,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:10:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:37,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:10:37,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:10:37,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:10:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:10:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:10:38,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:10:38,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:10:38,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:10:38,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:10:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:10:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:10:38,079 INFO L87 Difference]: Start difference. First operand 278566 states and 458747 transitions. Second operand 13 states. [2019-09-10 04:10:50,628 WARN L188 SmtUtils]: Spent 3.09 s on a formula simplification that was a NOOP. DAG size: 19 [2019-09-10 04:10:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:10:58,461 INFO L93 Difference]: Finished difference Result 330187 states and 544512 transitions. [2019-09-10 04:10:58,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:10:58,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-10 04:10:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:10:59,183 INFO L225 Difference]: With dead ends: 330187 [2019-09-10 04:10:59,183 INFO L226 Difference]: Without dead ends: 330187 [2019-09-10 04:10:59,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:10:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330187 states. [2019-09-10 04:11:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330187 to 302525. [2019-09-10 04:11:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302525 states. [2019-09-10 04:11:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302525 states to 302525 states and 498611 transitions. [2019-09-10 04:11:10,675 INFO L78 Accepts]: Start accepts. Automaton has 302525 states and 498611 transitions. Word has length 240 [2019-09-10 04:11:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:10,676 INFO L475 AbstractCegarLoop]: Abstraction has 302525 states and 498611 transitions. [2019-09-10 04:11:10,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:11:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand 302525 states and 498611 transitions. [2019-09-10 04:11:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:11:10,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:10,686 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 04:11:10,686 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash 850596241, now seen corresponding path program 1 times [2019-09-10 04:11:10,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:10,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:10,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:10,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:11,007 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:11:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:11:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:11:11,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:11,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:11:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:11:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:11:11,009 INFO L87 Difference]: Start difference. First operand 302525 states and 498611 transitions. Second operand 13 states. [2019-09-10 04:11:19,170 WARN L188 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-10 04:11:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:11:31,650 INFO L93 Difference]: Finished difference Result 389807 states and 644009 transitions. [2019-09-10 04:11:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:11:31,650 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 240 [2019-09-10 04:11:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:11:32,536 INFO L225 Difference]: With dead ends: 389807 [2019-09-10 04:11:32,537 INFO L226 Difference]: Without dead ends: 389807 [2019-09-10 04:11:32,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:11:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389807 states. [2019-09-10 04:11:36,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389807 to 329689. [2019-09-10 04:11:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329689 states. [2019-09-10 04:11:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329689 states to 329689 states and 544354 transitions. [2019-09-10 04:11:38,734 INFO L78 Accepts]: Start accepts. Automaton has 329689 states and 544354 transitions. Word has length 240 [2019-09-10 04:11:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:11:38,734 INFO L475 AbstractCegarLoop]: Abstraction has 329689 states and 544354 transitions. [2019-09-10 04:11:38,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:11:38,734 INFO L276 IsEmpty]: Start isEmpty. Operand 329689 states and 544354 transitions. [2019-09-10 04:11:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 04:11:38,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:11:38,742 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 04:11:38,742 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:11:38,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:11:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash -338319474, now seen corresponding path program 1 times [2019-09-10 04:11:38,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:11:38,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:38,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:11:38,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:11:38,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:11:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:11:39,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 04:11:39,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:11:39,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 04:11:39,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:11:39,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:11:39,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:11:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 04:11:39,181 INFO L87 Difference]: Start difference. First operand 329689 states and 544354 transitions. Second operand 14 states. [2019-09-10 04:12:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:06,768 INFO L93 Difference]: Finished difference Result 786172 states and 1332710 transitions. [2019-09-10 04:12:06,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 04:12:06,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 241 [2019-09-10 04:12:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:09,207 INFO L225 Difference]: With dead ends: 786172 [2019-09-10 04:12:09,208 INFO L226 Difference]: Without dead ends: 786172 [2019-09-10 04:12:09,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1420, Invalid=5720, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 04:12:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786172 states. [2019-09-10 04:12:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786172 to 711655. [2019-09-10 04:12:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711655 states. [2019-09-10 04:12:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711655 states to 711655 states and 1183148 transitions. [2019-09-10 04:12:40,284 INFO L78 Accepts]: Start accepts. Automaton has 711655 states and 1183148 transitions. Word has length 241 [2019-09-10 04:12:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:12:40,285 INFO L475 AbstractCegarLoop]: Abstraction has 711655 states and 1183148 transitions. [2019-09-10 04:12:40,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 04:12:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 711655 states and 1183148 transitions. [2019-09-10 04:12:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 04:12:40,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:12:40,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:12:40,296 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:12:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:12:40,296 INFO L82 PathProgramCache]: Analyzing trace with hash 85327248, now seen corresponding path program 1 times [2019-09-10 04:12:40,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:12:40,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:40,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:12:40,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:12:40,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:12:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:12:40,511 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:12:40,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:12:40,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:12:40,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:12:40,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:12:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:12:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:12:40,514 INFO L87 Difference]: Start difference. First operand 711655 states and 1183148 transitions. Second operand 7 states. [2019-09-10 04:12:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:12:54,454 INFO L93 Difference]: Finished difference Result 988758 states and 1646593 transitions. [2019-09-10 04:12:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:12:54,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 241 [2019-09-10 04:12:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:12:58,310 INFO L225 Difference]: With dead ends: 988758 [2019-09-10 04:12:58,310 INFO L226 Difference]: Without dead ends: 988758 [2019-09-10 04:12:58,310 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 04:12:58,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988758 states. [2019-09-10 04:13:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988758 to 987131. [2019-09-10 04:13:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987131 states. [2019-09-10 04:13:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987131 states to 987131 states and 1643492 transitions. [2019-09-10 04:13:36,034 INFO L78 Accepts]: Start accepts. Automaton has 987131 states and 1643492 transitions. Word has length 241 [2019-09-10 04:13:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:13:36,035 INFO L475 AbstractCegarLoop]: Abstraction has 987131 states and 1643492 transitions. [2019-09-10 04:13:36,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:13:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 987131 states and 1643492 transitions. [2019-09-10 04:13:36,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 04:13:36,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:13:36,045 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 04:13:36,046 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:13:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:13:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1518032058, now seen corresponding path program 1 times [2019-09-10 04:13:36,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:13:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:36,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:13:36,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:13:36,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:13:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:13:36,191 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:13:36,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:13:36,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:13:36,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:13:36,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:13:36,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:13:36,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:13:36,195 INFO L87 Difference]: Start difference. First operand 987131 states and 1643492 transitions. Second operand 4 states. [2019-09-10 04:14:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:14:00,206 INFO L93 Difference]: Finished difference Result 2500010 states and 4147019 transitions. [2019-09-10 04:14:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:14:00,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-10 04:14:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:14:22,564 INFO L225 Difference]: With dead ends: 2500010 [2019-09-10 04:14:22,564 INFO L226 Difference]: Without dead ends: 2500010 [2019-09-10 04:14:22,565 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:14:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500010 states.